Avoidance of churn rate through temporal centralization in Chord

In this paper we have introduced a concept called temporal centralization to handle high churn rate without disturbing the original decentralized architecture of Peer-to-Peer overlay system. The frequent joining/leaving of nodes in a P2P system costs high. We know that the well-known structured system like Chord handles query in O(logn), but node joining/leaving is O(logn)2, where n is the number of nodes available in the system. Therefore, with high churn rate, it is hard to maintain the cost of routing table. In our approach, updation of all routing tables are not done immediately after a node joining the system. We introduce the concept of temporal centralization to Chord protocol that reduces the churn rate retaining the same number of steps for query processing. The simulation results show the improvement of performance of P2P network reducing transient node population.

[1]  Guillaume Urvoy-Keller,et al.  Hierarchical Peer-To-Peer Systems , 2003, Parallel Process. Lett..

[2]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[3]  Liu Ye,et al.  TCS-Chord: An Improved Routing Algorithm to Chord Based on the Topology-aware Clustering in Self-organizing Mode , 2005, 2005 First International Conference on Semantics, Knowledge and Grid.

[4]  Yu Jiong,et al.  DR-Chord-FAn Efficient Double-Ring Chord Protocol , 2007, Sixth International Conference on Grid and Cooperative Computing (GCC 2007).

[5]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[6]  Yi Jiang,et al.  A Low Latency Chord Routing Algorithm for DHT , 2006, 2006 First International Symposium on Pervasive Computing and Applications.

[7]  Karl Aberer,et al.  P-Grid: A Self-Organizing Access Structure for P2P Information Systems , 2001, CoopIS.

[8]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[9]  Jing Wang,et al.  A Bidirectional Query Chord System Based on Latency-Sensitivity , 2006, 2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06).

[10]  David R. Karger,et al.  Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.

[11]  Xudong Yang,et al.  An Optimized Chord Algorithm for Accelerating the Query of Hot Resources , 2008, 2008 International Symposium on Computer Science and Computational Technology.

[12]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[13]  Daniel Stutzbach,et al.  Characterizing files in the modern Gnutella network , 2006, Electronic Imaging.

[14]  A. Binzenhofer,et al.  Analyzing and modifying Chord's stabilization algorithm to handle high churn rates , 2005, 2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic.

[15]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[16]  Daniel Stutzbach,et al.  Characterizing files in the modern Gnutella network , 2007, Multimedia Systems.

[17]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[18]  Paolo Santi,et al.  MeshChord: A Location-Aware, Cross-Layer Specialization of Chord for Wireless Mesh Networks (concise contribution) , 2008, 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom).

[19]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[20]  Minglu Li,et al.  PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity , 2006, IEICE Trans. Inf. Syst..

[21]  Tore Risch,et al.  EDUTELLA: a P2P networking infrastructure based on RDF , 2002, WWW.

[22]  Dong Xuan,et al.  RChord: an enhanced Chord system resilient to routing attacks , 2003, 2003 International Conference on Computer Networks and Mobile Computing, 2003. ICCNMC 2003..