ISAAC 2013: Algorithms and Computation pp 711-721 | Cite as

A Probabilistic Analysis of Kademlia Networks

  • Xing Shi Cai
  • Luc Devroye
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8283)

Abstract

Kademlia [3] is currently the most widely used searching algorithm in p2p (peer-to-peer) networks. This work studies an essential question about Kademlia from a mathematical perspective: how long does it take to locate a node in the network? To answer it, we introduce a random graph \(\mathcal{K}\) and study how many steps are needed to locate a given vertex in \(\mathcal{K}\) using Kademlia’s algorithm, which we call the routing time. Two slightly different versions of \(\mathcal{K}\) are studied. In the first one, vertices of \(\mathcal{K}\) are labeled with fixed IDs. In the second one, vertices are assumed to have randomly selected IDs. In both cases, we show that the routing time is about c logn, where n is the number of nodes in the network and c is an explicitly described constant.

Keywords

Probabilistic Analysis Random Graph Distribute Hash Table Mathematical Perspective Lower Common Ancestor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Davis, C., Fernandez, J., Neville, S., McHugh, J.: Sybil attacks as a mitigation strategy against the storm botnet. In: Proceedings of the 3rd International Conference on Malicious and Unwanted Software, Malware 2008, pp. 32–40 (2008)Google Scholar
  2. 2.
    Davis, C.R., Neville, S., Fernandez, J.M., Robert, J.-M., McHugh, J.: Structured peer-to-peer overlay networks: Ideal botnets command and control infrastructures? In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 461–480. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  3. 3.
    Maymounkov, P., Mazières, D.: Kademlia: A peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Schollmeier, R.: A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications. In: Proceedings of 1st International Conference on Peer-to-Peer Computing, pp. 101–102 (2001)Google Scholar
  5. 5.
    Steinmetz, R., Wehrle, K. (eds.): Peer-to-Peer Systems and Applications. LNCS, vol. 3485. Springer, Heidelberg (2005)Google Scholar
  6. 6.
    Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking up data in P2P systems. Communications of the ACM 46(2), 43–48 (2003)CrossRefGoogle Scholar
  7. 7.
    Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. SIGCOMM Computer Communication Review 31(4), 161–172 (2001)CrossRefGoogle Scholar
  9. 9.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. SIGCOMM Computer Communication Review 31(4), 149–160 (2001)CrossRefGoogle Scholar
  10. 10.
    Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications 22, 41–53 (2004)CrossRefGoogle Scholar
  11. 11.
    Crosby, S.A., Wallach, D.S.: An analysis of BitTorrent’s two Kademlia-based dhts. Rice University, Houston, TX, USA (2007)Google Scholar
  12. 12.
    Steiner, M., En-Najjary, T., Biersack, E.W.: A global view of Kad. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, IMC 2007, pp. 117–122. ACM, New York (2007)Google Scholar
  13. 13.
    Falkner, J., Piatek, M., John, J.P., Krishnamurthy, A., Anderson, T.: Profiling a million user dht. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, IMC 2007, pp. 129–134. ACM, New York (2007)Google Scholar
  14. 14.
    Steiner, M., En-Najjary, T., Biersack, E.W.: Exploiting Kad: possible uses and misuses. SIGCOMM Computer Communication Review 37(5), 65–70 (2007)CrossRefGoogle Scholar
  15. 15.
    Fredkin, E.: Trie memory. Communications of the ACM 3(9), 490–499 (1960)CrossRefGoogle Scholar
  16. 16.
    Szpankowski, W.: Average Case Analysis of Algorithms on Sequences. Wiley, Chichester (2011)Google Scholar
  17. 17.
    Cai, X.S.: A probabilistic analysis of kademlia networks. Master’s thesis, McGill University (August 2012)Google Scholar
  18. 18.
    David, H., Nagaraja, H.: Order Statistics. Wiley, Hoboken (2003)CrossRefMATHGoogle Scholar
  19. 19.
    Johnson, N., Kotz, S., Balakrishnan, N.: Continuous Univariate Distributions, vol. 2. Wiley, Hoboken (1995)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Xing Shi Cai
    • 1
  • Luc Devroye
    • 1
  1. 1.School of Computer ScienceMcGill University of MontrealCanada

Personalised recommendations