[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing

Published: 01 November 2006 Publication History

Abstract

Peer-to-peer (P2P) file sharing systems such as Gnutella have been widely acknowledged as the fastest-growing Internet applications ever. The P2P model has many potential advantages, including high flexibility and serverless management. However, these systems suffer from the well-known performance mismatch between the randomly constructed overlay network topology and the underlying IP-layer topology. This paper proposes to structure the P2P overlay topology using a heterogeneity-aware multitier topology to better balance the load at peers with heterogeneous capacities and to prevent low-capability nodes from throttling the performance of the system. An analytical model is developed to enable the construction and maintenance of heterogeneity-aware overlay topologies with good node connectivity and better load balance. We also develop an efficient routing scheme, called probabilistic selective routing, that further utilizes heterogeneity-awareness to enhance the routing performance. We evaluate our design through simulations. The results show that our multitier topologies alone can provide eight to 10 times improvement in the messaging cost, two to three orders of magnitude improvement in terms of load balancing, and seven to eight times lower topology construction and maintenance costs when compared to Gnutella's random power-law topology. Moreover, our heterogeneity-aware routing scheme provides further improvements on all evaluation metrics, when used with our heterogeneity-aware overlay topologies.

References

[1]
E. Adar and B.A. Huberman, “Free Riding On Gnutella,”
[2]
Y. Chawathe, S. Ratnaswamy, L. Breslau, N. Lanham, and S. Shenker, “Making Gnutella-Like P2P Systems Scalable,” Proc. ACM SIGCOMM, 2003.
[3]
A. Crespo and H. Garcia-Molina, “Routing Indices for Peer-to-Peer Systems,” Proc. Int'l Conf. Distributed Computing Systems, July 2002.
[4]
A. Crespo and H. Garcia-Molina, “Semantic Overlay Networks for P2P Systems,” technical report, Computer Science Dept., Stanford Univ., Oct. 2002.
[5]
G.S. Fishman, Discrete-Event Simulation. Springer-Verlag, 2001.
[6]
“Super-Peer Architectures for Distributed Computing,” F.S. Inc.,
[7]
“Kazaa Home Page,”
[8]
S. Kirkpatrick, C.D. Gellat, and M.P. Vecchi, “Optimization by Simulated Annealing,” Science, no. 4598, May 1983.
[9]
“Improving Gnutella Protocol: Protocol AnalysisandResearch Proposals,” Limewire,
[10]
Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. 16th Ann. ACM Int'l Conf. Supercomputing, 2002.
[11]
E.P. Markatos, “Tracing A Large-Scale Peer to Peer System: An Hour in the Life of Gnutella,” Proc. Second IEEE/ACM Int'l Symp. Cluster Computing and the Grid, 2002.
[12]
H.D. Meer, “Peer-to-Peer Programmability,” Programmable Networks for IP-Service Deployment, A. Galis, S. Denazis, C. Brou, and C. Klein, eds., chapter 6, pp. 87-107. Artech House Books, 2004.
[13]
S.R. Qin Lv and S. Shenker, “Can Heterogeneity Make Gnutella Scalable?” Proc. First Int'l Workshop Peer-to-Peer Systems, 2002.
[14]
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. SIGCOMM Ann. Conf. Data Comm., Aug. 2001.
[15]
S. Saroiu, P.K. Gummadi, and S.D. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” Technical Report UW-CSE-01-06-02, Univ. of Washington, 2001.
[16]
A. Singh, “Mini Project I,”
[17]
K. Sripanidkulchai, “The Popularity of Gnutella Queries and Its Implications on Scalability,”
[18]
I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. SIGCOMM Ann. Conf. Data Comm., Aug. 2001.
[19]
Z. Xu, M. Mahalingam, and M. Karlsson, “Turning Heterogeneity into an Advantage in Overlay Routing,” Proc. IEEE Infocom, 2003.
[20]
B. Yang and H. Garcia-Molina, “Improving Search in Peer-to-Peer Networks,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS '03), July 2003.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems  Volume 17, Issue 11
November 2006
159 pages

Publisher

IEEE Press

Publication History

Published: 01 November 2006

Author Tags

  1. Peer-to-peer systems
  2. load balancing.
  3. node heterogeneity
  4. overlay routing
  5. overlay topology

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 18 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2017)Evolution of superpeer topologies An analytical perspectivePervasive and Mobile Computing10.1016/j.pmcj.2017.07.00540:C(339-358)Online publication date: 1-Sep-2017
  • (2016)Alleviating the topology mismatch problem in distributed overlay networksJournal of Systems and Software10.1016/j.jss.2015.11.038113:C(216-245)Online publication date: 1-Mar-2016
  • (2013)A mobile agent-based routing model for grid computingThe Journal of Supercomputing10.1007/s11227-011-0616-263:2(431-442)Online publication date: 1-Feb-2013
  • (2011)EventGuardACM Transactions on Computer Systems10.1145/2063509.206351029:4(1-40)Online publication date: 1-Dec-2011
  • (2009)A dynamic ultrapeers selection policy for collaborative virtual environments over mobile ad hoc networksProceedings of the 2009 IEEE international conference on Communications10.5555/1817770.1818278(5415-5419)Online publication date: 14-Jun-2009
  • (2009)Node-capability-aware replica management for peer-to-peer gridsIEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans10.1109/TSMCA.2009.201596039:4(807-818)Online publication date: 1-Jul-2009
  • (2009)Node isolation model and age-based neighbor selection in unstructured P2P networksIEEE/ACM Transactions on Networking10.1109/TNET.2008.92562617:1(144-157)Online publication date: 1-Feb-2009
  • (2009)BloomCastProceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid10.1109/CCGRID.2009.50(52-59)Online publication date: 18-May-2009
  • (2008)T2MCProceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet10.5555/1792514.1792557(366-374)Online publication date: 5-May-2008
  • (2008)A mobile agent-based statistic execution model for grid computingProceedings of the 3rd international conference on Advances in grid and pervasive computing10.5555/1788754.1788767(71-82)Online publication date: 25-May-2008

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media