Skip to main content
SpringerLink
Log in

Hierarchical DHT Architectures

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

  • 1471 Accesses

Abstract

Distributed Hash Tables (DHT) are presently used in several large-scale distributed systems in the Internet and envisaged as a key mechanism to provide identifier-locator separation for mobile hosts in Future Internet. Such decentralized structured data storage systems become increasingly complex serving popular social networking, P2P applications, and Internet-scale infrastructures. Hierarchy is a standard mechanism for coping with complexity, scalability, and heterogeneity in distributed systems. To address the shortcomings of flat DHT designs, many hierarchical P2P designs have been proposed over recent years. The last generation is hierarchical DHTs (HDHTs) where nodes are organized onto layers and groups. This chapter discusses concepts of hierarchical architectures in structured P2P overlay networks, focusing on HDHT designs. We introduce a framework consisting of conceptual models of network hierarchy, multi-layer hierarchical P2P architectures, and principles affecting the design choices. Based on the framework we provide taxonomy of existing P2P systems and thoroughly go over proposed hierarchical P2P alternatives.

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

Notes

  1. 1.

    It is in contrast to Chord with its proactive routing table maintenance when every node periodically calls the stabilization and fixfingers procedures.

  2. 2.

    For the reference case, GTPP utilizes Chord for all overlays.

References

  1. Artigas, M.S., Lopez, P.G., Skarmeta, A.F.G.: A novel methodology for constructing secure multipath overlays. IEEE Internet Comput. 9(6), 50–57 (2005). doi: http://dx.doi.org/10.1109/MIC.2005.117

  2. Artigas, M.S., Lopez, P.G., Ahullo, J.P., Skarmeta, A.F.G.: Cyclone: a novel design schema for hierarchical DHTs. In: IEEE P2P ’05: Proceedings of 5th International Conference on Peer-to-Peer Computing, pp. 49–56. IEEE Computer Society (2005). doi: http://dx.doi.org/10.1109/P2P.2005.5

  3. Chiang, M., Low, S.H., Calderbank, A.R., Doyle, J.C.: Layering as optimization decomposition: a mathematical theory of network architectures. Proc. IEEE 95, 255–312 (2007). doi: http://dx.doi.org/10.1109/JPROC.2006.887322

    Google Scholar 

  4. Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: Proceedings of 18th ACM Symposium Operating Systems Principles (SOSP ’01), pp. 202–215. ACM, New York (2001). doi: http://doi.acm.org/10.1145/502034.502054

  5. Duchon, P., Hanusse, N., Lebhar, E., Schabanel, N.: Towards small world emergence. In: Proceedings of 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA ’06), pp. 225–232. ACM, New York (2006). doi: http://doi.acm.org/10.1145/1148109.1148145

  6. 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)

    Google Scholar 

  7. Freedman, M.J., Mazières, D.: Sloppy hashing and self-organizing clusters. In: IPTPS ’03: Proceedings of 2nd International Workshop on Peer-to-Peer Systems. Lecture Notes in Computer Science, vol. 2735, pp. 45–55. Springer, Berlin (2003)

    Google Scholar 

  8. Ganesan, P., Manku, G.S.: Optimal routing in Chord. In: SODA ’04: Proceedings of 15th Annual ACM-SIAM Symposium Discrete Algorithms, pp. 176–185. Society for Industrial and Applied Mathematics (2004)

    Google Scholar 

  9. Ganesan, P., Gummadi, K., Garcia-Molina, H.: Canon in G major: designing DHTs with hierarchical structure. In: ICDCS ’04: Proceedings of 24th International Conference Distributed Computing Systems, pp. 263–272. IEEE Computer Society (2004)

    Google Scholar 

  10. Garcés-Erice, L., Biersack, E., Felber, P.A., Ross, K.W., Urvoy-Keller, G.: Hierarchical peer-to-peer systems. In: Euro-Par 2003: Proceedings of ACM/IFIP International Conference Parallel and Distributed Computing, pp. 643–657 (2003)

    Google Scholar 

  11. Garcés-Erice, L., Ross, K.W., Biersack, E.W., Felber, P., Urvoy-Keller, G.: Topology-centric look-up service. In: Proceedings of 5th International Conference Group Communications and Charges (NGC 2003), Workshop on Networked Group Communication. Lecture Notes in Computer Science, vol. 2816, pp. 58–69. Springer, Berlin (2003)

    Google Scholar 

  12. Godfrey, P.B., Stoica, I.: Heterogeneity and load balance in distributed hash tables. In: Proceedings of IEEE INFOCOM’05, pp. 596–606. IEEE (2005). doi:10.1109/INFCOM.2005.1497926

    Google Scholar 

  13. Guisheng, Y., Jie, S., Xianghui, W.: Hierarchical small-world P2P networks. In: ICICSE ’08: Proceedings of International Conference Internet Computing in Science and Engineering, pp. 452–458. IEEE Computer Society (2008). doi: http://dx.doi.org/10.1109/ICICSE.2008.94

  14. Gummadi, K., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., Stoica, I.: The impact of DHT routing geometry on resilience and proximity. In: Proceedings of ACM SIGCOMM’03, USENIX Association. Berkeley, CA, USA, pp. 381–394. ACM, New York (2003). doi: http://doi.acm.org/10.1145/863955.863998

  15. Gupta, A., Liskov, B., Rodrigues, R.: Efficient routing for peer-to-peer overlays. In: Proceedings of 1st Symposium on Networked Systems Design and Implementation (NSDI ’04), USENIX Association. Berkeley, CA, USA (2004). URL: citeseer.ist.psu.edu/gupta04efficient.html

  16. Gupta, I., Birman, K., Linga, P., Demers, A., van Renesse, R.: Kelips: building an efficient and stable P2P DHT through increased memory and background overhead. In: IPTPS ’03: Proceedings of 2nd International Workshop on Peer-to-Peer Systems. Lecture Notes in Computer Science, vol. 2735, pp. 160–169. Springer, Berlin (2003)

    Google Scholar 

  17. Heristyo, A., Masuyama, H., Kasahara, S., Takahashi, Y.: User-search time analysis for hierarchical peer-to-peer overlay networks with time-dependent user-population process. In: Proceedings of 4th International Conference Queueing Theory and Network Applications (QTNA’09), pp. 5:1–5:4. ACM, New York (2009). doi: http://doi.acm.org/10.1145/1626553.1626558

  18. Hu, J., Li, M., Zheng, W., Wang, D., Ning, N., Dong, H.: Smartboa: constructing P2P overlay network in the heterogeneous internet using irregular routing tables. In: IPTPS ’04: Proceedings of 3rd International Workshop on Peer-to-Peer Systems. Lecture Notes in Computer Science, vol. 3279, pp. 278–287. Springer, Berlin (2004)

    Google Scholar 

  19. Joung, Y.J., Wang, J.C.: Chord2: a two-layer chord for reducing maintenance overhead via heterogeneity. Comput. Commun. 51(3), 712–731 (2007)

    Google Scholar 

  20. Karger, D.R., Ruhl, M.: Diminished Chord: a protocol for heterogeneous subgroup formation in peer-to-peer networks. In: IPTPS ’04: Proceedings of 3rd International Workshop on Peer-to-Peer Systems. Lecture Notes in Computer Science, vol. 3279, pp. 288–297. Springer, Berlin (2004)

    Google Scholar 

  21. Karrels, D.R., Peterson, G.L., Mullins, B.E.: Structured P2P technologies for distributed command and control. Peer-to-Peer Netw. Appl. 2(4), pp. 311–333, Springer US (2009). doi:10.1007/s12083-009-0033-y

    Google Scholar 

  22. Kempe, D., Kleinberg, J., Demers, A.: Spatial gossip and resource location protocols. J. ACM 51, 943–967 (2004). doi: http://doi.acm.org/10.1145/1039488.1039491

    Google Scholar 

  23. Kleinberg, J.M.: The small-world phenomenon: an algorithm perspective. In: Proceedings of 32nd Annual ACM Symposium Theory of Computing (STOC ’00), pp. 163–170. ACM, New York (2000). doi: http://doi.acm.org/10.1145/335305.335325

  24. Kleinberg, J.M.: Complex networks and decentralized search algorithms. In: Proceedings of International Congress of Mathematicians (ICM 2006). European Mathematical Society (2006)

    Google Scholar 

  25. Korzun, D., Gurtov, A.: On scalability properties of the Hi3 control plane. Comput. Commun. 29(17), 3591–3601 (2006)

    Google Scholar 

  26. Korzun, D., Gurtov, A.: Survey on hierarchical routing schemes in “flat” distributed hash tables. Peer-to-Peer Netw. Appl. 4, 346–375 (2011). doi: http://dx.doi.org/10.1007/s12083-010-0093-z

  27. Krishnamurthy, B., Wang, J., Xie, Y.: Early measurements of a cluster-based architecture for P2P systems. In: IMW ’01: Proceedings of 1st ACM SIGCOMM Workshop on Internet Measurement, pp. 105–109. ACM. New York (2001). doi: http://doi.acm.org/10.1145/505202.505216

  28. Le, L., Kuo, G.S.: Hierarchical and breathing peer-to-peer SIP system. In: ICC 2007: Proceedings of IEEE International Conference Communications, pp. 1887–1892. IEEE (2007)

    Google Scholar 

  29. Lee, J.W., Schulzrinne, H., Kellerer, W., Despotovic, Z.: mDHT: multicast-augmented DHT architecture for high availability and immunity to churn. In: CCNC’09: Proceedings of 6th IEEE Conference Consumer Communications and Networking Conference, pp. 760–764. IEEE (2009)

    Google Scholar 

  30. Leong, B., Liskov, B., Demaine, E.: Epichord: parallelizing the Chord lookup algorithm with reactive routing state management. In: ICON 2004: Proceedings of 12th International Conference on Networks, pp. 270–276 (2004)

    Google Scholar 

  31. 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 

  32. Li, J., Stribling, J., Morris, R., Kaashoek, M.F., Gil, T.M.: A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In: Proceedings of IEEE INFOCOM’05, vol. 1, pp. 225–236. IEEE (2005). doi:  10.1109/INFCOM.2005.1497894

    Google Scholar 

  33. Li, X., Wu, J.: Hierarchical P2P systems in a small world. In: LACCEI’2004: Proceedings of 2nd Latin American and Caribbean Conference for Engineering and Technology (2004). URL: http://www.laccei.org/proceedings2004/FinalPapers/IT_046.pdf

  34. Lian, J., Naik, K., Agnew, G.B.: A framework for evaluating the performance of cluster algorithms for hierarchical networks. IEEE/ACM Trans. Netw. 15, 1478–1489 (2007). doi: http://dx.doi.org/10.1109/TNET.2007.896499

  35. Lloret, J., Palau, C., Boronat, F., Tomas, J.: Improving networks using group-based topologies. Comput. Commun. 31, 3438–3450 (2008). doi:10.1016/j.comcom.2008.05.030

    Google Scholar 

  36. 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)

    Google Scholar 

  37. Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A survey and comparison of peer-to-peer overlay network schemes. IEEE Commun. Surv. Tutor. 7(2), 72–93 (2005)

    Google Scholar 

  38. Manku, G.S., Bawa, M., Raghavan, P.: Symphony: distributed hashing in a small world. In: USITS’03: Proceedings of 4th USENIX Symposium on Internet Technologies and Systems, pp. 127–140. USENIX Association (2003)

    Google Scholar 

  39. Martinez-Yelmo, I., Bikfalvi, A., Guerrero, C., Rumin, R.C., Mauthe, A.: Enabling global multimedia distributed services based on hierarchical DHT overlay networks. Int. J. Internet Protoc. Tech. (IJIPT) 3(4), 234–244 (2008). doi: http://dx.doi.org/10.1504/IJIPT.2008.023772

    Google Scholar 

  40. Martinez-Yelmo, I., Cuevas, R., Guerrero, C., Mauthe, A.: Routing performance in a hierarchical DHT-based overlay network. In: PDP 2008: Proceedings of 16th Euromicro Conference Parallel, Distributed and Network-Based Processing, pp. 508–515. IEEE Computer Society (2008). doi: http://dx.doi.org/10.1109/PDP.2008.79

  41. Martinez-Yelmo, I., Guerrero, C., Rumín, R.C., Mauthe, A.: A hierarchical P2PSIP architecture to support skype-like services. In: PDP 2009: Proceedings of 17th Euromicro International Conference Parallel, Distributed and Network-Based Processing, pp. 316–322. IEEE Computer Society (2009). doi: http://doi.ieeecomputersociety.org/10.1109/PDP.2009.27

  42. Mesaros, V.A., Carton, B., Roy, P.V.: S-Chord: Using symmetry to improve lookup efficiency in Chord. Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA ’03, Las Vegas, Nevada, USA, Vol. 4, CSREA Press, (2003)

    Google Scholar 

  43. Meshkova, E., Riihijärvi, J., Petrova, M., Mähönen, P.: A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks. Comput. Netw. 52(11), 2097–2128 (2008). doi: http://dx.doi.org/10.1016/j.comnet.2008.03.006

  44. Min, S.H., Holliday, J., Cho, D.S.: Optimal super-peer selection for large-scale P2P system. In: ICHIT ’06: Proceedings of 2006 International Conference Hybrid Information Technology, pp. 588–593. IEEE Computer Society (2006). doi: http://dx.doi.org/10.1109/ICHIT.2006.188

  45. Mislove, A., Druschel, P.: Providing administrative control and autonomy in structured peer-to-peer overlays. In: IPTPS ’04: Proceedings of 3rd International Workshop on Peer-to-Peer Systems. Lecture Notes in Computer Science, vol. 3279, pp. 162–172. Springer, Berlin (2004)

    Google Scholar 

  46. Mizrak, A.T., Cheng, Y., Kumar, V., Savage, S.: Structured superpeers: Leveraging heterogeneity to provide constant-time lookup. In: WIAPP 2003: Proceedings of 3rd IEEE Workshop on Internet Applications, pp. 104–111 (2003)

    Google Scholar 

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

    Google Scholar 

  48. Ou, Z., Harjula, E., Koskela, T., Ylianttila, M.: GTPP: General truncated pyramid peer-to-peer architecture over structured DHT networks. Mob. Netw. Appl. 15, 729–749 (2010). doi:10.1007/s11036-009-0193-2

    Google Scholar 

  49. Park, K., Pack, S., Kwon, T.: Proximity based peer-to-peer overlay networks (P3ON) with load distribution. In: Proceedings of International Conference Information Networking (ICOIN 2007). Towards Ubiquitous Networking and Services. Revised Selected Papers, pp. 234–243. Springer, Berlin (2008). doi:  http://dx.doi.org/10.1007/978-3-540-89524-4_24

  50. 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 

  51. Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-aware overlay construction and server selection. In: Proceedings of IEEE INFOCOM’02 (2002)

    Google Scholar 

  52. Ren, X.J., Gu, Z.M.: SA-Chord: A novel P2P system based on self-adaptive joining. In: Proceedings of 6th International Conference Grid and Cooperative Computing (GCC 2007), pp. 75–81. IEEE Computer Society (2007). doi: http://dx.doi.org/10.1109/GCC.2007.109

  53. Risson, J., Moors, T.: Survey of research towards robust peer-to-peer networks: search methods. Comput. Netw. 50(17), 3485–3521 (2006). doi: http://dx.doi.org/10.1016/j.comnet.2006.02.001

  54. Risson, J., Qazi, S., Moors, T., Harwood, A.: A dependable global location service using rendezvous on hierarchic distributed hash tables. In: ICN/ICONS/MCL ’06: Proceedings of International Conference Networking, International Conference Systems and International Conference Mobile Communications and Learning Technologies. IEEE Computer Society (2006). doi:10.1109/ICNICONSMCL.2006.11

    Google Scholar 

  55. Risson, J., Harwood, A., Moors, T.: Stable high-capacity one-hop distributed hash tables. In: ISCC ’06: Proceedings of 11th IEEE Symposium on Computers and Communications, pp. 687–694. IEEE Computer Society (2006). doi: http://dx.doi.org/10.1109/ISCC.2006.152

  56. Rufino, J., Alves, A., Exposto, J., Pina, A.: A cluster oriented model for dynamically balanced DHTs. In: IPDPS’04: Proceedings of 18th International Symposium on Parallel and Distributed Processing. IEEE Computer Society (2004)

    Google Scholar 

  57. Singh, A., Liu, L.: A hybrid topology architecture for P2P systems. In: ICCCN 2004: Proceedings of 13th International Conference on Computer Communications and Networks, pp. 475–480 (2004)

    Google Scholar 

  58. 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)

    Google Scholar 

  59. Surana, S., Godfrey, B., Lakshminarayanan, K., Karp, R., Stoica, I.: Load balancing in dynamic structured peer-to-peer systems. Perform. Eval. 63(3), 217–240 (2006). doi: http://dx.doi.org/10.1016/j.peva.2005.01.003

  60. Tang, C., Xu, Z., Dwarkadas, S.: Peer-to-peer information retrieval using self-organizing semantic overlay networks. In: Proceedings of ACM SIGCOMM’03, pp. 175–186. ACM, New York (2003). doi: http://doi.acm.org/10.1145/863955.863976

  61. Tanta-ngai, H., McAllister, M.: A peer-to-peer expressway over Chord. Math. Comput. Model. 44(7-8), 659–677 (2006). doi: http://dx.doi.org/10.1016/j.mcm.2006.02.003

  62. Tian, R., Xiong, Y., Zhang, Q., Li, B., Zhao, B.Y., Li, X.: Hybrid overlay structure based on random walks. In: IPTPS ’05: Proceedings of 4th International Workshop on Peer-to-Peer Systems. Lecture Notes in Computer Science, vol. 3640, pp. 152–162. Springer, Berlin (2005)

    Google Scholar 

  63. Viswanath, B., Post, A., Gummadi, K.P., Mislove, A.: An analysis of social network-based sybil defenses. In: Proceedings of ACM SIGCOMM 2010 Conference Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 363–374. ACM, New York (2010). doi: http://doi.acm.org/10.1145/1851182.1851226

  64. Wan, Y., Asaka, T., Takahashi, T.: A hybrid P2P overlay network for non-strictly hierarchically categorized contents. In: CCGRID ’08: Proceedings of 8th IEEE International Symposium on Cluster Computing and the Grid, pp. 41–48. IEEE Computer Society (2008). doi: http://dx.doi.org/10.1109/CCGRID.2008.10

  65. Xu, J., Jin, H.: A structured P2P network based on the small world phenomenon. J. Supercomput. 48, 264–285 (2009). doi:10.1007/s11227-008-0219-8

    Google Scholar 

  66. Xu, Z., Zhang, Z.: Building low-maintenance Expressways for P2P systems. Techical Report HPL-2002-41, HP Labs, Palo Alto (2002)

    Google Scholar 

  67. Xu, Z., Min, R., Hu, Y.: HIERAS: A DHT based hierarchical P2P routing algorithm. In: ICPP 2003: Proceedings of 32nd International Conference Parallel Processing, pp. 187–194. IEEE Computer Society (2003)

    Google Scholar 

  68. Xu, Z., Tang, C., Zhang, Z.: Building topology-aware overlays using global soft-state. In: Proceedings of 23rd International Conference Distributed Computing Systems (ICDCS’03), pp. 500–508. IEEE Computer Society (2003). doi: http://dx.doi.org/10.1109/ICDCS.2003.1203500

  69. Xu, Z., Mahalingam, M., Karlsson, M.: Turning heterogeneity into an advantage in overlay routing. In: Proceedings of IEEE INFOCOM’03, pp. 1499–1509 (2003)

    Google Scholar 

  70. Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: ICDE’03: Proceedings of 19th International Conference on Data Engineering, pp. 49–60 (2003). doi: http://doi.ieeecomputersociety.org/10.1109/ICDE.2003.1260781

  71. Zhang, X.M., Wang, Y.J., Li, Z.: Research of routing algorithm in hierarchy-adaptive P2P systems. In: ISPA 2007: Proceedings of 5th International Symposium Parallel and Distributed Processing and Applications. Lecture Notes in Computer Science, vol. 4742, pp. 728–739. Springer, Berlin (2007)

    Google Scholar 

  72. Zhang, Y., Li, D., Chen, L., Lu, X.: Flexible routing in grouped DHTs. In: IEEE P2P ’08: Proceedings of 8th International Conference Peer-to-Peer Computing, pp. 109–118. IEEE Computer Society (2008). doi: http://dx.doi.org/10.1109/P2P.2008.43

  73. Zhang, Z., Shi, S.M., Zhu, J.: Self-balanced P2P Expressway: When Marxism meets Confucian. Techical Report MSR-TR-2002-72, Microsoft Research Asia (2002)

    Google Scholar 

  74. Zhao, B.Y., Duan, Y., Huang, L., Joseph, A.D., Kubiatowicz, J.D.: Brocade: Landmark routing on overlay networks. In: IPTPS ’02: Proceedings of 1st International Workshop on Peer-to-Peer Systems. Lecture Notes in Computer Science, vol. 2429, pp. 34–44. Springer, Berlin (2002)

    Google Scholar 

  75. Zhu, Y., Wang, H., Hu, Y.: A super-peer based lookup in structured peer-to-peer systems. In: Proceedings of ISCA 16th International Conference Parallel and Distributed Computing Systems (PDCS 2003), pp. 465–470 (2003)

    Google Scholar 

  76. Zoels, S., Eichhorn, M., Tarlano, A., Kellerer, W.: Content-based hierarchies in DHT-based peer-to-peer systems. In: SAINT Workshops 2006: Proceedings of International Symposium Applications and the Internet Workshops, pp. 105–108. IEEE Computer Society (2006). doi: http://dx.doi.org/10.1109/SAINT-W.2006.12

  77. Zoels, S., Despotovic, Z., Kellerer, W.: Cost-based analysis of hierarchical DHT design. In: IEEE P2P ’06: Proceedings of 6th International Conference Peer-to-Peer Computing, pp. 233–239. IEEE Computer Society (2006). doi: http://dx.doi.org/10.1109/P2P.2006.13

  78. Zoels, S., Despotovic, Z., Kellerer, W.: Load balancing in a hierarchical DHT-based P2P system. In: COLCOM ’07: Proceedings of 2007 International Conference Collaborative Computing: Networking, Applications and Worksharing, pp. 353–361. IEEE Computer Society (2007). doi: http://dx.doi.org/10.1109/COLCOM.2007.4553855

  79. Zoels, S., Despotovic, Z., Kellerer, W.: On hierarchical DHT systems — an analytical approach for optimal designs. Comput. Commun. 31(3), 576–590 (2008). doi: http://dx.doi.org/10.1016/j.comcom.2007.08.033

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). Hierarchical DHT Architectures. In: Structured Peer-to-Peer Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-5483-0_7

Download citation

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

  • 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