SwePub
Sök i LIBRIS databas

  Extended search

id:"swepub:oai:DiVA.org:kth-222321"
 

Search: id:"swepub:oai:DiVA.org:kth-222321" > On the Resiliency o...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist
  • Chiesa, Marco,1987-Université catholique du Louvain, Belgium,Catholic University of Louvain, Belgium (author)

On the Resiliency of Static Forwarding Tables

  • Article/chapterEnglish2017

Publisher, publication year, extent ...

  • Institute of Electrical and Electronics Engineers (IEEE),2017
  • printrdacarrier

Numbers

  • LIBRIS-ID:oai:DiVA.org:kth-222321
  • https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-222321URI
  • https://doi.org/10.1109/TNET.2016.2619398DOI
  • https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-137614URI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:ref swepub-contenttype
  • Subject category:art swepub-publicationtype

Notes

  • QC 20180207
  • Funding Agencies|European Union [644960]; Swiss National Science Foundation [P1ELP2 161820]
  • 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.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Nikolaevskiy, I.Aalto University, Finland (author)
  • Mitrovic, S.Ecole Polytech Federal Lausanne, Switzerland (author)
  • Gurtov, AndreiLinköpings universitet,Databas och informationsteknik,Tekniska fakulteten,ITMO University, Russia(Swepub:liu)andgu38 (author)
  • Madry, A.MIT, MA 02139 USA (author)
  • Schapira, M.Hebrew University of Jerusalem, Israel (author)
  • Shenker, S.University of Calif Berkeley, CA 94720 USA; Int Comp Science Institute, CA 94704 USA (author)
  • Université catholique du Louvain, BelgiumCatholic University of Louvain, Belgium (creator_code:org_t)

Related titles

  • In:IEEE/ACM Transactions on Networking: Institute of Electrical and Electronics Engineers (IEEE)25:2, s. 1133-11461063-66921558-2566

Internet link

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view