Skip to main content
SpringerLink
Log in

Avoidance of churn rate through temporal centralization in Chord

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Gnutella homepage (2007) http://www.gnutella.com

  2. KaZaA homepage (2008) http://www.kazaa.com

  3. Nejdl W, Wolf B, Qu, C, Decker S, Sintex M, Naeve A, Nilsson M, Palmer M, Risch T (2002) Edutella : a P2P networking infrastructure based on rdf. In: Proceedings of the 11th international conference on World Wide Web, WWW’02. ACM, pp 604–615

  4. Stoica I, Morris R, Karger D, Kaashoek M, Balakrishnan H (2001) Chord: a scalable Peer-to-Peer lookup service for internet applications. In: Proceedings of SIGCOMM 2001, pp 149–160

  5. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. In: Proceedings of ACM SIGCOMM 2001, pp 161–172

  6. Rowstron A, Druschel P (2001) Pastry: scalable, distributed object location and routing for large-scale Peer-to-Peer systems. In: IFIP/ACM international conference on distributed systems platforms (Middleware), Heidelberg, Germany, pp 329–350

  7. Aberer K (2001) P-grid: a self-organizing access structure for P2P information systems. In: Proceedings of the 9th international conference on cooperative information systems (CoopIS 2001), Trento, Italy, pp 179–194

  8. P-Grid homepage (2008) http://www.p-grid.org

  9. Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD, Kubiatowicz JD (2004) Tapestry: a resilient global-scape overlay for service deployment. IEEE J Sel Areas Commun 22:41–53

    Article  Google Scholar 

  10. Zhao BY, Kubiatowicz J, Joseph AD (2001) Tapestry: an infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, Computer Science Division, University of California, Berkeley

  11. Saroiu S, Gummadi PK, Gribble SD (2002) A measurement study of Peer-to-Peer file sharing systems. In: Proceedings of the 2002 multimedia computing and networking (MMCN 2002), pp 156–170

  12. Kaashoek F, Karger DR (2003) Koorde: a simple degree-optimal hash table. In: 2nd international Peer to Peer systems workshop (IPTPS 2003), Berkeley, CA, USA, pp 98–107

  13. Hong F, Li M, Yu J, Wang Y (2005) PChord: improvement on chord to achieve better routing efficiency by exploiting proximity. In: Proceedings of the first international workshop on mobility in Peer-to-Peer systems, vol 8, pp 806–811

  14. Shao-Shan Y, Jiong Y, Kamil K, Qi-Gang S (2007) DR-Chord-Fan efficient double-ring chord protocol, gcc. In: Sixth international conference on grid and cooperative computing, pp 197–202

  15. Ye L, Peng Y, Zi C, Jiagao W (2005) TCS-Chord: an improved routing algorithm to Chord based on the topology-aware clustering in self-organizing mode. In: Proceedings of the first international conference on semantics, knowledge and grid, pp 25

  16. Xuan D, Chellappan S, Krishnamoorthy M (2003) RChord: an enhanced Chord system resilient to routing attacks. In: Computer networks and mobile computing, pp 253–260

  17. Burresi S, Canali C, Renda ME, Santi P (2008) MeshChord: a location-aware, cross-layer specialization of Chord for wireless mesh networks (concise contribution). In: Pervasive computing and communications, pp 206–212

  18. Li J, Yang X (2008) An optimized Chord algorithm for accelerating the query of hot resources. In: International symposium on computer science and computational technology, pp 644–647

  19. Wang J, Yang S, Guo L (2006) A bidirectional query Chord system based on latency-sensitivity. In: Fifth international conference on grid and cooperative computing, pp 164–167

  20. Kunzmann G, Binzenhofer A, Henjes R (2005) Analyzing and modifying Chord’s stabilization algorithm to handle high churn rates. In: IEEE international conference on networks, vol 2

  21. Jiang Y, You J (2006) A low latency Chord routing algorithm for DHT. In: 1st international symposium on pervasive computing and applications, pp 825–830

  22. Garces-Erce L, Biersack E, Felber P, Ross K, Urvoy-Keller G (2003) Hierarchical Peer-to-Peer systems. In: Proc. Euro-Par, pp 643–657

  23. Zhao S, Stutzbach D, Rejaie R (2006) Characterizing files in the modern Gnutella network: a measurement study. In: Proc. multimedia computing and networking conf., San Jose, CA, pp 1–13

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology Guwahati, Guwahati, 781039, Assam, India

    Guruprasad Khataniar & Diganta Goswami

Authors
  1. Guruprasad Khataniar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Diganta Goswami
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guruprasad Khataniar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khataniar, G., Goswami, D. Avoidance of churn rate through temporal centralization in Chord. Peer-to-Peer Netw. Appl. 4, 251–258 (2011). https://doi.org/10.1007/s12083-010-0080-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-010-0080-4

Keywords

Search

Navigation