liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On the Resiliency of Static Forwarding Tables
Catholic University of Louvain, Belgium.
Aalto University, Finland.
Ecole Polytech Federal Lausanne, Switzerland.
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering. ITMO University, Russia.ORCID iD: 0000-0002-9829-9287
Show others and affiliations
2017 (English)In: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 25, no 2, 1133-1146 p.Article in journal (Refereed) Published
Abstract [en]

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-headerrewriting, 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.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2017. Vol. 25, no 2, 1133-1146 p.
Keyword [en]
Computers and information processing; computer networks; computer network management; disruption tolerant networking; reliability; robustness
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:liu:diva-137614DOI: 10.1109/TNET.2016.2619398ISI: 000399766100035OAI: oai:DiVA.org:liu-137614DiVA: diva2:1097350
Note

Funding Agencies|European Union [644960]; Swiss National Science Foundation [P1ELP2 161820]

Available from: 2017-05-22 Created: 2017-05-22 Last updated: 2017-05-22

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Gurtov, Andrei
By organisation
Database and information techniquesFaculty of Science & Engineering
In the same journal
IEEE/ACM Transactions on Networking
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 70 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf