Skip to main content
SpringerLink
Log in

Degree-Optimal Routing for P2P Systems

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We define a family of Distributed Hash Table systems whose aim is to combine the routing efficiency of randomized networks—e.g. optimal average path length O(log 2 n/δlog δ) with δ degree—with the programmability and startup efficiency of a uniform overlay—that is, a deterministic system in which the overlay network is transitive and greedy routing is optimal. It is known that Ω(log n) is a lower bound on the average path length for uniform overlays with O(log n) degree (Xu et al., IEEE J. Sel. Areas Commun. 22(1), 151–163, 2004).

Our work is inspired by neighbor-of-neighbor (NoN) routing, a recently introduced variation of greedy routing that allows us to achieve optimal average path length in randomized networks. The advantage of our proposal is that of allowing the NoN technique to be implemented without adding any overhead to the corresponding deterministic network.

We propose a family of networks parameterized with a positive integer c which measures the amount of randomness that is used. By varying the value c, the system goes from the deterministic case (c=1) to an “almost uniform” system. Increasing c to relatively low values allows for routing with asymptotically optimal average path length while retaining most of the advantages of a uniform system, such as easy programmability and quick bootstrap of the nodes entering the system.

We also provide a matching lower bound for the average path length of the routing schemes for any c.

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

Similar content being viewed by others

References

  1. Aspnes, J., Shah, G.: Skip graphs. In: Proc. of 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’03), pp. 384–393 (Jan. 2003)

  2. Chiola, G., Cordasco, G., Gargano, L., Negro, A., Scarano, V.: Overlay networks with class. In: Proc. of 8th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN’05), Las Vegas, Nevada, USA, pp. 241–247. IEEE Computer Society (Dec. 2005)

  3. Cordasco, G., Gargano, L., Hammar, M., Scarano, V.: Brief announcement: degree-optimal deterministic routing for P2P systems. In: Proc. of 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC’04) (Brief Announcement), St. John’s, Newfoundland, Canada, p. 395. ACM Press, New York (Jul. 2004)

    Google Scholar 

  4. Cordasco, G., Gargano, L., Hammar, M., Scarano, V.: Degree-optimal deterministic routing for P2P systems. In: Proc. of 10th IEEE Symposium on Computers and Communications (ISCC ’05), La Manga del Mar Menor, Cartagena, Spain, pp. 158–163. IEEE Computer Society (Jun. 2005)

  5. Druschel, P., Rowstron, A.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware’01), Heidelberg, Germany, pp. 329–350. Springer, New York (Nov. 2001)

    Google Scholar 

  6. Fraigniaud, P., Gauron, P.: D2B: a de Bruijn based content-addressable network. Int. J. Theor. Comput. Sci. 355(1), 65–79 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ganesan, P., Manku, G.S.: Optimal routing in chord. In: Proc. of 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’04), New Orleans, LA, USA, pp. 176–185. Springer, New York (Jan. 2004)

    Google Scholar 

  8. Kaashoek, M.F., Karger, D.R.: Koorde: a simple degree-optimal distributed hash table. In: Proceedings of 2nd International Workshop on Peer-to-Peer Systems (IPTPS ’03), Berkeley, CA, USA. Lecture Notes in Computer Science, pp. 98–107 (Feb. 2003)

  9. Karger, D.R., Lehman, E., Leighton, F.T., Panigrahy, R., Levine, M.S., Lewin, D.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web. In: Proc. of the 29th Annual ACM Symposium on Theory of Computing (STOC’97), El Paso, TX, USA, pp. 654–663. ACM Press, New York (May 1997)

    Google Scholar 

  10. Kumar, A., Merugu, S., Xu, J.(J.), Yu, X.: Ulysses: a robust, low-diameter, low-latency peer-to-peer network. In: Proc. of 11th IEEE International Conference on Network Protocols (ICNP ’03), pp. 258–267. IEEE, New York (Nov. 2003)

    Chapter  Google Scholar 

  11. Manku, G.S.: The power of lookahead in small-world routing networks. Technical Report, Computer Science Department, Stanford University, CA, USA (Nov. 2003)

  12. Manku, G.S., Bawa, M., Raghavan, P.: Symphony: distributed hashing in a small world. In: Proc. of 4th USENIX Symposium on Internet Technologies and Systems (USITS’03) (Mar. 2003)

  13. Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor’s neighbor: the power of lookahead in randomized P2P networks. In: Proc. of 36th Annual ACM Symposium on Theory of Computing (STOC ’04), Chicago, IL, USA, pp. 54–63 (Jun. 2004)

  14. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  15. Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approach. In: Proc. of 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA ’03), San Diego, CA, USA, pp. 50–59 (Jun. 2003)

  16. National Institute of Standards and Technology, Secure Hash Standard (NIST). http://www.itl.nist.gov/fipspubs/fip180-1.htm

  17. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. of ACM Special Interest Group on Data Communication (ACM SIGCOMM’01), San Diego, CA, USA, pp. 161–172 (Aug. 2001)

  18. Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for DHTs: some open questions. In: Proc. of 1st International Workshop on Peer-to-Peer Systems (IPTPS’02), Cambridge, CA, USA, pp. 45–52 (Mar. 2002)

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

    Article  Google Scholar 

  20. 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 (Jan. 2004) (A preliminary version appeared in the Proc. of IEEE INFOCOM’03)

    Article  MATH  Google Scholar 

  21. Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: an infrastructure for fault-tolerant wide-area location and routing. Tech. Report No. UCB/CSD-01-1141, Computer Science Division (EECS), University of California at Berkeley, CA, USA (Apr. 2001)

Download references

Author information

Authors and Affiliations

  1. DISI, Università di Genova, via Dodecaneso 35, 16146, Genova, Italy

    Giovanni Chiola

  2. DIA, Università di Salerno, via Ponte don Melillo, 84084, Fisciano (SA), Italy

    Gennaro Cordasco, Luisa Gargano, Alberto Negro & Vittorio Scarano

  3. Research & Development, Apptus Technologies AB, IDEON, 223 70, Lund, Sweden

    Mikael Hammar

Authors
  1. Giovanni Chiola
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gennaro Cordasco
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luisa Gargano
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mikael Hammar
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Alberto Negro
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Vittorio Scarano
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gennaro Cordasco.

Additional information

This work was partially supported by the Italian FIRB project “WEB-MINDS” (Wide-scalE, Broadband MIddleware for Network Distributed Services), http://web-minds.consorzio-cini.it/.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chiola, G., Cordasco, G., Gargano, L. et al. Degree-Optimal Routing for P2P Systems. Theory Comput Syst 45, 43–63 (2009). https://doi.org/10.1007/s00224-007-9074-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-007-9074-x

Keywords

Search

Navigation