Brief Announcement: Routing the Internet with very few entries

Cyril Gavoille (1) , Christian Glacet (1) , Nicolas Hanusse (1) , David Ilcinkas (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

This paper investigates compact routing schemes that are very efficient with respect to the memory used to store routing tables in internet-like graphs. We propose a new compact name-independent routing scheme whose theoretically proven average memory per node is upper-bounded by $n^{\gamma}$, with constant $\gamma < 1/2$, while the maximum memory of any node is bounded by $\sqrt{n}$ and the maximum stretch of any route is bounded by~$5$. These bounds are given for the Random Power Low Graphs (RPLG) and hold with high probability. Moreover, we experimentally show that our scheme is very efficient in terms of stretch and memory in internet-like graphs (CAIDA and other maps). We complete this study by comparing our analytic and experimental results to several compact routing schemes. In particular, we show that the average memory requirements is better by at least one order of magnitude than previous schemes for CAIDA maps on 16K nodes.

Mots clés: compact routing; routing scheme; power-law graphs

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas. Brief Announcement: Routing the Internet with very few entries. PODC 2015, Jul 2015, Donostia-San Sebastián, Spain. pp.33-35, ⟨10.1145/2767386.2767449⟩. ⟨hal-01195778⟩