Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
TI-MFA: Keep calm and reroute segments fast
KTH, Skolan för elektroteknik och datavetenskap (EECS), Kommunikationssystem, CoS, Network Systems Laboratory (NS Lab).ORCID-id: 0000-0002-9675-9729
2018 (Engelska)Ingår i: INFOCOM 2018 - IEEE Conference on Computer Communications Workshops, Institute of Electrical and Electronics Engineers Inc. , 2018, s. 415-420Konferensbidrag, Publicerat paper (Refereegranskat)
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. © 2018 IEEE.

Ort, förlag, år, upplaga, sidor
Institute of Electrical and Electronics Engineers Inc. , 2018. s. 415-420
Nyckelord [en]
Highway engineering, Failover mechanism, Fast reaction, Formal analysis, Multiple failures, Performance guarantees, Re convergences, Theoretical study, Traffic Engineering, Formal methods
Nationell ämneskategori
Kommunikationssystem
Identifikatorer
URN: urn:nbn:se:kth:diva-238087DOI: 10.1109/INFCOMW.2018.8406885Scopus ID: 2-s2.0-85050661808ISBN: 9781538659793 (tryckt)OAI: oai:DiVA.org:kth-238087DiVA, id: diva2:1277927
Konferens
2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018, 15 April 2018 through 19 April 2018
Anmärkning

Conference code: 137864; Export Date: 30 October 2018; Conference Paper

QC 20190111

Tillgänglig från: 2019-01-11 Skapad: 2019-01-11 Senast uppdaterad: 2019-01-11Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Chiesa, Marco

Sök vidare i DiVA

Av författaren/redaktören
Chiesa, Marco
Av organisationen
Network Systems Laboratory (NS Lab)
Kommunikationssystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

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

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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