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
TI-MFA: Keep Calm and Reroute Segments Fast
Univ Vienna, Vienna, Austria..
Univ Vienna, Vienna, Austria..
KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Network Systems Laboratory (NS Lab).ORCID iD: 0000-0002-9675-9729
Univ Vienna, Vienna, Austria..
2018 (English)In: IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), IEEE , 2018, p. 415-420Conference paper, Published paper (Refereed)
Abstract [en]

Segment Routing (SR) promises to provide scalable and fine-grained traffic engineering. However, little is known today on how to implement resilient routing in SR, i.e., routes which tolerate one or even multiple failures. This paper initiates the theoretical study of static fast failover mechanisms which do not depend on reconvergence and hence support a very fast reaction to failures. We introduce formal models and identify fundamental tradeoffs on what can and cannot be achieved in terms of static resilient routing. In particular, we identify an inherent price in terms of performance if routing paths need to be resilient, even in the absence of failures. Our main contribution is a first algorithm which is resilient even to multiple failures and which comes with provable resiliency and performance guarantees. We complement our formal analysis with simulations on real topologies, which show the benefits of our approach over existing algorithms.

Place, publisher, year, edition, pages
IEEE , 2018. p. 415-420
Series
IEEE Conference on Computer Communications Workshops, ISSN 2159-4228
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:kth:diva-239837DOI: 10.1109/INFCOMW.2018.8406885ISI: 000450157700133Scopus ID: 2-s2.0-85050661808ISBN: 978-1-5386-5979-3 (print)OAI: oai:DiVA.org:kth-239837DiVA, id: diva2:1275805
Conference
IEEE Conference on Computer Communications (IEEE INFOCOM), APR 15-19, 2018, Honolulu, HI
Note

QC 20190107

Available from: 2019-01-07 Created: 2019-01-07 Last updated: 2019-01-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Chiesa, Marco

Search in DiVA

By author/editor
Chiesa, Marco
By organisation
Network Systems Laboratory (NS Lab)
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 102 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