liu.seSök publikationer i DiVA
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • 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öpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten. ITMO University, Russia.ORCID-id: 0000-0002-9829-9287
Visa övriga samt affilieringar
2017 (Engelska)Ingår i: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 25, nr 2, s. 1133-1146Artikel i tidskrift (Refereegranskat) 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.

Ort, förlag, år, upplaga, sidor
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2017. Vol. 25, nr 2, s. 1133-1146
Nyckelord [en]
Computers and information processing; computer networks; computer network management; disruption tolerant networking; reliability; robustness
Nationell ämneskategori
Kommunikationssystem
Identifikatorer
URN: urn:nbn:se:liu:diva-137614DOI: 10.1109/TNET.2016.2619398ISI: 000399766100035OAI: oai:DiVA.org:liu-137614DiVA, id: diva2:1097350
Anmärkning

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

Tillgänglig från: 2017-05-22 Skapad: 2017-05-22 Senast uppdaterad: 2017-05-22

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Sök vidare i DiVA

Av författaren/redaktören
Gurtov, Andrei
Av organisationen
Databas och informationsteknikTekniska fakulteten
I samma tidskrift
IEEE/ACM Transactions on Networking
Kommunikationssystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 115 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf