Implementation and Deployment of a Distributed Network Topology Discovery Algorithm
<|reference_start|>Implementation and Deployment of a Distributed Network 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 report 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 report presents our open-source and freely downloadable implementation of Doubletree in a tool we call traceroute@home. We describe the deployment and validation of traceroute@home on the PlanetLab testbed and we report on the lessons learned from this experience. We discuss how traceroute@home can be developed further and discuss ideas for future improvements.<|reference_end|>
@article{donnet2006implementation,
    title={Implementation and Deployment of a Distributed Network Topology
  Discovery Algorithm},
    author={Benoit Donnet, Bradley Huffaker, Timur Friedman, kc claffy},
    journal={arXiv preprint arXiv:cs/0603062},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0603062},
    primaryClass={cs.NI}
}