Title :
Effectively Decreasing the Maintenance Overhead of Highly Dynamic Chord System
Author :
Ren, Xiao-jin ; Gu, Zhi-Min ; Ding, Xiao-guang ; Duan, Zhao-lei
Author_Institution :
Sch. of Comput. Sci. & Technol., Beijing Inst. of Technol., Beijing
Abstract :
P2P systems are highly dynamic in nature. Nodes may join in or leave the P2P system at any moment. Frequently joining or leaving must increase the maintenance overhead greatly in DHT-based P2P system. The main reason of causing the cost is the lookup cost that nodes build their fingers. In this paper we introduce an iterative join algorithm for Chord that is suitable for highly dynamic environments. Iterative join algorithm builds the finger of node by iterative lookup and by the help of fingers information of nodes in the lookup path. Theory analysis and simulation show that Iterative join algorithm decreases efficiently the maintenance overhead and improve the lookup performance.
Keywords :
iterative methods; maintenance engineering; peer-to-peer computing; P2P systems; highly dynamic chord system; iterative join algorithm; iterative lookup; lookup path; maintenance overhead; Algorithm design and analysis; Analytical models; Buildings; Computer science; Costs; Delay; Fingers; Iterative algorithms; Performance analysis; Routing; Iterative; Join algorithm; P2P;
Conference_Titel :
Advanced Communication Technology, 2008. ICACT 2008. 10th International Conference on
Conference_Location :
Gangwon-Do
Print_ISBN :
978-89-5519-136-3
DOI :
10.1109/ICACT.2008.4494094
