Skip to main content
SpringerLink
Log in

Flat DHT Routing Topologies

  • Chapter
  • First Online:
Book cover Structured Peer-to-Peer Systems

Abstract

In this chapter, we survey existing classical DHTs grouped according to their topologies. We describe basic architectures for efficient overlay routing and corresponding classes of graphs. We start with introducing Content Addressable Network (CAN) as an example of Torus topology. It is followed by Chord, Kademlia and Accordion as DHTs using the Ring topology. Pastry, Tapestry and Bamboo DHTs are grouped under the PRR tree topology. Trie and balanced trees are represented by P-Grid, skip graphs. Finally, we present several DHTs that are using De Bruijn and Kautz graphs, Butterfly and O(1)-hop topologies. These topologies differ in how they collect local information in a DHT node about the global network. The next chapter will show how these architectures can be generalized using hierarchical approach.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aberer, K., Cudré-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., Punceva, M., Schmidt, R.: P-Grid: a self-organizing structured P2P system. SIGMOD Rec. 32(3), 29–33 (2003). doi: http://doi.acm.org/10.1145/945721.945729

  2. Abraham, I., Malkhi, D., Manku, G.S.: Papillon: Greedy routing in rings. In: DISC ’05: Proceedings of 19th International Conference on Distributed Computing. Lecture Notes in Computer Science, vol. 3724, pp. 514–515. Springer, Berlin (2005)

    Google Scholar 

  3. Aspnes, J., Shah, G.: Skip graphs. In: SODA ’03: Proceedings of 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 384–393. Society for Industrial and Applied Mathematics (2003)

    Google Scholar 

  4. Aspnes, J., Wieder, U.: The expansion and mixing time of skip graphs with applications. In: SPAA ’05: Proceedings of 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 126–134. ACM, New York (2005).doi: http://doi.acm.org/10.1145/1073970.1073989

  5. Datta, A., Girdzijauskas, S., Aberer, K.: On de bruijn routing in distributed hash tables: There and back again. In: IEEE P2P ’04: Proceedings of 4th International Conference on Peer-to-Peer Computing, pp. 159–166. IEEE Computer Society (2004).doi: http://dx.doi.org/10.1109/P2P.2004.29

  6. Fiat, A., Saia, J.: Censorship resistant peer-to-peer content addressable networks. In: SODA ’02: Proceedings of 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 94–103. Society for Industrial and Applied Mathematics (2002)

    Google Scholar 

  7. Fonseca, P., Rodrigues, R., Gupta, A., Liskov, B.: Full-information lookups for peer-to-peer overlays. IEEE Trans. Parallel Distrib. Syst. 20(9), 1339–1351 (2009)

    Article  Google Scholar 

  8. Fraigniaud, P., Gauron, P.: D2B: a de Bruijn based content-addressable network. Theor. Comput. Sci. 355(1), 65–79 (2006). doi: http://dx.doi.org/10.1016/j.tcs.2005.12.006

  9. Freedman, M.J., Vingralek, R.: Efficient peer-to-peer lookup based on a distributed trie. In: Revised Papers from 1st International Workshop on Peer-to-Peer Systems (IPTPS ’01), pp. 66–75. Springer, Berlin (2002)

    Google Scholar 

  10. Gai, A.T., Viennot, L.: Broose: A practical distributed hashtable based on the De-Bruijn topology. In: Proceedings of IEEE 4th International Conference on Peer-to-Peer Computing (P2P ’04), pp. 167–164. IEEE Computer Society (2004). doi: http://dx.doi.org/10.1109/P2P.2004.10

  11. Guo, D., Wu, J., Chen, H., Luo, X.: Moore: An extendable peer-to-peer network based on incomplete Kautz digraph with constant degree. In: Proceedings of IEEE INFOCOM’07, pp. 821–829. IEEE (2007)

    Google Scholar 

  12. Guo, D., Liu, Y., Li, X.Y.: BAKE: A balanced Kautz tree structure for peer-to-peer networks. In: Proceedings of IEEEINFOCOM’08, pp. 2450–2457. IEEE (2008)

    Google Scholar 

  13. Harvey, N.J.A., Munro, J.I.: Deterministic SkipNet. Inf. Process. Lett. 90(4), 205–208 (2004). doi: http://dx.doi.org/10.1016/j.ipl.2004.01.019

  14. Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: a scalable overlay network with practical locality properties. In: USITS’03: Proceedings of 4th USENIX Symposium on Internet Technologies and Systems. USENIX Association (2003)

    Google Scholar 

  15. Kaashoek, M.F., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: IPTPS ’03: Proceedings of 2nd International Workshop on Peer-to-Peer Systems. Lecture Notes in Computer Science, vol. 2735, pp. 98–107. Springer, Berlin (2003)

    Google Scholar 

  16. Li, D., Lu, X., Wu, J.: FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs. In: Proceedings of IEEE INFOCOM’05, pp. 1677–1688. IEEE (2005)

    Google Scholar 

  17. Li, J., Stribling, J., Morris, R., Kaashoek, M.F.: Bandwidth-efficient management of DHT routing tables. In: Proceedings of the 2nd Symposium on Networked Systems Design and Implementation (NSDI ’05), pp. 99–114 (2005)

    Google Scholar 

  18. Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience. IEEE/ACM Trans. Netw. 13(5), 1107–1120 (2005)

    Article  Google Scholar 

  19. Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic emulation of the butterfly. In: PODC ’02: Proceedings of 21st Annual Symposium on Principles of Distributed Computing, pp. 183–192. ACM, New York (2002). doi: http://doi.acm.org/10.1145/571825.571857

  20. Manku, G.S.: Routing networks for distributed hash tables. In: PODC ’03: Proceedings of 22nd Annual Symposium on Principles of Distributed Computing, pp. 133–142. ACM (2003). doi: http://doi.acm.org/10.1145/872035.872054

  21. Maymounkov, P., Mazières, D.: Kademlia: A peer-to-peer information system based on the XOR metric. In: IPTPS ’02: Proceedings of 1st International Workshop on Peer-to-Peer Systems. Lecture Notes in Computer Science, vol. 2429, pp. 53–65. Springer, New York (2002)

    Google Scholar 

  22. Monnerat, L.R., Amorim, C.L.: D1HT: a distributed one hop hash table. In: Proceedings of 20th IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2006). IEEE Computer Society (2006). doi: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2006.1639278

  23. Monnerat, L.R., Amorim, C.L.: Peer-to-peer single hop distributed hash tables. In: Proceedings of IEEE Globecom’09, pp. 4250–4257, IEEE (2009)

    Google Scholar 

  24. Naor, M., Wieder, U.: A simple fault tolerant distributed hash table. In: IPTPS ’03: Proceedings of 2nd International Workshop on Peer-to-Peer Systems. Lecture Notes in Computer Science, vol. 2735, pp. 88–97. Springer, New York (2003)

    Google Scholar 

  25. Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approach. ACM Trans. Algorithms 3(3), 37 (2007). doi: http://doi.acm.org/10.1145/1273340.1273350

    Google Scholar 

  26. Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: Proceedings of 9th Annual Symposium on Parallel Algorithms and Architectures (SPAA ’97), pp. 311–320 (1997)

    Google Scholar 

  27. Ratnasamy, S., Handley, P.F.M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of ACM SIGCOMM’01, pp. 161–172. ACM, New York (2001)

    Google Scholar 

  28. Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a DHT. In: Proceedings of the USENIX Annual Technical Conference (2004)

    Google Scholar 

  29. Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Middleware’01: Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms. Lecture Notes in Computer Science, vol. 2218, pp. 329–350. Springer, Berlin (2001)

    Google Scholar 

  30. Saia, J., Fiat, A., Gribble, S.D., Karlin, A.R., Saroiu, S.: Dynamically fault-tolerant content addressable networks. In: IPTPS ’01: Revised Papers from 1st International Workshop on Peer-to-Peer Systems, pp. 270–279. Springer, New York (2002)

    Google Scholar 

  31. Shen, H., Xu, C.Z., Chen, G.: Cycloid: a constant-degree and lookup-efficient p2p overlay network. Perform. Eval. 63(3), 195–216 (2006). doi: http://dx.doi.org/10.1016/j.peva.2005.01.004

  32. Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for Internet applications. IEEE/ACM Trans. Netw. 11(1), 17–32 (2003)

    Article  Google Scholar 

  33. Tang, C., Buco, M.J., Chang, R.N., Dwarkadas, S., Luan, L.Z., So, E., Ward, C.: Low traffic overlay networks with large routing tables. SIGMETRICS Perform. Eval. Rev. 33(1), 14–25 (2005). doi: http://doi.acm.org/10.1145/1071690.1064216

  34. Xu, J., Kumar, A., Yu, X.: On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE J. Sel. Areas Commun. 22(1), 151–163 (2004)

    Article  MATH  Google Scholar 

  35. Zhang, Y., Lu, X., Li, D.: SKY: efficient peer-to-peer networks based on distributed Kautz graphs. Sci. China Ser. F Inf. Sci. 52(4), 588–601 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  36. 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 J. Sel. Areas Commun. 22(1), 41–53 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Helsinki Institute for Information Technology, Aalto University, Aalto, Finland

    Dmitry Korzun

  2. Department of Computer Science, Petrozavodsk State University, Petrozavodsk, Russia

    Dmitry Korzun

  3. Centre for Wireless Communications, University of Oulu, Oulu, Finland

    Andrei Gurtov

Authors
  1. Dmitry Korzun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrei Gurtov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Korzun, D., Gurtov, A. (2013). Flat DHT Routing Topologies. In: Structured Peer-to-Peer Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-5483-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-5483-0_2

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-5482-3

  • Online ISBN: 978-1-4614-5483-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation