Skip to main content
SpringerLink
Log in
Book cover

Structured Peer-to-Peer Systems pp 5–23Cite as

Terminology, Problems, and Design Issues

  • Chapter
  • First Online:

  • 1502 Accesses

Abstract

The aim of this chapter is to introduce first the basic concepts, terminology, and notation we use throughout this book. Although the term “structure” is central in our discussion on structured P2P networks, its definition is quite fuzzy in recent P2P literature. Secondly, the chapter aims at common understanding about intuition and reasons behind this term. The description is assisted with introduction to a set of challenging problems that the P2P networking faces today.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Notes

  1. 1.

    We do not specify such details like “in the worst case”, “with high probability”, or “expected” since they are minor in this high-level discussion.

  2. 2.

    http://en.wikipedia.org/wiki/Hierarchy.

  3. 3.

    http://www.gnutella2.com.

  4. 4.

    http://www.kazaa.com.

  5. 5.

    http://www.emule-project.net/.

  6. 6.

    http://www.bittorrent.com/, http://www.bittorrent.org/.

References

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

  2. Aperjis, C., Freedman, M.J., Johari, R.: Bilateral and multilateral exchanges for peer-assisted content distribution. IEEE/ACM Trans. Netw. (2011). doi: http://dx.doi.org/10.1109/TNET.2011.2114898 19(5):1290–1303

  3. 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, USA (2005). doi: http://dx.doi.org/10.1109/P2P.2005.5

  4. 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, USA (2003)

    Google Scholar 

  5. Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking up data in P2P systems. Commun. ACM, USA 46(2), 43–48 (2003). doi: http://doi.acm.org/10.1145/606272.606299

    Google Scholar 

  6. Bharambe, A.R., Herley, C., Padmanabhan, V.N.: Analyzing and improving a BitTorrent network’s performance mechanisms. In: Proceedings of IEEE INFOCOM’06, pp. 2884–2895. IEEE (2006)

    Google Scholar 

  7. Bickson, D., Malkhi, D.: A unifying framework of rating users and data items in peer-to-peer and social networks. Peer-to-Peer Netw. Appl. 1, 93–103 (2008)

    Article  Google Scholar 

  8. Birman, K.P.: Reliable Distributed Systems: Technologies, Web Services, and Applications. Springer New York Inc., Secaucus (2005)

    MATH  Google Scholar 

  9. Buford, J.F., Yu, H., Lua, E.K.: P2P Networking and Applications. Elsevier, Amsterdam (2009)

    Google Scholar 

  10. Castro, M., Drushel, P., Ganesh, A., Rowstron, A., Wallach, D.S.: Secure routing for structured peer-to-peer overlay networks. In: Proceedings of 5th USENIX Symposium on Operating System Design and Implementation (OSDI 2002), pp. 299–314. ACM, Boston (2002)

    Google Scholar 

  11. Cohen, B.: Incentives build robustness in BitTorrent. In: Proceedings of 1st Workshop on Economics of Peer-to-Peer Systems (2003)

    Google Scholar 

  12. Feldman, M., Chuang, J.: Overcoming free-riding behavior in peer-to-peer systems. ACM SIGecom Exch. 5(4), 41–50 (2005). doi: http://doi.acm.org/10.1145/1120717.1120723

    Google Scholar 

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

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

  15. 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, USA (2004). doi: http://dx.doi.org/10.1109/P2P.2004.10

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

    Google Scholar 

  17. 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 on Parallel and Distributed Computing, ACM/IFIP pp. 643–657 (2003)

    Google Scholar 

  18. 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 on 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 

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

  20. 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 of ACM SIGCOMM’03, pp. 381–394. ACM, New York (2003). doi: http://doi.acm.org/10.1145/863955.863998

  21. 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) (2004). URL: citeseer.ist.psu.edu/gupta04efficient.html

  22. 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, New York (2003)

    Google Scholar 

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

  24. Hildrum, K., Kubiatowicz, J.: Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In: Proceedings of 17th International Symposium on Distributed Computing (DISC ’03), Springer Berlin, Heidelberg, pp. 321–336 (2003)

    Google Scholar 

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

    MATH  Google Scholar 

  26. Jun, S., Ahamad, M.: Incentives in BitTorrent induce free riding. In: Proceedings of 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems, P2PECON ’05, pp. 116–121. ACM, New York (2005). doi: http://doi.acm.org/10.1145/1080192.1080199

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

  28. Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., Lewin, D.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web. In: STOC ’97: Proceedings of 29th Annual ACM Symposium on Theory of computing, pp. 654–663. ACM, New York (1997). doi: http://doi.acm.org/10.1145/258533.258660

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

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

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

    Google Scholar 

  32. Korzun, D., Nechaev, B., Gurtov, A.: Cyclic routing: Generalizing lookahead in peer-to-peer networks. In: AICCSA2009: Proceedings of 7th IEEE/ACS International Conference on Computer Systems and Applications, pp. 697–704. IEEE Computer Society (2009). doi: http://doi.ieeecomputersociety.org/10.1109/AICCSA.2009.5069403

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

  34. 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, IEEE, pp. 270–276 (2004)

    Google Scholar 

  35. Levin, D., LaCurts, K., Spring, N., Bhattacharjee, B.: BitTorrent is an auction: analyzing and improving BitTorrent’s incentives. SIGCOMM Comput. Commun. Rev. 38, 243–254 (2008). doi: http://doi.acm.org/10.1145/1402946.1402987

    Google Scholar 

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

  37. Liao, W.C., Papadopoulos, F., Psounis, K.: Performance analysis of BitTorrent-like systems with heterogeneous users. Perform. Eval. 64, 876–891 (2007). doi:10.1016/j.peva.2007.06.008

    Article  Google Scholar 

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

  39. Ma, R.T.B., Lee, S.C.M., Lui, J.C.S., Yau, D.K.Y.: Incentive and service differentiation in P2P networks: a game theoretic approach. IEEE/ACM Trans. Netw. 14(5), 978–991 (2006). doi: http://dx.doi.org/10.1109/TNET.2006.882904

    Google Scholar 

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

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

  42. Marti, S., Garcia-Molina, H.: Taxonomy of trust: categorizing P2P reputation systems. Comput. Netw. 50(4), 472–484 (2006). doi: http://dx.doi.org/10.1016/j.comnet.2005.07.011

    Google Scholar 

  43. 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. Technol. (IJIPT) 3(4), 234–244 (2008). doi: http://dx.doi.org/10.1504/IJIPT.2008.023772

    Google Scholar 

  44. 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 on Parallel, Distributed and Network-Based Processing, pp. 508–515. IEEE Computer Society (2008). doi: http://dx.doi.org/10.1109/PDP.2008.79

  45. 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 on Parallel, Distributed and Network-Based Processing, pp. 316–322. IEEE Computer Society (2009). doi: http://doi.ieeecomputersociety.org/10.1109/PDP.2009.27

  46. 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, Berlin (2002)

    Google Scholar 

  47. Mekouar, L., Iraqi, Y., Boutaba, R.: A contribution-based service differentiation scheme for peer-to-peer systems. Peer-to-Peer Netw. Appl. 2, 146–163 (2009). doi: http://dx.doi.org/10.1007/s12083-008-0026-2

    Google Scholar 

  48. 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, New York (2004)

    Google Scholar 

  49. 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, IEEE, pp. 104–111 (2003)

    Google Scholar 

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

    Article  Google Scholar 

  51. Park, K., Pack, S., Kwon, T.: Proximity based peer-to-peer overlay networks (P3ON) with load distribution. In: Proceedings of International Conference on 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

  52. 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, ACM (1997)

    Google Scholar 

  53. Ramachandran, K.K., Sikdar, B.: A queuing model for evaluating the transfer latency of peer-to-peer systems. IEEE Trans. Parallel Distrib. Syst. 21, 367–378 (2010). doi: http://dx.doi.org/10.1109/TPDS.2009.69

    Google Scholar 

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

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

    Google Scholar 

  56. 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, New York (2001)

    Google Scholar 

  57. Seedorf, J., Muus, C.: Availability for structured overlay networks: considerations for simulation and a new bound on lookup success. In: Proceedings of 12th Nordic Workshop on Secure IT Systems, pp. 23–34 (2007)

    Google Scholar 

  58. Serbu, S., Bianchi, S., Kropf, P., Felber, P.: Dynamic load sharing in peer-to-peer systems: when some peers are more equal than others. IEEE Internet Comput. 11(4), 53–61 (2007). doi: http://dx.doi.org/10.1109/MIC.2007.81

    Google Scholar 

  59. Sherman, A., Nieh, J., Stein, C.: FairTorrent: bringing fairness to peer-to-peer systems. In: CoNEXT ’09: Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies, pp. 133–144. ACM, New York (2009). doi: http://doi.acm.org/10.1145/1658939.1658955

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

    Google Scholar 

  61. Srivatsa, M., Liu, L.: Vulnerabilities and security threats in structured overlay networks: a quantitative analysis. In: ACSAC ’04: Proceedings of 20th Annual Computer Security Applications Conference, pp. 252–261. IEEE Computer Society (2004). doi: http://dx.doi.org/10.1109/CSAC.2004.50

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

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

    Google Scholar 

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

  65. Vu, Q.H., Lupu, M., Ooi, B.C.: Peer-to-Peer Computing: Principles and Applications. Springer, Berlin (2010). doi:10.1007/978-3-642-03514-2

    Google Scholar 

  66. Wang, W., Li, B.: To play or to control: a game-based control-theoretic approach to peer-to-peer incentive engineering. In: Proceedings of 11th International Conference on Quality of service (IWQoS’03), pp. 174–192. Springer, Berlin (2003)

    Google Scholar 

  67. Wu, F., Zhang, L.: Proportional response dynamics leads to market equilibrium. In: STOC ’07: Proceedings of 29th annual ACM Symposium on Theory of Computing, pp. 354–363. ACM, New York (2007). doi: http://doi.acm.org/10.1145/1250790.1250844

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

  69. Xu, Z., Min, R., Hu, Y.: HIERAS: A DHT based hierarchical P2P routing algorithm. In: ICPP 2003: Proceedings of 32nd International Conference on Parallel Processing, pp. 187–194. IEEE Computer Society (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. Yang, X., de Veciana, G.: Performance of peer-to-peer networks: service capacity and role of resource sharing policies. Perform. Eval. 63, 175–194 (2006). doi:10.1016/j.peva.2005.01.005

    Article  Google Scholar 

  72. 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, New York (2007)

    Google Scholar 

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

  74. Zhao, B.Q., Lui, J.C.S., Chiu, D.M.: Analysis of adaptive incentive protocols for P2P networks. In: Proceedings of IEEE INFOCOM’09, pp. 325–333. IEEE (2009)

    Google Scholar 

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

  76. Zhao, B.Y., Huang, L., Stribling, J., Joseph, A.D., Kubiatowicz, J.D.: Exploiting routing redundancy via structured peer-to-peer overlays. In: ICNP ’03: Proceedings of 11th IEEE International Conference on Network Protocols, IEEE, pp. 246–257 (2003)

    Google Scholar 

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

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

    Google Scholar 

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

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

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

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

    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). Terminology, Problems, and Design Issues. In: Structured Peer-to-Peer Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-5483-0_1

Download citation

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

  • 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