Decreasing System Load by Caching in Structured P2P Systems

被引：0
作者：
Xiong, Wei [1 ]
Xie, Dong-Qing [2 ]
Zhou, Zai-Hong [1 ]
Liu, Jie [3 ]
机构：
[1] Hunan Univ, Sch Comp & Commun, Changsha 410082, Hunan, Peoples R China
[2] Guangzhou Univ, Sch Comp Sci & Educ Software, Guangzhou 510006, Peoples R China
[3] Guangzhou Univ, Expt Ctr, Guangzhou 510006, Peoples R China
来源：
HPCC 2008: 10TH IEEE INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, PROCEEDINGS | 2008年
基金：
中国国家自然科学基金;
关键词：
Peer to Peer; Structured Overlays; Replication; Cache; algorithms;
D O I：
10.1109/HPCC.2008.112
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Peer to peer systems are distributed systems, Decreasing. system load is important for improving the scalability of systems. Caching is always used to achieve load balance in structured p2p systems currently, but none of the current caching algorithms take system load into consideration. We proposes a caching model for decreasing system load in structured peer to peer systems, describes how peer uses a passive file requested statistical algorithm to evaluate the reducability query load caused by caching a file to a neighbor, and discusses how to compute the updating overhead under different updating algorithms. Each peer determine whether caching a file to a neighbour is worthwhile is based on the relations between the query load reduced and the updating overhead caused by the caching. Simulation results indicate the caching model can decrease system load effectively.
引用
收藏
页码：234 / +
页数：2
相关论文
共 13 条
  • [1] [Anonymous], P ACM SIGCOMM 02 REP
  • [2] Adaptive load balancing for DHT lookups
    Bianchi, Silvia
    Serbu, Sabina
    Felber, Pascal
    Kropf, Peter
    [J]. ICCCN 2006: 15TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2006, : 411 - +
  • [3] Breslau L, 1999, IEEE INFOCOM SER, P126, DOI 10.1109/INFCOM.1999.749260
  • [4] Byers J, 2003, LECT NOTES COMPUT SC, V2735, P80
  • [5] Castro M, 2004, 2004 INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, P9
  • [6] CLARKE I, 2001, P INT WORKSH DES ISS, P46
  • [7] DATTA A, 2007, P 7 IEEE INT S CLUST, P453
  • [8] JUNG J, 2002, P IEEE ACM T NETW, P589
  • [9] Epichord: Parallelizing the chord lookup algorithm with reactive routing state management
    Leong, B
    Liskov, B
    Demaine, ED
    [J]. 2004 12TH IEEE INTERNATIONAL CONFERENCE ON NETWORKS, VOLS 1 AND 2 , PROCEEDINGS: UNITY IN DIVERSITY, 2004, : 270 - 276
  • [10] LV Q, 2002, P 16 INT C SUP, P84, DOI DOI 10.1145/514191.514206
12