Increasing the coverage of a cooperative internet topology discovery algorithm

Authors:
Benoit Donnet;Bradley Huffaker;Timur Friedman;K. C. Claffy
Affiliations:
Université Catholique de Louvain, CSE Department, Belgium;Caida, San Diego Supercomputer Center;Université Pierre & Marie Curie, Laboratoire LIP6, CNRS, France;Caida, San Diego Supercomputer Center
Venue:
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Year:
2007

Citing 7
Cited 2

Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator

ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Topology Discovery by Active Probing

SAINT-W '02 Proceedings of the 2002 Symposium on Applications and the Internet (SAINT) Workshops
DIMES: let the internet measure itself

ACM SIGCOMM Computer Communication Review
Avoiding traceroute anomalies with Paris traceroute

Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Mapping and visualizing the internet

ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
The NLAMR network analysis infrastructure

IEEE Communications Magazine
Deployment of an Algorithm for Large-Scale Topology Discovery

IEEE Journal on Selected Areas in Communications

Analyzing Router Responsiveness to Active Measurement Probes

PAM '09 Proceedings of the 10th International Conference on Passive and Active Network Measurement
Internet topology discovery

DataTraffic Monitoring and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, Doubletree, a cooperative algorithm for large-scale topology discovery at the IP level, was introduced. Compared to classic probing systems, Doubletree discovers almost as many nodes and links while strongly reducing the quantity of probes sent. This paper examines the problem of the nodes and links missed by Doubletree. In particular, this paper's first contribution is to carefully describe properties of the nodes and links that Doubletree fails to discover. We explain incomplete coverage as a consequence of the way Doubletree models the network: a tree-like structure of routes. But routes do not strictly form trees, due to load balancing and routing changes. This paper's second contribution is the Windowed Doubletree algorithm, which increases Doubletree's coverage up to 16% without increasing its load. Compared to classic Doubletree, Windowed Doubletree does not start probing at a fixed hop distance from each monitor, but randomly picks a value from a range of possible values.