Skip to main content
SpringerLink
Log in

Peer-exchange schemes to handle mismatch in peer-to-peer systems

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

Abstract

A self-organizing peer-to-peer system is built upon an application level overlay, whose topology is independent of an underlying physical network. A well-routed message path in such systems may result in a long delay and excessive traffic due to the mismatch between logical and physical networks. In order to solve this problem, we present a family of Peer-exchange Routing Optimization Protocols (PROP) to reconstruct the overlay. It includes two policies: PROP-G for generic condition and PROP-O for optimized one. Both theoretical analysis and simulation experiments show that these two protocols greatly reduce the average latency of the overlay and achieve a better logical topology with low overhead. Their overall performance can be further improved if combined with other recent approaches. Specifically, PROP-G can be easily applied to both structured and unstructured systems without the loss of their primary characteristics, such as efficient routing and anonymity. PROP-O, on the other hand, is more efficient, especially in a heterogenous environment where nodes have different processing capabilities.

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. What is Gnutella. http://rfc-gnutella.sourceforge.net

  2. Kazaa v3.2.5. http://www.kazaa.com

  3. Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for Internet applications. In: SIGCOMM ’01: Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications. ACM Press, New York, pp 149–160

    Chapter  Google Scholar 

  4. Rowstron A, Drusche P (2001) Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Middleware 2001: IFIP/ACM international conference on distributed systems platforms, vol 2218/2001. Springer, Berlin, pp 329–350

    Google Scholar 

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

    Article  Google Scholar 

  6. Castro M, Costa M, Rowstron A (2004) Should we build Gnutella on a structured overlay? SIGCOMM Comput Commun Rev 34(1):131–136

    Article  Google Scholar 

  7. Liu Y, Xiao L, Liu X, Ni LM, Zhang X (2005) Location awareness in unstructured peer-to-peer systems. IEEE Trans Parallel Distributed Syst 16(2):163–174

    Article  Google Scholar 

  8. Ripeanu M, Iamnitchi A, Foster I (2002) Mapping the Gnutella network. IEEE Internet Comput 6(1):50–57

    Article  Google Scholar 

  9. Liu Y, Xiao L, Ni L (2004) Building a scalable bipartite P2P overlay network. In: IPDPS ’04: 18th international parallel and distributed processing symposium. IEEE Computer Society, pp 46–55

  10. Liu Y, Zhuang Z, Xiao L, Ni L (2004) Distributed approach to solving overlay mismatching problem. In: ICDCS ’04: 24th international conference on distributed computing systems. IEEE Computer Society, pp 132–139

  11. Gummadi K, Gummadiy R, Gribblez S, Ratnasamy S, Shenker S, Stoica I (2003) The impact of DHT routing geometry on resilience and proximity. In: SIGCOMM ’03: Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications. ACM Press, New York, pp 381–394

    Chapter  Google Scholar 

  12. Ratnasamy S, Stoica I, Shenker S (2002) Routing algorithms for DHTs: some open questions. In: IPTPS ’01: Revised papers from the first international workshop on peer-to-peer systems. Springer, London, pp 45–52

    Google Scholar 

  13. Ratnasamy S, Handley M, Karp R, Shenker S (2002) Topologically-aware overlay construction and server selection. In: INFOCOM 2002: Twenty-first annual joint conference of the IEEE computer and communications societies, vol 3, pp 1190–1199

  14. Waldvogel M, Rinaldi R (2003) Efficient topology-aware overlay network. SIGCOMM Comput Commun Rev 33(1):101–106

    Article  Google Scholar 

  15. Han J, Watson D, Jahanian F (2005) Topology aware overlay networks. In: INFOCOM 2005: 24th annual joint conference of the IEEE computer and communications societies, vol 4, pp 2554–2565

  16. Fan J, Ammar MH (2006) Dynamic topology configuration in service overlay networks: a study of reconfiguration policies. In: INFOCOM 2006

  17. Zhao BY, Duan Y, Huang L, Joseph AD, John, Kubiatowicz D (2002) Brocade: Landmark routing on overlay networks. In: Peer-to-peer systems: first international-workshop, IPTPS 2002, vol 2429. Springer, Berlin/Heidelberg, pp 34–44

    Google Scholar 

  18. Xu Z, Mahalingam M, Karlsson M (2003) Turning heterogeneity into an advantage in overlay routing. In: INFOCOM 2003: Twenty-second annual joint conference of the IEEE computer and communications societies, vol 2, pp 1499–1509

  19. Li J, Stribling J, Morris R, Kaashoek MF (2005) Bandwidth-efficient management of DHT routing tables. In: NSDI 05: 2nd symposium on networked systems design and implementation. USENIX, pp 99–114

  20. Hu J, Li M, Zheng W, Wang D, Ning N, Dong H (2004) SmartBoa: Constructing P2P overlay network in the heterogeneous Internet using irregular routing tables. In: IPTPS 2004: International workshop on peer-to-peer systems, vol 3279. Springer, Berlin, pp 278–287

    Google Scholar 

  21. Chawathe Y, Ratnasamy S, Breslau L (2003) Making Gnutella-like P2P systems scalable. In: SIGCOMM ’03: Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications. ACM Press, New York, pp 407–418

    Chapter  Google Scholar 

  22. Ren S, Guo L, Jiang S, Zhang X (2004) SAT-Match: a self-adaptive topology matching method to achieve low lookup latency in structured P2P overlay networks. In: IPDPS ’04: 18th international parallel and distributed processing symposium. IEEE Computer Society, pp 83–91

  23. Rowstron A, Druschel P (2001) Storage management and caching in past, a largescale, persistent peer-to-peer storage utility. In: SOSP ’01: Proceedings of the eighteenth ACM symposium on operating systems principles. ACM Press, New York, pp 188–201

    Chapter  Google Scholar 

  24. Dabek F, Kaashoek M, Karger D, Morris R, Stoica I (2001) Wide-area cooperative storage with CFS. In: SOSP ’01: Proceedings of the eighteenth ACM symposium on operating systems principles. ACM Press, New York, pp 202–215

    Chapter  Google Scholar 

  25. Zegura EW, Calvert KL, Bhattacharjee S (1996) How to model an internetwork. In: INFOCOM’96: Fifteenth annual joint conference of the IEEE computer societies, vol 2, pp 594–602

  26. Dabek F, Li J, Sit E, Robertson J, Kaashoek MF, Morris R (2004) Designing a DHT for low latency and high throughput. In: USENIX symposium on networked systems design and implementation

  27. Chun S-G, Zhao BY, Kubiatowicz JD (2005) Impact of neighbor selection on performance and resilience of structured P2P networks. In: IPTPS 2005: 4th international workshop of P2P systems. Springer, Berlin, pp 264–274

    Google Scholar 

  28. Rhea S, Geels D, Roscoe T, Kubiatowicz J (2004) Handling churn in a DHT. In: USENIX annual technical conference

  29. Bustamante F, Qiao Y (2003) Friendships that last: peer lifespan and its role in P2P protocols. In: Web content caching and distribution: proceedings of the 8th international workshop. Kluwer Academic, Norwell, pp 233–246

    Google Scholar 

  30. Qiu T, Wu F, Chen G (2005) A generic approach to make structured peer-to-peer systems topology-aware. In: Proceedings of ISPA, pp 816–826

  31. Qiu T, Chen G, Ye M, Chan E (2007) Towards location-aware topology in both unstructured and structured P2P systems. In: Proceedings of ICPP

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong

    Tongqing Qiu & Edward Chan

  2. State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, China

    Tongqing Qiu, Mao Ye & Guihai Chen

  3. Department of Computer Science, University of California, Santa Barbara, CA, USA

    Ben Y. Zhao

Authors
  1. Tongqing Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Edward Chan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mao Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Guihai Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ben Y. Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Edward Chan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Qiu, T., Chan, E., Ye, M. et al. Peer-exchange schemes to handle mismatch in peer-to-peer systems. J Supercomput 48, 15–42 (2009). https://doi.org/10.1007/s11227-008-0203-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-008-0203-3

Keywords

Search

Navigation