一种无"热点"的覆盖网协同缓存策略
作者:
基金项目:

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))

  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [17]
  • |
  • 相似文献 [20]
  • |
  • 引证文献
  • | |
  • 文章评论
    摘要:

    覆盖网协同缓存(overlay cooperative caching,简称OCC)聚集客户节点的资源来提供可扩展、经济有效的缓存服务.在典型的OCC系统中,节点的异构性和工作负载的不对称,容易造成节点资源使用的不平衡,形成一些负载过重的"热点"节点.但对于这一问题,已有的OCC系统缺乏有效的负载平衡机制.针对多媒体内容分发服务,设计了一种无热点的OCC策略——HFOCC(hotspots free overlay cooperative caching).通过将"热点"对象复制到低负载节点,分散服务请求,达到消除热点的目的.为了提高缓存空间的利用率, HFOCC将一个节点的缓存空间动态地划分为home cache和replica cache两部分,并实施统一的缓存管理策略;基于一种"软"副本生命期控制机制,当工作负载发生变化时,冗余副本被及时删除,系统表现出了良好的自适应性.实验证明,HFOCC有效地提高了系统吞吐率和资源利用率.

    Abstract:

    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.

    参考文献
    [1]Iyer S,Rowstron A,Druschel P.Squirrel:A decentralized,peer-to-peer Web cache.In:Proc.of the 21st Syrup.on Principles of Distributed Computing(PDOC 2002).New York:ACM Press,2002.213-222.
    [2]Ling B,Wang XY,Zhou AY,Ng WS.A collaboration Web caching system based on peer-to-peer architecture.Chinese Journal of Computers,2005,28(2):107-178(in Chinese with English abstract).
    [3]Linga P,Gupta I,Birman K A churn-resistant peer-to-peer Web caching system.In:Liu P,Pal P,eds.Proc.of the ACM Workshop on Survivable and Self-Regenerative Systems.New York:ACM Press,2003.1-10.
    [4]Breslau L,Can P,Fan L,Phillips G,Shenker S.Web caching and zipf-like distributions:Evidence and implications.In:Doshi B,ed.Proc.of the 18th Annual Joint Conf.of the IEEE Computer and Communications Societies(INFOCOM'99).New York:IEEE Communications Society,1999.126-134.
    [5]Saroiu S,Gummandi PK,Gribble SD.A measurement study of peer-to-peer file sharing systems.In:Kienzle MC,Shenoy PJ,eds.Proc.of the Multimedia Computing and Networking(MMC).Bellingham:SPIE,2002.156-170.
    [6]Saroiu S,Gummadi KP,Dram RJ,Gribble SD,Levy HM.An analysis of Internet content delivery systems.In:Culler D,Druschel P,eds.Proc.of the 5th Symp.on Operating Systems Design and Implementation(OSDI 2002).Boston:USENIX Association,2002.315-327.
    [7]Wang J.A survey of Web caching schemes for the Interact.ACM Computer Communication Review,1999,25(9):36-46.
    [8]Rowstron A,Druschel P.Pastry:Scalable,distributed object location and routing for large-scale peer-to-peer systems.In:Guerraoui R,ed.Proc.of the 18th IFIP/ACM Int'l Conf.on Distributed Systems Platforms(Middleware 2001).Berlin:Springer-Verlag,2001.329-350.
    [9]Guo L,Chen SQ,Ren SS,Chen X,.Jiang S.PROP:A scalable and reliable P2P assisted proxy streaming system.In:Tzeng NF,Takizawa M,Hō J,Gakkai S,eds.Proc.of the 24th Int'l Conf.on Distributed Computing Systems(ICDCS 2004).Washington:IEEE Computer Society,2004.778-786.
    [10]Androutsellis-Theotokis S,Spinellis D.A survey of peer-to-peer content distribution technologies.ACM Computing Surveys,2004,36(4):335-371.
    [11]Stoica I,Morris R,Karger D,Kansboek MF,Balakrishnan H.Chord:A scalable peer-to-peer lookup service for Internst applications.ACM SIGCOMM Computer Communication Review,2001,31(4):149-160.
    [12]Ratnasamy S,Francis P,Handley M,Karp R,Shenker S.A scalable content-addressable network.In:Govindan,ed.Proc.of the ACM SIGCOMM 2001.New York:ACM Press,2001.161-172.
    [13]Rao A,Lakshminarayanan K,Surana S,Karp R,Stoica L Load balancing in structured P2P systems.In:Kaashoek F,Stoica I,eds.Proc.of the IPTPS 2003.Berlin,Heidelberg:Spriager-Verlag,2003.256-267.
    [14]Dabek F,Kaashoek F,Karger D,Morris R,Stoica L Wide-Area cooperative storage with CFS.In:Marzullo K,ed.Proc.of the 18th ACM Syrup.on Operating Systems Principles.New York:ACM Press,2001.202-215.
    [15]Druschel P,Rowstron A.PAST:A large-scale,persistent peer-to-peer storage utility.In:IEEE Computer Society,ed.Proc.of the 8th IEEE Workshop on Hot Topics in Operating Systems(HotOS-Ⅷ 2001).Los Alamitos:IEEE Computer Society Press,2001.75-80.
    [16]Gopalakrishnan V,Silaghi B,Bhattacharjee B,Keleher E Adaptive replication in peer-to-peer systems.In:IEEE Computer Society ed.Proc.of the 24th lnt'l Conf.on Distributed Computing Systems(ICDCS 2004).Washington:IEEE Computer Society,2004.360-369.
    [17]Sokolinsky LB.LFU-K:An effective buffer management replacement algorithm.In:Lee YJ,Li JZ,Whang KY,Lee DH,eds.Proc.of the 9th Int'l Conf.Berlin:Springer-Verlag,2004.670-681.
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

李春洪,冯国富,顾铁成,陆桑璐,陈道蓄.一种无"热点"的覆盖网协同缓存策略.软件学报,2008,19(3):744-754

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2006-01-10
  • 最后修改日期:2006-12-06
文章二维码
您是第19939888位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号