期刊文献+

一种无“热点”的覆盖网协同缓存策略 被引量:6

A Hotspots-Free Overlay Cooperative Caching Scheme
下载PDF
导出
摘要 覆盖网协同缓存(overlay cooperative caching,简称OCC)聚集客户节点的资源来提供可扩展、经济有效的缓存服务.在典型的OCC系统中,节点的异构性和工作负载的不对称,容易造成节点资源使用的不平衡,形成一些负载过重的"热点"节点.但对于这一问题,已有的OCC系统缺乏有效的负载平衡机制.针对多媒体内容分发服务,设计了一种无热点的OCC策略——HFOCC(hotspots free overlay cooperative caching).通过将"热点"对象复制到低负载节点,分散服务请求,达到消除热点的目的.为了提高缓存空间的利用率,HFOCC将一个节点的缓存空间动态地划分为home cache和replica cache两部分,并实施统一的缓存管理策略;基于一种"软"副本生命期控制机制,当工作负载发生变化时,冗余副本被及时删除,系统表现出了良好的自适应性.实验证明,HFOCC有效地提高了系统吞吐率和资源利用率. Overlay Web caching (OCC) exploits resources of peers to provide scalable and cost-effective web caching service. In a typical OCC system, which is often characterized by highly heterogeneous node capacities and skewed query distributions, the resources of each node may be utilized in an unbalanced manner, i.e., some nodes are overloaded and become "hotspots". Unfortunately, there are no effective load balancing mechanisms in existing OCC systems to relief the "hotspots". This paper proposes a hotspots-free OCC scheme called HFOCC for multimedia content delivery service. Through replicating "hot" objects adaptively to lightly loaded nodes, loads are distributed more evenly across the whole network. Consequently, the hotspots are relieved. In order to utilize cache resource more effectively, HFOCC splits a node's cache space dynamically into two parts, namely the home cache and the replica cache, and manages them by a uniform policy. With a "soft" lifetime control mechanism, the redundant object replicas are deleted adaptively, and the system performs well under dynamically changing workloads. Experimental results show that HFOCC improves resource utilization and system throughput markedly.
出处 《软件学报》 EI CSCD 北大核心 2008年第3期744-754,共11页 Journal of Software
基金 Supported by the National Natural Science Foundation of China under Grant Nos.60573106, 60402027, 60573131 (国家自然科学基金) the Natural Science Foundation of Jiangsu Province of China under Grant No.BK2005411 (江苏省自然科学基金) the National Basic Research Program of China under Grant No.2002CB312002 (国家重点基础研究发展计划(973)
关键词 覆盖网协同缓存 复制 负载平衡 多媒体内容分发 副本生命期管理 overlay cooperative caching replication load balancing multimedia content delivery replica lifetime management
  • 相关文献

参考文献1

二级参考文献12

  • 1Ng WS, Ooi BC, Tan KL. BestPeer: A self-configurable peer-to-peer system. In: Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, 2002, 272.
  • 2Bowman C.M., Danzig P.B., Hardy D.R., Manber U., Schwartz M.F. The harvest information discovery and access system. Computer Networks and ISDN Systems,1995,28(1~2): 119~125.
  • 3Wolman A., Voelker G.M., Sharma N., Cardwell N., Karlin A.R., Levy H.M. On the scale and performance of cooperative Web proxy caching. Operating Systems Review, 1999, 34(5): 16~31.
  • 4Ratnasamy S., Francis P., Handley M., Karp R., Shenker S. A scalable content-addressable network. In: Proceedings of ACM SIGCOMM, San Diego, CA, 2001, 161~172.
  • 5Rowstron A., Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science 2218, 2001, 329~350.
  • 6Stoica I., Morris R., Karger D., Kaashoek M.F., Balakrishnan H. Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proceedings of the ACM SIGCOMM, San Diego, 2001, 149~160.
  • 7Wang J. A survey of Web caching schemes for the Internet. ACM Computer Communication Review, 1999, 29(5): 36~46.
  • 8Kurcewicz M., Sylwestrzak W., Wierzbicki A. A distributed WWW cache. Computer Networks and ISDN Systems, 2001, 30(22~23): 2261~2267.
  • 9Druschel P., Rowstron A. PAST: A large-scale persistent peer-to-peer storage utility. In: Proceedings of the 8th Workshop on Hot Topics in Operating Systems (HotOS-VIII). Schoss Elmau, Germany, 2001, 65~70.
  • 10Rowstron A., Druschel P. Storage management and caching in PAST, A large-scale persistent peer-to-peer storage utility. In: Proceedings of the 18th ACM SOSP'01, Banff, Canada, 2001, 188~201.

共引文献18

同被引文献28

  • 1杨舰,吕智慧,钟亦平,张世永.一种基于兴趣域的高效对等网络搜索方案[J].计算机研究与发展,2005,42(5):804-809. 被引量:24
  • 2李运娣,冯勇.基于DHT的P2P搜索定位技术研究[J].计算机应用研究,2006,23(10):226-228. 被引量:19
  • 3Mahanti A, Eager D, Williamson C. Temporal Locality and Its Impact on Web Proxy Cache Performance[J]. Performance Evaluation, 2000, 42(2): 187-203.
  • 4Shi Lei, Gu Zhimin, We Lin, et al. An Applicative Study of Zipf's Law on Web Cache[J]. International Journal of Information Technology, 2006, 12(4): 49-58.
  • 5Bahat O, Makowski A M. Optimal Replacement Policies for Non-uniform Cache Objects with Optional Eviction[C]//Proc. of INFOCOM'03. San Francisco, USA: [s. n.], 2003: 427-437.
  • 6Balamash A, Krunz M. An Overview of Web Caching Replacement Algorithms[J]. IEEE Communication Surveys & Tutorials, 2004, 6(2): 44-56.
  • 7Steinmetz R,Wehrle K.P2P系统及其应用[M].北京:机械工业出版社,2008.
  • 8Manfredi S, di Bemardo M, Garofalo F. Small- World effects in networks:An engineering interpretation. ISCAS[EB/ OL]. 2004 - 04 - 04. http://ieeexplore. ieee. org/xpls/absall.jsp? arnumber = 1329130.
  • 9Joseph S. An Extendible Open Source P2P Simulator[J]. P2P Journal, 2003 (12) : 105 - 123.
  • 10Merugu S, Srinivasan S, Zegura E. P - sim: A Simulator for Peer-to- Peer Networks[C]//In proceedings of the llth IEEE international Symposium on Modeling, Analysis, Simulation of Computer and Telecommunications Systems (MASCOTS'03). [s. l. ] : Is. n. ] ,2003:213 - 218.

引证文献6

二级引证文献52

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部