Skip to main content
SpringerLink
Log in

A structured P2P network based on the small world phenomenon

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In this paper, we propose a new structured P2P overlay network, named SW-Uinta(small-world). In order to reduce the routing latency, we firstly construct the Uinta network in which both physical characteristics of network and data semantic are considered. Furthermore, based on Uinta, a nondeterministic caching strategy is employed to allow for poly-logarithmic search time while having only a constant cache size. Compared with the deterministic caching strategy proposed by previous P2P systems, the nondeterministic caching strategy can reduce communication overhead for maintaining the routing cache table. Cache entries in the cache table of peer nodes can be updated by subsequent queries rather than only by running stabilization periodically. In the following, a novel cache replacement scheme, named the SW cache replacement scheme, is used to improve lookup performance, which has proved to satisfy the small-world principle. So we call this network SW-Uinta(small-world). After that, according to the theoretical analysis, it can be proved that SW-Uinta(small-world) can get O((log 2 N)/k) search time with O(k) cache size. Lastly, the performance of SW-Uinta(small-world) is compared with those of other structured P2P networks such as Chord and Uinta. It shows that SW-Uinta(small-world) can achieve improved object lookup performance and reduce maintenance cost.

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. Gnutella Website. http://www.gnutellaforums.com/

  2. Leibowitz N, Ripeanu M, Wierzbicki A (2003) Deconstructing the Kazaa network. In: Proceedings of 3rd IEEE workshop on Internet applications, Santa Clara, CA, pp 112–120

  3. Clarke I, Sandberg O, Wiley B et al (2000) Freenet: A distributed anonymous information storage and retrieval system. In: Proceedings of workshop on design issues in anonymity and unobservability, ICSI, pp 311–320

  4. Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for Internet applications. In: Proceedings of the ACM SIGCOMM. ACM Press, New York, pp 149–160

    Google Scholar 

  5. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. In: Proceedings of ACM SIGCOMM. ACM Press, New York, pp 161–172

    Google Scholar 

  6. Rowstron A, Druschel P (2001) Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of the 18th IFIP/ACM international conference on distributed systems platforms. Springer, Berlin, pp 329–350

    Google Scholar 

  7. Zhao BY, Huang L, Stribling J, Rhea J, Joseph SC, Kubiatowicz AD (2004) Tapestry: a resilient global-scale overlay for service deployment. IEEE J Sel Areas Commun 22:41–53

    Article  Google Scholar 

  8. Ratnasamy S, Handley M, Karp R et al. (2002) Topologically-aware overlay construction and server selection. In: Proceedings of IEEE INFOCOM’02. IEEE Press, New York, pp 1190–1199

    Google Scholar 

  9. Mahanti A (1999) Web proxy workload characterization and modeling. Master’s thesis, Department of Computer Science, University of Saskatchewan, September 1999

  10. Milgram S (1967) The small world problem. Psychol Today 2:60–67

    Google Scholar 

  11. Watts D, Strogatz S (1998) Collective dynamics of small-world networks. Nature 393:440–442

    Article  Google Scholar 

  12. Kleinberg J (2002) Small-world phenomena and the dynamics of information. In: Proceedings of advances in neural information processing systems. MIT Press, Cambridge, pp 14–25

    Google Scholar 

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

  14. Iamnitchi A, Ripeanu M, Foster I (2004) Small-world file-sharing communities. In: Proceedings of IEEE INFOCOM. IEEE Press, New York, pp 175–186

    Google Scholar 

  15. Maymounkov P, Mazieres D (2002) Kademlia A peer-to-peer information system based on the xor metric. In: Proceedings of the 1st international workshop on peer-to-peer systems (IPTPS’02), Cambridge, MA, pp 53–65

  16. Malkhi D, Naor M, Ratajczak D (2002) Viceroy: a scalable and dynamic lookup network. In: Proceedings of the 21st ACM symposium on principles of distributed computing PODC’02, Monterey, CA, pp 183–192

  17. Manku GS, Bawa M, Raghavan P (2003) Symphony: distributed hashing in a small world. In: Proceedings of the fourth USENIX symposium on Internet technologies and systems (USITS), Seattle, WA, pp 127–140

  18. Roussopoulos M, Baker M (2003) CUP: controlled update propagation in peer-to-peer networks. In: Proceedings of the 2003 USENIX annual technical conference

  19. Garces-Erice L, Ross KW, Biersack EW, Felber PA, Urvoy-Keller G (2003) Topology-centric look-up service. In: Proceedings of COST264/ACM fifth international workshop on networked group communications (NGC), Munich, Germany. Springer, Berlin

    Google Scholar 

  20. Harvey NJA, Theimer M, Jones MB, Sarouiu S, Wolman A (2003) Skipnet: a peer-to-peer overlay network. In: Proceedings of the fourth USENIX symposium on Internet technologies and systems

  21. Freedman MJ, Freudenthal E, Mazières D (2004) Democratizing content publication with coral. In: Proceedings of USENIX/ACM symposium on networked systems design and implementation (NSDI’04), San Francisco, CA

  22. Gummadi K, Gummadi R, Gribble S, Ratnasamy S, Shenker S, Stoica I (2003) The impact of DHT routing geometry on resilience and proximity. In: Proceedings of ACM SIGCOMM

  23. Karger DR, Lehman E, Leighton F et al (1997) Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web. In: Proceedings 29th annual ACM symposium theory of computing, El Paso, TX, pp 654–663

  24. Kubiatowicz J, Bindel D, Eaton P et al ( 2000) OceanStore: an architecture for global-scale persistent storage. In: Proceedings of the 9th international conference on architectural support for programming languages and operating systems (ASPLOS’00), Cambridge, MA, pp 190–201

  25. Dabek F, Frans Kaashoek M, Karger D et al (2001) Wide-area cooperative storage with CFS. In: Proceedings of the 18th ACM symposium on operating systems principles (SOSP’01), Banff, Alberta, Canada, pp 202–215

  26. Zhang H, Goel A, Govindan R (2002) Using the small-world model to improve Freenet performance. In: Proceedings of IEEE INFOCOM 2002. IEEE Press, New York, pp 1228–1237

    Google Scholar 

  27. Zegura EW, Calvert K, Bhattacharjee S (1996) How to model an Internet work. In: Proceedings of the 15th annual joint conference of the IEEE computer and communications societies (INFOCOM’96). IEEE Communications Society, San Francisco, pp 594–602

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Services Computing Technology and System Lab., Cluster and Grid Computing Lab., School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, 430074, China

    Jie Xu & Hai Jin

  2. Faculty of Mathematics and Computer Science, Hubei University, Wuhan, 430062, China

    Jie Xu

Authors
  1. Jie Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hai Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Jie Xu or Hai Jin.

Additional information

This paper is supported by National Science Foundation of China under Grant 60433040, and CNGI projects under Grants CNGI-04-12-2A and CNGI-04-12-1D.

Rights and permissions

Reprints and permissions

About this article

Cite this article

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-008-0219-8

Keywords

Search

Navigation