Internet Topology Discovery: a Survey

Tue, 06/05/2007 - 15:26 by Benoit Donnet

Abstract

Since the beginning of the nineties, the Internet has undergone impressive growth. This growth can be evaluated in terms of equipment, such as routers, links, etc. as well as in terms of users making the Internet a great commercial success. In parallel to this expansion, for the past ten years, the networking research community has known a growing interest in discovering and analyzing the Internet topology. Researchers have developed several tools for gathering network topology data while others have tried to understand and model the Internet properties. We are, though, at a crossroad regarding measurement infrastructures: while, previously, these measurement infrastructures were both small (in terms of number of measurement points) and monolithic, we are starting to see the deployment of large-scale distributed measurement infrastructures made of hundreds or thousands of monitors. In such a context, we believe time has come to step back and take some time to look at what has been achieved. In this survey, we discuss past and current mechanisms for discovering the Internet topology at various levels: the IP interface, the router, the AS and the PoP level. In addition to discovery techniques, we provide an insight into some of the well known properties of the Internet topology.

Authors
B. Donnet and T. Friedman
Source
IEEE Communications Surveys and Tutorials, 9(4):2-15, December 2007.
Full text
pdf    (193.32 KB)
Cite it
BibTex
Copyright
See here

IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice: Copyright 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of 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 or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.

Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.