Advertisement

Peer-to-Peer Networking and Applications

, Volume 8, Issue 5, pp 807–821 | Cite as

A performance comparison of Chord and Kademlia DHTs in high churn scenarios

  • Adán G. Medrano-Chávez
  • Elizabeth Pérez-Cortés
  • Miguel Lopez-Guerrero
Article

Abstract

A distributed hash table (DHT) is an important kind of P2P system that provides decentralized services to look up resources in various applications. In this context, Chord and Kademlia are two relevant DHTs and several pieces of work have appeared in the literature where their performance is evaluated. Unfortunately, available results are neither consistent nor concluding. This situation arises from the use of different churn models (i.e., peer arrivals and departures); all of them neglecting the fact that churn happens since the beginning of the lifetime of DHTs. Furthermore, available performance evaluations do not consider that DHT parameter settings are nonequivalent. To address these concerns, in this paper we present an exhaustive, fair and realistic evaluation framework integrated by: 1) A state-of-the-art churn model executed by peers since their creation. 2) An evaluation methodology that considers the difference in meaning of the parameters belonging to different DHTs. 3) A churn metric that quantifies the rate of change of the P2P population. By means of this evaluation framework, we found that under similar conditions, Kademlia exhibits higher performance than Chord. We conclude that DHTs must have mechanisms to deal with high churn during their whole existence, otherwise, they may not achieve a state where peers are correctly connected. Furthermore, our findings suggest that DHTs should rely on less-dynamic peers to improve their performance.

Keywords

Chord Kademlia Churn Dependability DHT Performance 

Notes

Acknowledgments

The corresponding author was supported by a CONACyT scholarship (Mexico).

