Increasing the Coverage of a Cooperative Internet Topology Discovery Algorithm - Archive ouverte HAL
Communication Dans Un Congrès Année : 2007

Increasing the Coverage of a Cooperative Internet Topology Discovery Algorithm

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

Résumé

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.

Dates et versions

hal-01311858 , version 1 (04-05-2016)

Identifiants

Citer

Benoit Donnet, Bradley Huffaker, Timur Friedman, Kc Claffy. Increasing the Coverage of a Cooperative Internet Topology Discovery Algorithm. Proc. IFIP/TC6 Networking, May 2007, Atlanta, GA, United States. pp.738-748, ⟨10.1007/978-3-540-72606-7_63⟩. ⟨hal-01311858⟩
71 Consultations
0 Téléchargements

Altmetric

Partager

More