Deployment of an Algorithm for Large-Scale

Topology discovery systems are starting to be intro- duced in the form of easily and widely deployed software. Unfor- tunately, the research community has not examined the problem of how to perform such measurements efficiently and in a net- work-friendly manner. This paper describes several contributions towards that end. These were first presented in the proceedings of ACM SIGMETRICS 2005. We show that standard topology discovery methods (e.g., skitter) are quite inefficient, repeatedly probing the same interfaces. This is a concern, because when scaled up, such methods will generate so much traffic that they will begin to re- semble distributed denial-of-service attacks. We propose two met- rics focusing on redundancy in probing and show that both are im- portant. We also propose and evaluate Doubletree, an algorithm that strongly reduces redundancy, while maintaining nearly the same level of node and link coverage. The key ideas are to ex- ploit the tree-like structure of routes to and from a single point in order to guide when to stop probing, and to probe each path by starting near its midpoint. Following the SIGMETRICS work, we im- plemented Doubletree, and deployed it in a real-network environ- ment. This paper describes that implementation, as well as prelim- inary favorable results.

[1]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, SIGCOMM 2002.

[2]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

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

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

[5]  David Wetherall,et al.  Scriptroute: A Public Internet Measurement Facility , 2003, USENIX Symposium on Internet Technologies and Systems.

[6]  T. Petermann,et al.  Exploration of scale-free networks , 2004, cond-mat/0401065.

[7]  kc claffy,et al.  Internet topology: connectivity of IP graphs , 2001, SPIE ITCom.

[8]  Cristopher Moore,et al.  Why Mapping the Internet is Hard , 2004 .

[9]  Alessandro Vespignani,et al.  A statistical approach to the traceroute-like exploration of networks: theory and simulations , 2004, ArXiv.

[10]  Jean-Loup Guillaume,et al.  Relevance of massively distributed explorations of the Internet topology: simulation results , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Jean-Jacques Pansiot,et al.  On routes and multicast trees in the Internet , 1998, CCRV.

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

[13]  Azer Bestavros,et al.  On the marginal utility of network topology measurements , 2001, IMW '01.

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

[15]  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).

[16]  George F. Riley,et al.  NETI@home: A Distributed Approach to Collecting End-to-End Network Performance Measurements , 2004, PAM.

[17]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

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

[19]  Rajeev Rastogi,et al.  Robust Monitoring of Link Delays and Faults in IP Networks , 2003, IEEE/ACM Transactions on Networking.

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

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

[22]  Benoit Donnet,et al.  Topology Discovery Using an Address Prefix Based Stopping Rule , 2005, EUNICE.

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

[24]  B. Bollobás.  The evolution of random graphs , 1984 .

[25]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).