Topology Discovery Using an Address Prefix Based Stopping Rule - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Topology Discovery Using an Address Prefix Based Stopping Rule

Benoit Donnet
  • Fonction : Auteur
  • PersonId : 836448
Timur Friedman

Résumé

Recently, a first step towards a highly distributed IP-level topology discovery tool has been made with the introduction of the Doubletree algorithm. 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 communication cost required for the cooperation by introducing a probing stopping rule based on CIDR address prefixes.

Dates et versions

hal-01486941 , version 1 (10-03-2017)

Identifiants

Citer

Benoit Donnet, Timur Friedman. Topology Discovery Using an Address Prefix Based Stopping Rule. EUNICE 2005 - Networks and Applications Towards a Ubiquitously Connected World, 2005, Madrid, Spain. pp.119-130, ⟨10.1007/0-387-31170-X_9⟩. ⟨hal-01486941⟩
67 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More