Abstract
The performance of peer-to-peer and overlay networks depends to a great extent on their awareness of the underlying network’s properties. Several schemes for estimating end-to-end network distances have been proposed to simplify this task. The mOverlay framework identifies groups of nodes that are near to each other in the network topology. Instead of distances between nodes mOverlay measures distances between groups. However, mOverlay’s locating procedure has a number of drawbacks. We propose an alternate method for identifying groups using Meridian’s closest node search. Simulation results based on PlanetLab measurements indicate that the Meridian-based approach is able to outperform mOverlay in terms of joining delay, the size of the identified groups, and their suitability for a distance estimation service.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
X. Y. Zhang et al., “A construction of locality-aware overlay network: mOverlay and its performance,” IEEE JSAC, vol. 22, no. 1, pp. 18–28, January 2004.
B. Wong, A. Slivkins, and E. G. Sirer, “Meridian: A lightweight network location service without virtual coordinates,” ACM SIGCOMM’05, Philadelphia, Pennsylvania, USA, August 21–26, 2005.
Meridian C++ code, http://www.cs.cornell.edu/People/egs/meridian/code.php
M. Scheidegger, T. Braun, and F. Baumgartner, “Endpoint Cluster Identification for End-to-End Distance Estimation,” ICC’06, Istanbul, Turkey, June 11–15, 2006, ISBN 1-4244-0355-3.
J. Stribling, “AU-pairs-pings for PlanetLab,” http://pdos.csail.mit.edu/~strib/pl_app.
random.org — True Random Number Service, http://www.random.org.
The Annotated Gnutella Protocol Specification, http://rfcgnutella.sourceforge.net/developer/stable/index.html.
Clarke et al., “Protecting Free Expression Online with Freenet,” IEEE Internet Computing, February 2002, pp. 40–49
S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker, “A scalable content-addressable network,” SIGCOMM 2001, Aug 2001.
S. Ratnasamy, M. Handley, R. Karp and S. Shenker, “Topologically aware overlay construction and server selection,” IEEE Infocom’02, New York, NY, June 2002.
A. Rowstron and P. Druschel, “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,” IFIP/ACM Middleware 2001, Heidelberg, Germany, pp. 329–350, November 2001.
L. Garcés-Erice, E. W. Biersack, and P. A. Felber, “MULTI+: Building topology-aware overlay multicast trees,” in QofIS’04, September 2004.
M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron, “SCRIBE: A large-scale and decentralized application-level multicast infrastructure,” IEEE JSAC, Vol. 20, No. 8, pp. 1489–1499, 2002.
P. Francis, S. Jamin, J. Cheng, Y. Jin, D. Raz, and Y. Shavitt, “IDMaps: A global internet host distance estimation service,” IEEE/ACM ToN, Vol. 9, No. 5, pp. 525–540, October 2001.
W. Theilmann and K. Rothermel, “Dynamic distance maps of the Internet,” IEEE Infocom 2000.
T. S. E. Ng and H. Zhang, “Predicting Internet network distance with coordinates-based approaches,” ACM IMC 2003.
M. Pias, J. Crowcroft, S. Wilbur, T. Harris, and S. Bhatti, “Lighthouses for scalable distributed location,” IPTPS 2003.
F. Dabek, R. Cox, F. Kaashoek, and R. Morris, “Vivaldi: A decentralized network coordinate system,” ACM SIGCOMM 2004.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scheidegger, M., Braun, T. (2007). Improved Locality-Aware Grouping in Overlay Networks. In: Braun, T., Carle, G., Stiller, B. (eds) Kommunikation in Verteilten Systemen (KiVS). Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69962-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-69962-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69961-3
Online ISBN: 978-3-540-69962-0
eBook Packages: Computer Science and Engineering (German Language)