References

  1. 1.
    Baset SA, Schulzrinne HG (2006) An analysis of the skype peer-to-peer internet telephony protocol.In: Proceedings of the 25th IEEE international conference on computer communications (INFOCOM), Barcelona, pp 1–11Google Scholar
  2. 2.
    Baumgart I, Heep B, Krause S (2007) OverSim: A flexible overlay network simulation framework.In: Proceedings of 10th IEEE global internet symposium in conjunction with IEEE INFOCOM, Anchorage, pp 79–84Google Scholar
  3. 3.
    Baumgart I, Mies S (2007) S/Kademlia: A practicable approach towards secure key-based routing. Proc 13th Int Conf Parallel Distributed Syst (PDCS) 2:1–8Google Scholar
  4. 4.
    Binzenhfer A, Leibnitz K (2007) Estimating churn in structured P2P networks.In: Proceedings of the 20th international teletraffic conference on managing traffic performance in converged networks, ITC20’07. Springer-Verlag, Ottawa, pp 630–641Google Scholar
  5. 5.
    Castro M, Costa M, Rowstron A (2004) Performance and dependability of structured peer-to-peer overlays.In: Proceedings of the 2004 international conference on dependable systems and networks (DSN), Florence, pp 9–18Google Scholar
  6. 6.
    Castro MC , Kassler AJ, Chiasserini CF, Casetti C, Korpeoglu I (2010) Peer-to-peer overlay in mobile ad-hoc networks. In: Shen X, Yu H, Buford J, Akon M (eds) Handbook of peer-to-peer networking. Springer US, Boston, pp 1045–1080CrossRefGoogle Scholar
  7. 7.
    Chen K, Shen H, Zhang H (2011) Leveraging social networks for P2P content-based file sharing in mobile ad hoc networks.In: Proceedings of the IEEE 8th international conference on mobile adhoc and sensor systems (MASS), Valencia, pp 112–121Google Scholar
  8. 8.
    Eastlake DE, Jones PE (1995) US secure hash algorithm 1 (SHA1). Tech. Rep FIPS 180-1,U.S. Department of Commerce/NIST, Springfield, EUAGoogle Scholar
  9. 9.
    Gummadi K P, Gummadi R , Gribble S D, Ratnasamy S, Shenker S, Stoica I (2003) The impact of DHT routing geometry on resilience and proximity.In: Proceedings of the conference on applications, technologies, architectures, and protocols for computer communications (ACM SIGCOMM), Karlsruhe, pp 381–394Google Scholar
  10. 10.
    Gupta I, Birman K, Linga P, Demers A, van Renesse R (2003) Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead.In:Proceedings of the 2nd international workshop on peer-to-peer systems (IPTPS). Berkeley, USAGoogle Scholar
  11. 11.
    Harjula E, Koskela T, Ylianttila M (2011) Comparing the performance and efficiency of two popular DHTs in interpersonal communication.In: Proceedings of the IEEE wireless communications and networking conference (WCNC), Cancun, pp 2173–2178Google Scholar
  12. 12.
    Herrera O, Znati T (2007) Modeling churn in P2P networks.In: Proceedings of the 40th annual simulation symposium (ANSS), Norfolk, pp 33–40Google Scholar
  13. 13.
    Huffaker B, Plummer D, Moore D, Claffy K (2002) Topology discovery by active probing.In: Proceedings of the symposium on applications and the internet workshops (SAINT), Nara, pp 90–96Google Scholar
  14. 14.
    Kaashoek MF, Karger DR (2003) Koorde: a simple degree-optimal distributed hash table.In: Proceedings of the 2nd international workshop on peer-to-peer systems (IPTPS), Berkeley, pp 98–107Google Scholar
  15. 15.
    Kong J S, Bridgewater J S A, Roychowdhury V P (2008) Resilience of structured P2P systems under churn: The reachable component method. Comput Commun 31(10):2109–2123.  http://dx.doi.org/10.1016/j.comcom.2008.01.051 CrossRefGoogle Scholar
  16. 16.
    Koskela T, Harjula E, Kassinen O, Ylianttila M (2011) Robustness of a P2P community management system based on two-level hierarchical DHT overlays.In: Proceedings of the IEEE symposium on computers and communications (ISCC), Kerkyra, pp 881–886Google Scholar
  17. 17.
    Krishnamurthy S, El-Ansary S, Aurell E, Haridi S (2008) An analytical study of a structured overlay in the presence of dynamic membership. IEEE/ACM Trans Networking 16(4):814–825. doi: http://dx.doi.org/10.1109/TNET.2007.905590 CrossRefGoogle Scholar
  18. 18.
    Lee JW, Schulzrinne H, Kellerer W (2011) Despotovic, Z.: 0 to 10k in 20 seconds: Bootstrapping large-scale dht networks.In: Proceedings of the IEEE international conference on communications (ICC), Kyoto, pp 1–6Google Scholar
  19. 19.
    Li J, Stribling J, Gil TM, Morris R, Kaashoek MF (2004) Comparing the performance of distributed hash tables under churn.In: Proceedings of the third international conference on peer-to-peer systems (IPTPS), La Jolla, pp 87–99Google Scholar
  20. 20.
    Liben-Nowell D, Balakrishnan H, Karger D. (2002) Analysis of the evolution of peer-to-peer systems.In: Proceedings of the twenty-first annual symposium on principles of distributed computing (PODC), Monterey, pp 233–242Google Scholar
  21. 21.
    Liu Z, Yuan R, Li Z, Li H, Chen G (2006) Survive under high churn in structured P2P systems: Evaluation and strategy.In: Proceedings of the 6th international conference on computational science (ICCS), Reading, pp 404–411Google Scholar
  22. 22.
    Mahadevan P, Krioukov DV, Fomenkov M, Huffaker B, Dimitropoulos XA, Claffy KC, Vahdat A (2005) Lessons from three views of the Internet topology.Computing Research Repository abs/cs/0508033Google Scholar
  23. 23.
    Maymounkov P, Mazires D (2002) Kademlia: A peer-to-peer information system based on the XOR metric.In: Revised papers from the first international workshop on peer-to-peer systems. Cambridge, USA, pp 53–65Google Scholar
  24. 24.
    Meshkova E, Riihijrvi J, Petrova M, Mähönen P (2008) A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks. Comput Netw 52(11):2097–2128. doi: 10.1016/j.comnet.2008.03.006 CrossRefGoogle Scholar
  25. 25.
    Miller B A, Nixon T, Tai C, Wood M D (2001) Home networking with universal plug and play. IEEE Commun Mag 39(12):104–109. doi: 10.1109/35.968819 CrossRefGoogle Scholar
  26. 26.
    Montresor A, Jelasity M, Babaoglu O (2005) Chord on demand.In: Proceedings of the fifth IEEE international conference on peer-to-peer computing (P2Px), Konstanz, pp 87–94Google Scholar
  27. 27.
    Ou Z, Harjula E, Kassinen O, Ylianttila M (2010) Performance evaluation of a kademlia-based communication-oriented P2P system under churn. Comput Netw 54(5):689–705. doi: 10.1016/j.comnet.2009.09.022 CrossRefzbMATHGoogle Scholar
  28. 28.
    Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. Comput Commun Rev 31(4):161–172. doi: 10.1145/964723.383072 CrossRefGoogle Scholar
  29. 29.
    Rhea S, Geels D, Roscoe T, Kubiatowicz J (2004) Handling churn in a DHT.In: Proceedings of the annual conference on usenix annual technical conference (USENIX), BostonGoogle Scholar
  30. 30.
    Rhea S, Wells C, Eaton P, Geels D, Zhao B, Weatherspoon H, Kubiatowicz J (2001) Maintenance-free global data storage. IEEE Internet Comput 5(5):40–49. doi: 10.1109/4236.957894 CrossRefGoogle Scholar
  31. 31.
    Rowstron AIT, Druschel P (2001) Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems.In: Proceedings of the IFIP/ACM international conference on distributed systems platforms (Middleware). Heidelberg, Germany, pp 329–350Google Scholar
  32. 32.
    Stoica I, Morris R, Liben-Nowell D, Karger D R, Kaashoek M F, Dabek F, Balakrishnan H (2003) Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans Networking 11(1):17–32. doi: 10.1109/TNET.2002.808407 CrossRefGoogle Scholar
  33. 33.
    Stutzbach D, Rejaie R (2006) Understanding churn in peer-to-peer networks.In: Proceedings of the 6th ACM SIGCOMM conference on internet measurement (IMC), Rio de Janeiro, pp 189–202Google Scholar
  34. 34.
    Yao Z, Loguinov D (2011) Analysis of link lifetimes and neighbor selection in switching DHTs. IEEE Trans Parallel Distrib Syst 22(11):1834–1841. doi: 10.1109/TPDS.2011.101 CrossRefGoogle Scholar
  35. 35.
    Zhao BY, Kubiatowicz JD, Joseph AD (2001) Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, University of California at Berkeley, Berkeley. USAGoogle Scholar
  36. 36.
    Zhuang SQ, Zhao BY, Joseph AD, Katz RH, Kubiatowicz JD (2001) Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination.in: Proceedings of the 11th international workshop on network and operating systems support fordigital audio and video (NOSSDAV). USA, New York, pp 11–20Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Adán G. Medrano-Chávez
    • 1
  • Elizabeth Pérez-Cortés
    • 1
  • Miguel Lopez-Guerrero
    • 1
  1. 1.Department of Electrical EngineeringMetropolitan Autonomous UniversityIztapalapaMexico

Personalised recommendations