Evaluation of a Large-Scale Topology Discovery Algorithm

In the past few years, the network measurement community has been interested in the problem of internet topology discovery using a large number (hundreds or thousands) of measurement monitors. The standard way to obtain information about the internet topology is to use the traceroute tool from a small number of monitors. Recent papers have made the case that increasing the number of monitors will give a more accurate view of the topology. However, scaling up the number of monitors is not a trivial process. Duplication of effort close to the monitors wastes time by reexploring well-known parts of the network, and close to destinations might appear to be a distributed denial-of-service (DDoS) attack as the probes converge from a set of sources towards a given destination. In prior work, authors of this paper proposed Doubletree, an algorithm for cooperative topology discovery, that reduces the load on the network, i.e., router IP interfaces and end-hosts, while discovering almost as many nodes and links as standard approaches based on traceroute. This paper presents our open-source and freely downloadable implementation of Doubletree in a tool we call [email protected] We evaluate the performance of our implementation on the PlanetLab testbed and discuss a large-scale monitoring infrastructure that could benefit of Doubletree.

[1]  A. Clauset,et al.  Traceroute sampling makes random graphs appear to have power law degree distributions , 2003, cond-mat/0312674.

[2]  Cristopher Moore,et al.  Accuracy and scaling phenomena in Internet mapping. , 2004, Physical review letters.

[3]  Yuval Shavitt,et al.  DIMES: let the internet measure itself , 2005, CCRV.

[4]  Mark Crovella,et al.  Community-oriented network measurement infrastructure (CONMI) workshop report , 2006, CCRV.

[5]  Mark Crovella,et al.  Improved Algorithms for Network Topology Discovery , 2005, PAM.

[6]  Peng Xie,et al.  Sampling biases in IP topology measurements , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  David P. Anderson,et al.  SETI@home: an experiment in public-resource computing , 2002, CACM.

[8]  Bill Cheswick,et al.  Mapping and Visualizing the Internet , 2000, USENIX Annual Technical Conference, General Track.

[9]  Benoit Donnet,et al.  Implementation and Deployment of a Distributed Network Topology Discovery Algorithm , 2006, ArXiv.

[10]  Hans-Werner Braun,et al.  The NLANR network analysis infrastructure , 2000, IEEE Commun. Mag..

[11]  K. Claffy,et al.  Topology discovery by active probing , 2002, Proceedings 2002 Symposium on Applications and the Internet (SAINT) Workshops.

[12]  Mark Crovella,et al.  Efficient algorithms for large-scale topology discovery , 2004, SIGMETRICS '05.

[13]  Benoit Donnet,et al.  Increasing the Coverage of a Cooperative Internet Topology Discovery Algorithm , 2007, Networking.

[14]  Larry L. Peterson,et al.  Using PlanetLab for network research: myths, realities, and best practices , 2005, OPSR.

[15]  Mark Santcroos,et al.  Providing Active Measurements as a Regular Service for ISP's , 2001 .