Article (Scientific journals)
Topology Discovery Using an Address Prefix Based Stopping Rule
Donnet, Benoît; Friedman, Timur
2006In IFIP International Federation for Information Processing, 196, p. 119-130
Peer reviewed
 

Files


Full Text
687-Ifip-Donnet.pdf
Author preprint (392.54 kB)
Download

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
Doubletree; topology discovery; CIDR
Abstract :
[en] Recently, a first step towards a highly distributed IP-level topology dis- covery tool has been made with the introduction of the Doubletree al- gorithm. Doubletree is an efficient cooperative algorithm that allows the discovery of a large portion of nodes and links in the network while strongly reducing probing redundancy on nodes and destinations as well as the amount of probes sent. In this paper, we propose to reduce more strongly the load on destinations and, more essentially, the communica- tion cost required for the cooperation by introducing a probing stopping rule based on CIDR address prefixes.
Disciplines :
Computer science
Author, co-author :
Donnet, Benoît  ;  Université Pierre et Marie Currie - Paris 6 - UPMC > Laboratoire d'Informatique Paris 6 - LiP6 > NPA
Friedman, Timur
Language :
English
Title :
Topology Discovery Using an Address Prefix Based Stopping Rule
Publication date :
2006
Journal title :
IFIP International Federation for Information Processing
ISSN :
1571-5736
eISSN :
1861-2288
Publisher :
Springer, Germany
Volume :
196
Pages :
119-130
Peer reviewed :
Peer reviewed
Available on ORBi :
since 03 January 2012

Statistics


Number of views
58 (0 by ULiège)
Number of downloads
179 (0 by ULiège)

Scopus citations®
 
1
Scopus citations®
without self-citations
1
OpenCitations
 
1

Bibliography


Similar publications



Contact ORBi