Evaluation of a Large-Scale Topology Discovery Algorithm - Archive ouverte HAL
Communication Dans Un Congrès Année : 2006

Evaluation of a Large-Scale Topology Discovery Algorithm

Benoit Donnet
  • Fonction : Auteur
Bradley Huffaker
  • Fonction : Auteur
Timur Friedman
Kc Claffy
  • Fonction : Auteur

Résumé

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 traceroute@home. We evaluate the performance of our implementation on the PlanetLab testbed and discuss a large-scale monitoring infrastructure that could benefit of Doubletree.

Dates et versions

hal-01351648 , version 1 (04-08-2016)

Identifiants

Citer

Benoit Donnet, Bradley Huffaker, Timur Friedman, Kc Claffy. Evaluation of a Large-Scale Topology Discovery Algorithm. Proc. IP Operation and Management Workshop (IPOM), Oct 2006, Dublin, Ireland. pp.193-204, ⟨10.1007/11908852_17⟩. ⟨hal-01351648⟩
80 Consultations
0 Téléchargements

Altmetric

Partager

More