Building a Scalable Bipartite P2P Overlay Network

The peer-to-peer (P2P) model, being widely adopted in today's Internet computing, suffers from the problem of topology mismatch between the overlay networks and the underlying physical network. Traditional topology optimization techniques identify physically closer nodes to connect as overlay neighbors, but could significantly shrink the search scope. Efforts have been made to address the mismatch problem without sacrificing the search scope, but they either need time synchronization among peers or have a low convergent speed. In this paper, we propose a scalable bipartite overlay (SBO) scheme to optimize the overlay topology by identifying and replacing the mismatched connections. In SBO, we employ an efficient strategy for distributing optimization tasks in peers with different colors. We conducted comprehensive simulations to evaluate this design. The results show that SBO achieves approximately 85 percent of reduction on traffic cost and about 60 percent of reduction on query response time. Our comparisons with previous approaches to address the topology mismatch problem have shown that SBO can achieve a fast convergent speed, without the need of time synchronization among peers.

[1]  Walter Willinger,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM 2002.

[2]  Donald F. Towsley,et al.  On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  Li Xiao,et al.  A distributed approach to solving overlay mismatching problem , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[4]  Li Xiao,et al.  Location awareness in unstructured peer-to-peer systems , 2005, IEEE Transactions on Parallel and Distributed Systems.

[5]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[6]  Hui Zhang,et al.  A case for end system multicast (keynote address) , 2000, SIGMETRICS '00.

[7]  Rayadurgam Srikant,et al.  Modeling and performance analysis of BitTorrent-like peer-to-peer networks , 2004, SIGCOMM 2004.

[8]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

[9]  Li Xiao,et al.  Improving unstructured peer-to-peer systems by adaptive connection establishment , 2005, IEEE Transactions on Computers.

[10]  Balachander Krishnamurthy,et al.  Topology modeling via cluster graphs , 2001, IMW '01.

[11]  Jia Wang,et al.  Analyzing peer-to-peer traffic across large networks , 2002, IMW '02.

[12]  Yunhao Liu,et al.  Dubious feedback: fair or not? , 2006, InfoScale '06.

[13]  Li Xiao,et al.  Optimizing overlay topology by reducing cut vertices , 2006, NOSSDAV '06.

[14]  Li Xiao,et al.  Location-aware topology matching in P2P systems , 2004, IEEE INFOCOM 2004.

[15]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[16]  Zheng Zhang,et al.  Building topology-aware overlays using global soft-state , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[17]  Lakshminarayanan Subramanian,et al.  An investigation of geographic mapping techniques for internet hosts , 2001, SIGCOMM 2001.

[18]  Yunhao Liu,et al.  AnySee: Peer-to-Peer Live Streaming , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[19]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[20]  Jacky C. Chu,et al.  Availability and locality measurements of peer-to-peer file systems , 2002, SPIE ITCom.

[21]  Yinglian Xie,et al.  Locality in search engine queries and its implications for caching , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.