Maintain History Information in DHT based P2P system under Churn

摘要：

Peer-to-Peer (P2P) systems receive growing acceptance, and the need of maintain the history information of nodes appears increasingly in a variety of P2P based applications. In this paper, we propose an algorithm to efficiently maintain the history information of all nodes in Chord like network under churn. In spirit to successor duplication, the duplications of load history are placed in its successors, and are updated in time. If there are some nodes depart from the network, the load history can be retrieved from the successors of the departed one. Simulation results show that, if the network has high churn ratio, great duplication number and large stabilization duration will lead to reliable history information maintenance.

关键词： DHT Churn Chord history information

作者: Dehui Liu Feng Chen Gang Yin HuaiMing Wang Peng Zou

作者单位: School of Computer, National University of Defense Technology,Changsha, P.R.China, 410073 University Network Information Center, Second Military Medical University,Shanghai, P.R.China, 200433 School of Computer, National University of Defense Technology,Changsha, P.R.China, 410073 School of Computer, National University of Defense echnology,Changsha, P.R.China, 410073

会议类型: 国际会议

会议名称: The 2010 2nd International Conference on Future Computer and Communication(第二届未来计算机与通信国际会议 ICFCC 2010)

会议地点: 武汉

会议语种:英文

页码: 633-637

在线出版日期: 2010-05-21（万方平台首次上网日期，不代表论文的发表时间）