On the Resiliency of Static Forwarding Tables

Tutkimustuotos: Lehtiartikkelivertaisarvioitu

Tutkijat

  • Marco Chiesa
  • Ilya Nikolaevskiy
  • Slobodan Mitrović
  • Andrei Gurtov
  • Aleksander Madry
  • Michael Shapira
  • Scott Shenker

Organisaatiot

  • Universite Catholique de Louvain
  • Swiss Federal Institute of Technology Lausanne
  • Linköping University
  • St. Petersburg National Research University of Information Technologies, Mechanics and Optics (ITMO)
  • Massachusetts Institute of Technology
  • Hebrew University of Jerusalem
  • University of California at Berkeley

Kuvaus

Fast reroute and other forms of immediate failover have long been used to recover from certain classes of failures without invoking the network control plane. While the set of such techniques is growing, the level of resiliency to failures that this approach can provide is not adequately understood. In this paper, we embarked upon a systematic algorithmic study of the resiliency of forwarding tables in a variety of models (i.e., deterministic/probabilistic routing, with packet-header-rewriting, with packet-duplication). Our results show that the resiliency of a routing scheme depends on the “connectivity” k of a network, i.e., the minimum number of link deletions that partition a network. We complement our theoretical result with extensive simulations. We show that resiliency to four simultaneous link failures, with limited path stretch, can be achieved without any packet modification/duplication or randomization. Furthermore, our routing schemes provide resiliency against k - 1 failures, with limited path stretch, by storing log(k) bits in the packet header, with limited packet duplication, or with randomized forwarding technique.

Yksityiskohdat

AlkuperäiskieliEnglanti
Sivut1133-1146
Sivumäärä14
JulkaisuIEEE-ACM TRANSACTIONS ON NETWORKING
Vuosikerta25
Numero2
TilaJulkaistu - 17 huhtikuuta 2017
OKM-julkaisutyyppiA1 Julkaistu artikkeli, soviteltu

ID: 9909790