Skip to main content
SpringerLink
Log in

Lookup Performance Deficiencies in the KAD Network

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

The KAD network is one of the largest distributed hash tables (DHT) deployed in the real world. DHT is designed to provide scalable peer-to-peer lookup service. Its real-world lookup performance, however, is recognized as inefficient. We ran wide-range measurements on the KAD network to evaluate this inefficiency by examining peer behaviors in publishing and retrieving information using routing tables and publishing tables. Our measurements show that even though routing tables are well maintained, the current refreshment scheme of publishing tables and lack of effective incentive policy cause lookup performance deficiency. Based on our findings, we propose three improvement schemes, analyze their strengths, and give suggestions to implementations.

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. Brunner R (2006) A performance evaluation of the KAD-protocol. Master’s thesis, Institute Eurecom

  2. Douceur J, Donath JS (2002) The sybil attack. USENIX IPTPS

  3. eMule Officical Website Retrieved Mar 3, 2013, from. http://sourceforge.net/projects/amule/

  4. eMule Officical Website Retrieved Mar 3, 2013, from. http://www.emule.com/

  5. Feldman M, Papadimitriou C, Chuang J, Stoica I (2006) Free-riding and whitewashing in peer-to-peer systems. IEEE J Sel Areas Commun 24(5):1010–1019

    Article  Google Scholar 

  6. Gummadi KP, Dunn RJ, Saroiu S, Gribble SD, Levy HM, Zahorjan J (2003) Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proceedings of the 9th ACM symposium on operating systems principles, SOSP ’03. ACM, New York, pp 314–329

    Chapter  Google Scholar 

  7. Handurukande SB, Kermarrec A-M, Le Fessant F, Massoulié L, Patarin S (2006) Peer sharing behaviour in the edonkey network, and implications for the design of server-less file sharing systems. In: Proceedings of the 1st ACM SIGOPS/EuroSys European conference on computer systems 2006, EuroSys ’06. ACM, New York, pp 359–371

    Chapter  Google Scholar 

  8. Kamvar SD, Schlosser MT, Garcia-Molina H (2003) The eigentrust algorithm for reputation management in p2p networks. In: Proceedings of the 12th international conference on world wide web. ACM, Budapest, pp 640–651

    Google Scholar 

  9. Kang HJ, Chan-Tin E, Hopper NJ, Kim Y (2009) Why KAD lookup fails. In: IEEE peer-to-peer computing (IEEE P2P)

  10. Lai K, Feldman M, Stoica I, Chuang J (2003) Incentives for cooperation in peer-to-peer networks. In: Workshop on economics of peer-to-peer systems. pp 1243–1248

  11. Li Y, Gruenbacher D, Scoglio C (2011) Reward only is not enough: evaluating and improving the fairness policy of the p2p file sharing network emule/edonkey. Peer-to-Peer Netw Appl 5:40–57

    Article  Google Scholar 

  12. Lin M, Fan B, Lui JCS, Chiu D-M (2007) Stochastic analysis of file-swarming systems. Perform Eval 64(9–12):856–875

    Article  Google Scholar 

  13. Locher T, Mysicka D, Schmid S, Wattenhofer R (2009) A peer activity study in eDonkey and KAD. In: International workshop on dynamic networks: algorithms and security (DYNAS)

  14. Ma RTB, Lee SCM, Lui JCS, Yau DKY (2006) Incentive and service differentiation in p2p networks: a game theoretic approach. IEEE/ACM Trans Netw 14(5):978–991

    Article  Google Scholar 

  15. Marti S, Garcia-Molina H (2006) Taxonomy of trust: categorizing p2p reputation systems. Comput Netw 50:472–484

    Article  MATH  Google Scholar 

  16. Maymounkov P, Mazires D (2002) Kademlia: a peer-to-peer information system based on the xor metric. In:Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS)

  17. Memon G, Rejaie R, Guo Y, Stutzbach D (2009) Large-scale monitoring of DHT traffic. In: Proceedings of 8th international workshop workshop on peer-to-peer systems (IPTPS)

  18. PlanetLab Retrieved Mar 3, 2013, from, http://www.planet-lab.org/

  19. Qiu D, Srikant R (2004) Modeling and performance analysis of bittorrent-like peer-to-peer networks. In: ACM SIGCOMM. ACM, Portland, pp 367–378

    Google Scholar 

  20. 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. Springer-Verlag, London, pp 329–350

    Google Scholar 

  21. Seibert J, Torres R, Mellia M, Munafo MM, Nita-Rotaru C, Rao S (2012) The internet-wide impact of p2p traffic localization on isp profitability. IEEE/ACM Trans Netw 20(6):1910–1923

    Article  Google Scholar 

  22. Steiner M (2008) Structures and algorithms for peer-to-peer cooperation. PhD thesis, Thesis, 12

  23. Steiner M, Biersack EW, Ennajjary T (2007) Actively monitoring peers in KAD. In: Proceedings of the 6th international workshop on peer-to-peer systems (IPTPS)

  24. Steiner M, Carra D, Biersack EW (2008) Faster content access in KAD. In: IEEE peer-to-peer computing (IEEE P2P)

  25. Steiner M, En-najjary T, Biersack EW (2007) Exploiting KAD: possible uses and misuses. ACM SIGCOMM CCR 37:65–69

    Article  Google Scholar 

  26. Steiner M, En-Najjary T, Biersack EW (2007) A global view of KAD. In: ACM internet measurement conference (IMC)

  27. Steiner M, En-Najjary T, Biersack EW (2009) Long term study of peer behavior in the KAD DHT. IEEE/ACM Trans Netw 17(5):1371–1384

    Article  Google Scholar 

  28. Stoica I, Morris R, Karger D, Frans Kaashoek M, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM conference. San Diego

  29. Stutzbach D, Rejaie R (2006) Improving lookup performance over a widely-deployed DHT. In: 25th IEEE international conference on computer communications (INFOCOM)

  30. Stutzbach D, Rejaie R (2006) Understanding churn in peer-to-peer networks. In: Internet measurement conference (IMC)

  31. Yu J, Fang C, Xu J, Chang E-C, Li Z (2009) Id repetition in KAD. In: IEEE international conference on peer-to-peer computing

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Kansas State University, Manhattan, KS, 66506, USA

    Yunzhao Li, Don Guenbacher & Caterina Scoglio

  2. Department of Computing and Information Sciences, Kansas State University, Manhattan, KS, 66506, USA

    Hong Liu

Authors
  1. Yunzhao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Don Guenbacher
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Caterina Scoglio
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hong Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, Y., Liu, H., Guenbacher, D. et al. Lookup Performance Deficiencies in the KAD Network. Mobile Netw Appl 19, 649–659 (2014). https://doi.org/10.1007/s11036-013-0492-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-013-0492-5

Keywords

Search

Navigation