References of "IFIP, International Federation for Information Processing"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailTopology Discovery Using an Address Prefix Based Stopping Rule
Donnet, Benoît ULg; Friedman, Timur

in IFIP, International Federation for Information Processing (2006), 196

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 4 (0 ULg)