This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Building a Scalable Bipartite P2P Overlay Network
September 2007 (vol. 18 no. 9)
pp. 1296-1306
ASCII Text
x 
 
Yunhao Liu, Li Xiao, Lionel Ni, "Building a Scalable Bipartite P2P Overlay Network," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 9, pp. 1296-1306, September, 2007.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2007.1059,
author = {Yunhao Liu and Li Xiao and Lionel Ni},
title = {Building a Scalable Bipartite P2P Overlay Network},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {18},
number = {9},
issn = {1045-9219},
year = {2007},
pages = {1296-1306},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2007.1059},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Building a Scalable Bipartite P2P Overlay Network
IS - 9
SN - 1045-9219
SP1296
EP1306
EPD - 1296-1306
A1 - Yunhao Liu,
A1 - Li Xiao,
A1 - Lionel Ni,
PY - 2007
KW - Unstructured Peer-to-Peer
KW - topology mismatch
KW - overlay
KW - bipartite
KW - search efficiency
VL - 18
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
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 physical closer nodes to connect as overlay neighbors, but could significantly shrink the search scope. Recent efforts have been made to address the mismatch problem without sacrificing 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% reduction on traffic cost and about 60% reduction on query response time. Our comparisons with previous approaches to address the topology mismatch problem have shown that SBO can achieve fast convergent speed without the need of time synchronization among peers.

[1] Gnutella Network Size, http://www.limewire.com/index.jspsize, 2007.
[2] FastTrack, http://developer.berlios.de/projectsgift-fasttrack /, 2007.
[3] KaZaA, http:/www.kazaa.com, 2007.
[4] BRITE, http://www.cs.bu.edubrite/, 2007.
[5] NTP: The Network Time Protocol, http:/www.ntp.org/, 2007.
[6] BitTorrent, http:/www.bittorrent.com/, 2007.
[7] The Gnutella Protocol Specification 0.6, http:/rfc-gnutella. sourceforge.net, 2007.
[8] R. Bhagwan, S. Savage, and G.M. Voelker, “Understanding Availability,” Proc. Second Int'l Workshop Peer-to-Peer Systems (IPTPS '03), 2003.
[9] T. Bu and D. Towsley, “On Distinguishing between Internet Power Law Topology Generators,” Proc. IEEE INFOCOM, 2002.
[10] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, “Making Gnutella-Like P2P Systems Scalable,” Proc. ACM SIGCOMM, 2003.
[11] Y. Chu, S.G. Rao, and H. Zhang, “A Case for End System Multicast,” Proc. ACM SIGMETRICS, 2000.
[12] J. Han and Y. Liu, “Rumor Riding: Anonymizing Unstructured Peer-to-Peer Systems,” Proc. 14th IEEE Int'l Conf. Network Protocols (ICNP '06), 2006.
[13] J. Han and Y. Liu, “Dubious Feedback: Fair or Not,” Proc. Int'l Workshop Peer-to-Peer Information Management (P2PIM '06), 2006.
[14] B. Krishnamurthy and J. Wang, “Topology Modeling via Cluster Graphs,” Proc. ACM SIGCOMM Internet Measurement Workshop '01, 2001.
[15] X. Liao, H. Jin, Y. Liu, L.M. Ni, and D. Deng, “AnySee: Peer-to-Peer Live Streaming,” Proc. IEEE INFOCOM, 2006.
[16] X. Liu, L. Xiao, A. Kreling, and Y. Liu, “Optimizing Overlay Topology by Reducing Cut Vertices,” Proc. 16th ACM Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV '06), 2006.
[17] Y. Liu, X. Liu, L. Xiao, L.M. Ni, and X. Zhang, “Location-Aware Topology Matching in P2P Systems,” Proc. IEEE INFOCOM, 2004.
[18] Y. Liu, Z. Zhuang, L. Xiao, and L.M. Ni, “A Distributed Approach to Solving Overlay Mismatch Problem,” Proc. 24th Int'l Conf. Distributed Computing Systems (ICDCS '04), 2004.
[19] Y. Liu, L. Xiao, X. Liu, L.M. Ni, and X. Zhang, “Location Awareness in Unstructured Peer-to-Peer Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 16, pp. 163-174, 2005.
[20] V.N. Padmanabhan and L. Subramanian, “An Investigation of Geographic Mapping Techniques for Internet Hosts,” Proc. ACM SIGCOMM, 2001.
[21] D. Qiu and R. Srikant, “Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks,” Proc. ACM SIGCOMM, 2004.
[22] M. Ripeanu, A. Iamnitchi, and I. Foster, “Mapping the Gnutella Network,” IEEE Internet Computing, vol. 6, 2002.
[23] J. Ritter, “Why Gnutella Can't Scale. No, Really,” http://www.tch.orggnutella.html, 2001.
[24] S. Saroiu, P. Gummadi, and S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” Proc. ACM/SPIE Conf. Multimedia Computing and Networking (MMCN '02), 2002.
[25] M.T. Schlosser and S.D. Kamvar, “Availability and Locality Measurements of Peer-to-Peer File Systems,” Proc. SPIE ITCom Conf. Scalability and Traffic Control in IP Networks, 2002.
[26] S. Sen and J. Wang, “Analyzing Peer-to-Peer Traffic across Large Networks,” Proc. ACM SIGCOMM Internet Measurement Workshop '02, 2002.
[27] K. Sripanidkulchai, “The Popularity of Gnutella Queries and Its Implications on Scalability,” http://www-2.cs.cmu.edu/~kunwadee/research/ p2pgnutella.html, 2007.
[28] H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, “Network Topology Generators: Degree-Based versus Structural,” Proc. ACM SIGCOMM, 2002.
[29] L. Xiao, Y. Liu, and L.M. Ni, “Improving Unstructured Peer-to-Peer Systems by Adaptive Connection Establishment,” IEEE Trans. Computers, 2005.
[30] Y. Xie and D. O'Hallaron, “Locality in Search Engine Queries and Its Implications for Caching,” Proc. IEEE INFOCOM, 2002.
[31] Z. Xu, C. Tang, and Z. Zhang, “Building Topology-Aware Overlays Using Global Soft-State,” Proc. 23rd Int'l Conf. Distributed Computing Systems (ICDCS '03), 2003.

Index Terms:
Unstructured Peer-to-Peer, topology mismatch, overlay, bipartite, search efficiency
Citation:
Yunhao Liu, Li Xiao, Lionel Ni, "Building a Scalable Bipartite P2P Overlay Network," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 9, pp. 1296-1306, Sept. 2007, doi:10.1109/TPDS.2007.1059
Usage of this product signifies your acceptance of the Terms of Use.