Paper published in a book (Scientific congresses and symposiums)
Increasing the Coverage of a Cooperative Internet Topology Discovery Algorithm
Donnet, Benoît; Huffaker, Bradley; Friedman, Timur et al.
2007In Proceedings IFIP/TC6 Networking
Peer reviewed
 

Files


Full Text
44790738.pdf
Author preprint (614.9 kB)
Download

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
Doubletree; topology discovery
Abstract :
[en] 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.
Disciplines :
Computer science
Author, co-author :
Donnet, Benoît  ;  Université Pierre et Marie Currie - Paris 6 - UPMC > Laboratoire d'Informatique Paris 6 - LiP6 > NPA
Huffaker, Bradley
Friedman, Timur
claffy, kc
Language :
English
Title :
Increasing the Coverage of a Cooperative Internet Topology Discovery Algorithm
Publication date :
May 2007
Event name :
Networking
Audience :
International
Main work title :
Proceedings IFIP/TC6 Networking
Peer reviewed :
Peer reviewed
Available on ORBi :
since 03 January 2012

Statistics


Number of views
33 (2 by ULiège)
Number of downloads
133 (1 by ULiège)

Scopus citations®
 
5
Scopus citations®
without self-citations
4

Bibliography


Similar publications



Contact ORBi