Abstract
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create global scale overlay networks on top of which various applications can be built. Although filesharing still is the most prominent example, other applications are well conceivable. In order to rationally design such applications, it is important to know (and understand) the properties of the overlay networks as seen from the respective application.
This paper reports the results from a two week measurement of the entire Overnet network, the currently most widely deployed DHT-based overlay. We describe both, the design choices that made that measurement feasible and the results from the measurement itself. Besides the basic determination of network size, node availability and node distribution, we found unexpected results for the overlay latency distribution.
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
Ranjita Bhagwan, Stefan Savage, and Geoffrey Voelker. Understanding availability. In Proceedings of the 2003 International Workshop on Peer-to-Peer Systems (IPTPS), Berkeley, CA, February 2003.
Brent Chun, David Culler, Timothy Roscoe, Andy Bavier, Larry Peterson, Mike Wawrzoniak, and Mic Bowman. PlanetLab: An Overlay Testbed for Broad-Coverage Services. ACM SIGCOMM Computer Communication Review, 33(3):00–00, July 2003.
Curt Cramer and Thomas Fuhrmann. On the Fundamental Communication Abstraction Supplied by P2P Overlay Networks. European Transactions on Telecommunications. To be published.
Allen B. Downey. Evidence for long-tailed distributions in the internet. In Proceedings of the First ACM SIGCOMM Workshop on Internet Measurement, pages 229–241. ACM Press, 2001.
C. Huitema. An anycast prefix for 6to4 relay routers. RFC 3068, Internet Engineering Task Force, June 2001.
Internet2 Consortium. Internet2 homepage, 2004. http://www.internet2.edu.
Karthik Lakshminarayanan and Venkata N. Padmanabhan. Some findings on the network performance of broadband hosts. In Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement, pages 45–50. ACM Press, 2003.
Petar Maymounkov and David Mazières. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In Revised Papers from the First International Workshop on Peer-to-Peer Systems, pages 53–65. Springer-Verlag, 2002.
Hirokazu Miura and Miki Yamamoto. Content routing with network support using passive measurement in content distribution networks. IEICE Transactions on Communications, Special Issue on Content Delivery Networks, E86-B(6):1805–1811, June 2003.
PlanetLab Consortium. Planetlab homepage, 2004. http://www.planet-lab.org.
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A Scalable Content-Addressable Network. In Proceedings of the SIGCOMM 2001 conference, pages 161–172. ACM Press, 2001.
Y. Rekhter, B. Moskowitz, D. Karrenberg, G. J. de Groot, and E. Lear. Address allocation for private internets. RFC 1918, Internet Engineering Task Force, February 1996.
J. F. Reynolds and J. B. Postel. Assigned numbers. RFC 1700, Internet Engineering Task Force, October 1994.
A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (Middleware) 2001, Heidelberg, Germany, November 2001.
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the SIGCOMM 2001 conference, pages 149–160. ACM Press, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kutzner, K., Fuhrmann, T. (2005). Measuring Large Overlay Networks — The Overnet Example. In: Müller, P., Gotzhein, R., Schmitt, J.B. (eds) Kommunikation in Verteilten Systemen (KiVS). Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27301-8_16
Download citation
DOI: https://doi.org/10.1007/3-540-27301-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24473-8
Online ISBN: 978-3-540-27301-1
eBook Packages: Computer Science and Engineering (German Language)