research-article

A distributed topology-aware overlays construction algorithm

Authors:

Xiaoming Zhang,

Yijie WangAuthors Info & Claims

MG '08: Proceedings of the 15th ACM Mardi Gras conference: From lightweight mash-ups to lambda grids: Understanding the spectrum of distributed computing requirements, applications, tools, infrastructures, interoperability, and the incremental adoption of key capabilities

Article No.: 5, Pages 1 - 6

https://doi.org/10.1145/1341811.1341818

Published: 29 January 2008 Publication History

Abstract

Peer-to-Peer (P2P) computing systems are rapidly growing in importance as the medium of choice for the mass storage. Peers in the most P2P systems randomly choose logical neighbors without any knowledge about underlying physical topology. This mechanism can cause a serious topology mismatch between the P2P overlay network and the underlying network. It greatly limits the performance gain from various search or routing techniques. In this paper, a distributed topology-aware overlays construction algorithm Taonet is proposed, in which the overlay network construction is based on the location information of underlying topology. The nodes that are close in the logical network are also close in terms of network latency. This leads to low latency stretch of the overlay network. This algorithm is scalable and distributed. Simulation results indicate that the latency of data location in these topology-aware P2P systems that are constructed with Taonet can be significantly decreased.

References

[1]

Napster, "http://www.napster.com,".

[2]

Gnutella, "http://gnutella.wego.com,".

[3]

FreeNet, "http://freenet.sourceforge.net,".

[4]

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proceedings of SIGCOMM 2001, Aug. 2001.

Digital Library

[5]

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," in Proceedings of SIGCOMM 2001, Aug. 2001.

Digital Library

[6]

A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," available at http://research.microsoft.com/antr/PAST/, 2001.

Digital Library

[7]

J. Kubiatowicz et al., "Oceanstore: An Architecture for Global-scale Persistent Storage," in Proceedings of ASPLOS 2000, Cambridge, Massachusetts, Nov. 2000.

Digital Library

[8]

Zhuge, H., Liu, J., Feng, L., Sun, X., He, C.: Queryrouting in a peer-to-peer semantic link network. Computational Intelligence 21(2) (2005) 197--216.

[9]

Saroui, S., Gummadi, K. P., Dunn, R. J., Gribble, S. D., Levy, H. M.:An analysis of intener content delivery systems. In: Proc. IEEE Fifth Symp. Operating Systems Design and Implementation.(2002).

Digital Library

[10]

Sen, S., Wang, J.:Analyzing peer-to-peer traffic across large networks. In: Proc. ACM SIGCOMM Internet Measurement Workshop (2002).

Digital Library

[11]

Liu, Y., Xiao, L., Liu, X., Ni, L. M., Zhang, X.:Location Awareness in unstructured peer-to-peer systems. IEEE Transaction on Parallel and Distributed Systems 16 (2005) 163--174.

Digital Library

[12]

S. Ratnasamy, S. Shenker, and I. Stoica. Routing algorithms for dhts: Some open questions. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS'02), Boston, MA, Mar. 2002.

Digital Library

[13]

M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron, "Topology aware routing in structured peer-to-peer overlay networks," Tech. Rep. MSR-TR-2002-82, Microsoft Research, One Microsoft Way, Redmond, WA 98052, 2002.

[14]

Winter, R., Zahn, T., Schiller, J.: Topology-aware overlay construction in dynamic network. (2004).

[15]

S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically-aware overlay construction and server selection. In Proc. 21st IEEE INFOCOM, New York, NY, June 2002.

[16]

Z. Xu, C. Tang, and Z. Zhang. Building Topology-Aware Overlays using Global Soft-State. In ICDSC'2003, May 2003.

Digital Library

[17]

T. S. E. Ng and H. Zhang. Predicting Internet network distance with coordinates-based approaches. In Proceedings of IEEE Infocom, pages 170--179, 2002.

[18]

Oguz Kaan Onbilger, Shigang Chen, Randy Chow: A Peer-to-Peer Network Position Architecture. Gainesville, FL 32611, USA, 2004.

[19]

M. R. Garrey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman and Company, San Francisco, CA, 1979.

Digital Library

[20]

The p2psim project. http://www.pdos.lcs.mit.edu/p2psi-m.

