Reference : Topology Discovery Using an Address Prefix Based Stopping Rule
Scientific journals : Article
Engineering, computing & technology : Computer science
Topology Discovery Using an Address Prefix Based Stopping Rule
Donnet, Benoît mailto [Université Pierre et Marie Currie - Paris 6 - UPMC > Laboratoire d'Informatique Paris 6 - LiP6 > NPA > >]
Friedman, Timur [> > > >]
IFIP, International Federation for Information Processing
[en] Doubletree ; topology discovery ; CIDR
[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.

File(s) associated to this reference

Fulltext file(s):

Open access
687-Ifip-Donnet.pdfAuthor preprint383.34 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.