A CIDR Prefix Stopping Rule for Topology Discovery - Université Pierre et Marie Curie Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

A CIDR Prefix Stopping Rule for Topology Discovery

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 stop rule based on CIDR address prefixes.
Fichier non déposé

Dates et versions

hal-01487820 , version 1 (13-03-2017)

Identifiants

  • HAL Id : hal-01487820 , version 1

Citer

Benoit Donnet, Timur Friedman. A CIDR Prefix Stopping Rule for Topology Discovery. Algotel 2005 - 7èmes Rencontres Francophones sur les aspects Algorithmiques des Télécommunications, May 2005, Presqu'île de Giens, France. pp.39-42. ⟨hal-01487820⟩
54 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More