Skip to Content
[CAIDA - Center for Applied Internet Data Analysis logo]
Center for Applied Internet Data Analysis
www.caida.org > publications : papers : 2006 : recursive_approach
Approche Récursive d'Etiquetage des Chemins Alternatifs au Niveau IP
B. Donnet, B. Huffaker, T. Friedman, and k. claffy, "Approche Récursive d'Etiquetage des Chemins Alternatifs au Niveau IP", in Colloque Francophone d'Ingénierie des Protocoles (CFIP), Nov 2006.

Note: This paper is only available in French.

|   View full paper:    PDF    |  Citation:    BibTeX   |

Approche Récursive d'Etiquetage des Chemins Alternatifs au Niveau IP

Benoit Donnet1, 2
Bradley Huffaker1
Timur Friedman2
kc claffy1
1

CAIDA, San Diego Supercomputer Center, University of California San Diego

2

Laboratoire LiP6/CNRS
Université Pierre & Marie Curie

A diamond refers to the existence of several alternative paths between two points in the network. This notion plays an important role in traffic engineering where it is needed, for instance, to balance the traffic load between several paths. These diamonds might be found at the AS level or the IP level. This paper is interested in the IP level and proposes a recursive labelling method for diamonds, RLPA. In this paper, we show, on a subset of skitter data, that diamonds are mainly composed of a single intermediate node, have two edges, are basically symmetrical and are located between 10 and 15 hops from the traceroute source.

Keywords: measurement methodology, software/tools, topology
  Last Modified: Wed Oct-11-2017 17:03:53 PDT
  Page URL: http://www.caida.org/publications/papers/2006/recursive_approach/index.xml