Abstract
Structured peer-to-peer (p2p) networks are highly distributed systems with a potential to support business applications. There are numerous different suggestions on how to implement such systems. However, before legal p2p systems can become mainstream they need to offer improved efficiency, robustness, and stability. While Chord is the most researched and best understood mechanism, the Kademlia algorithm is widely-used in deployed applications. There are still many open questions concerning the performance of the latter. In this paper we identify the main problems of Kademlia by large scale simulations and present modifications which help to avoid those problems. This way, we are able to significantly improve the performance and robustness of Kademlia-based applications, especially in times of churn and in unstable states. In particular, we show how to increase the stability of the overlay, make searches more efficient, and adapt the maintenance traffic to the current churn rate in a self-organizing way.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Azureus. URL: http://azureus.sourceforge.net/.
A. Binzenhöfer and P. Tran-Gia. Delay Analysis of a Chord-based Peer-to-Peer File-Sharing System. In ATNAC 2004, Sydney, Australia, December 2004.
Andreas Binzenhöfer, Dirk Staehle, and Robert Henjes. On the Stability of Chord-based P2P Systems. In GLOBECOM 2005, page 5, St. Louis, MO, USA, November 2005.
Youki Kadobayashi. Achieving Heterogeneity and Fairness in Kademlia. In Proceedings of IEEE/IPSJ International Workshop on Peer-to-Peer Internetworking co-located with Symposium on Applications and the Internet (SAINT2004), pages 546–551, January 2004.
Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell, and Seif Haridi. A Statistical Theory of Chord under Churn. In 4th International Workshop on Peer-To-Peer Systems, Ithaca, New York, USA, February 2005.
Jinyang Li, Jeremy Stribling, Thomer M. Gil, Robert Morris, and M. Frans Kaashoek. Comparing the performance of distributed hash tables under churn. In Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS04), San Diego, CA, February 2004.
Petar Maymounkov and David Mazieres. Kademlia: A peer-to-peer information system based on the xor metric. In IPTPS 2002, Cambridge, MA, USA, March 2002.
K. Pawlikowski, H.-D.J. Jeong, and J.-S. Ruth Lee. On credibility of simulation studies of telecommunication networks. In IEEE Communications Magazine, January 2002.
Sean Rhea, Dennis Geels, Timothy Roscoe, and John Kubiatowicz. Handling Chum in a DHT. In 2004 USENIX Annual Technical Conference, Boston, MA, June 2004.
Ion Stoica, Robert Morris, David Karger, M. Frans. Kaashoek, and Hari Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In ACM SIGCOMM 2001, San Diego, CA, August 2001.
Daniel Stutzbach and Reza Rejaie. Improving lookup performance over a widely-deployed dht. In IEEE INFOCOM 2006, Barcelona, Spain, April 2006.
Skype Technologies. Skype. URL: http://www.skype.com.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Binzenhöfer, A., Schnabel, H. (2007). Improving the Performance and Robustness of Kademlia-Based Overlay Networks. In: Braun, T., Carle, G., Stiller, B. (eds) Kommunikation in Verteilten Systemen (KiVS). Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69962-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-69962-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69961-3
Online ISBN: 978-3-540-69962-0
eBook Packages: Computer Science and Engineering (German Language)