[21]

Krishna P. Gummadi, Stefan Saroiu, and Steven D. Gribble. King: Estimating latency between arbitrary internet end hosts. In Proceedings of the SIGCOMM Internet Measurement Workshop (IMW 2002), Marseille, France, November 2002.

Digital Library

[22]

A. Medina. A. Lakhina. I. Matta. And J. Byers. BRITE: An Approach to Universal Topology Generation. In Proceedings of MASCOTS 2001. Cincinnati. OH. August 2001.

Digital Library

Cited By

Sharifi LKhorsandi S(2012)A popularity-based query scheme in P2P networks using adaptive gossip samplingPeer-to-Peer Networking and Applications10.1007/s12083-012-0135-96:1(75-85)Online publication date: 1-May-2012
https://doi.org/10.1007/s12083-012-0135-9
Chun-Hsin Wang Yen-Ting Wu (2010)Network locality positioning system in P2P networks2010 Second International Conference on Ubiquitous and Future Networks (ICUFN)10.1109/ICUFN.2010.5547171(384-389)Online publication date: Jun-2010
https://doi.org/10.1109/ICUFN.2010.5547171
Gao JZhou D(2010)The emergence of sparse spanners and greedy well-separated pair decompositionProceedings of the 12th Scandinavian conference on Algorithm Theory10.1007/978-3-642-13731-0_6(50-61)Online publication date: 21-Jun-2010
https://dl.acm.org/doi/10.1007/978-3-642-13731-0_6
Show More Cited By

Index Terms

A distributed topology-aware overlays construction algorithm

Recommendations

Underlay Aware Resiliency in P2P Overlays
ICDCN '09: Proceedings of the 10th International Conference on Distributed Computing and Networking

Modern distributed applications that run on P2P overlays need the overlay to be resilient to failures in the underlying communications network. An example application is that of event dissemination where the P2P overlay (the event broker network) ...
Topology inference and tree construction for topology-aware overlay streaming
Efficient topology-aware overlay network

Peer-to-peer (P2P) networking has become a household word in the past few years, being marketed as a work-around for server scalability problems and "wonder drug" to achieve resilience. Current widely-used P2P networks rely on central directory servers ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

MG '08: Proceedings of the 15th ACM Mardi Gras conference: From lightweight mash-ups to lambda grids: Understanding the spectrum of distributed computing requirements, applications, tools, infrastructures, interoperability, and the incremental adoption of key capabilities

January 2008

178 pages

ISBN:9781595938350

DOI:10.1145/1341811

General Chair:
Daniel S. Katz
LSU
,
Program Chair:
Craig Lee
Aerospace Corporation

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

National e-Science Institute (Edinburgh, UK)
Louisiana State University (USA)

In-Cooperation

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 January 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

Mardi Gras'08

Sponsor:

Mardi Gras'08: 15th Mardi Gras Conference on Distributed Applications

January 29 - February 3, 2008

Louisiana, Baton Rouge, USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
302
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Sharifi LKhorsandi S(2012)A popularity-based query scheme in P2P networks using adaptive gossip samplingPeer-to-Peer Networking and Applications10.1007/s12083-012-0135-96:1(75-85)Online publication date: 1-May-2012
https://doi.org/10.1007/s12083-012-0135-9
Chun-Hsin Wang Yen-Ting Wu (2010)Network locality positioning system in P2P networks2010 Second International Conference on Ubiquitous and Future Networks (ICUFN)10.1109/ICUFN.2010.5547171(384-389)Online publication date: Jun-2010
https://doi.org/10.1109/ICUFN.2010.5547171
Gao JZhou D(2010)The emergence of sparse spanners and greedy well-separated pair decompositionProceedings of the 12th Scandinavian conference on Algorithm Theory10.1007/978-3-642-13731-0_6(50-61)Online publication date: 21-Jun-2010
https://dl.acm.org/doi/10.1007/978-3-642-13731-0_6
McIlwraith DPaquier MKotsovinos E(2008)di-jestProceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks10.1109/WOWMOM.2008.4594898(1-6)Online publication date: 23-Jun-2008
https://dl.acm.org/doi/10.1109/WOWMOM.2008.4594898

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten