Skip to main content

P2P Overlay Networks of Constant Degree

  • Conference paper
Grid and Cooperative Computing (GCC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3032))

Included in the following conference series:

Abstract

This paper proposes an abstract and generic topological model that captures the essence of P2P architecture. Such model should in return facilitate the exploitation of the new design space for more novel P2P systems. The paper also proposes a variant of the cube-connected cycles as a P2P overlay network that achieves O(log N) path length with O(1) neighbors. The simulation result has shown that our system is no worse than other systems of the same complexity such as Viceroy and Koorde.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Chen, G., Xu, C.Z.: Topological Analysis of P2P Systems. In: Proc. of 1st Int. Workshop on Grid and Cooperative Computing, Hainan, China (December 2002)

    Google Scholar 

  2. Kaashoek, M.F., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: Proc. of 2nd Int. Workshop on Peer-to-Peer Systems (March 2003)

    Google Scholar 

  3. Karger, D., et al.: Consistent hashing and random trees: distributed cashing protocols for relieving hot spots on the World Wide. In: Proc. ACM STOC 1997, El Paso, TX (May 1997)

    Google Scholar 

  4. Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: PODC 2002 (2002)

    Google Scholar 

  5. Preparata, F.P., Vuillemin, J.: The cube-connected cycles: A versatile network for parallel computation. CACM 24(5), 300–309 (1981)

    MathSciNet  Google Scholar 

  6. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: Proc. ACM SIGCOMM 2001, San Diego, CA (August 2001)

    Google Scholar 

  7. Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for DHTs: Some open questions. In: Proc. of 1st Int. Workshop on Peer-to-Peer Systems (March 2002)

    Google Scholar 

  8. Rowstron, Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proc. of 18th IFIP/ACM CDSP (November 2001)

    Google Scholar 

  9. Shen, H.Y., Xu, C.Z., Chen, G.: Cycloid: A consistent-degree and Location efficient P2P overlay network, technical report ECE-03-08, Wayne State University (2003)

    Google Scholar 

  10. Stoica, I., et al.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proc. ACM SIGCOMM 2001, San Diego, CA (August 2001)

    Google Scholar 

  11. Z. Xu, Chunqiang Tang and Zheng Zhang, Building Topology-Aware Overlays Using Global Soft-State. In: ICDCS 2003 (2003)

    Google Scholar 

  12. Zhao, B.Y., et al.: Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical Report UCB//CSD-01-1141, U. C. Berkeley (April 2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, G., Xu, C., Shen, H., Chen, D. (2004). P2P Overlay Networks of Constant Degree. In: Li, M., Sun, XH., Deng, Qn., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24679-4_77

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24679-4_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21988-0

  • Online ISBN: 978-3-540-24679-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics