Skip to main content

A Novel Approach for Constructing Small World in Structured P2P Systems

  • Conference paper
Grid and Cooperative Computing - GCC 2004 (GCC 2004)

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

Included in the following conference series:

  • 293 Accesses

Abstract

Many efforts have been made to model small world phenomenon. Kleinberg’s recent research models the construction of small world in a grid and shows the possibility to build an efficient search network with a distributed algorithm. However, it needs to use the global information to form the small world structure, which is unpractical for large-scale and dynamic topologies such as the peer-to-peer systems. In this paper, a novel approach is proposed to form the small world structure with only local information. This approach is proved both in theory and simulation. The experimental results show it is more nature and scalable, and can be applied to effectively improve the performance of a class of structured P2P systems.

This paper is supported by 973 project (No.2002CB312002) of China, and grand project of the Science and Technology Commission of Shanghai Municipality (No. 03dz15027 and No. 03dz15028).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. Cornell Computer Science Technical Report 99-1776 (2000)

    Google Scholar 

  2. Sylvia, R., Paul, F., Mark, H., Richard, K., Scott, S.: A scalable content-addressable network. In: Proc. ACM SIGCOMM, San Diego, CA, pp. 161–172 (2001)

    Google Scholar 

  3. Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proc 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 183–192 (2002)

    Google Scholar 

  4. Manku, G.S.: Routing Networks for Distributed Hash Tables. In: Proc. 22nd ACM Symposium on Principles of Distributed Computing, PODC 2003, June 2003, pp. 133–142 (2003)

    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

Zou, F., Li, Y., Zhang, L., Ma, F., Li, M. (2004). A Novel Approach for Constructing Small World in Structured P2P Systems. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004. GCC 2004. Lecture Notes in Computer Science, vol 3251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30208-7_110

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30208-7_110

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23564-4

  • Online ISBN: 978-3-540-30208-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics