A Tight Characterization of Fast Failover Routing: Resiliency to Two Link Failures is Possible-Reference-Cited by-同舟云学术

A Tight Characterization of Fast Failover Routing: Resiliency to Two Link Failures is Possible

Published:2023-06-17 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Dai Wenkai¹^ORCID,Foerster Klaus-Tycho²^ORCID,Schmid Stefan³^ORCID

Affiliation:

1. University of Vienna, Vienna, Austria

2. TU Dortmund, Dortmund, Germany

3. TU Berlin and University of Vienna, Berlin and Vienna, Germany

Funder

Vienna Science and Technology Fund

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3558481.3591080

Reference41 articles.

1. Mohammad Alizadeh Albert G. Greenberg David A. Maltz Jitendra Padhye Parveen Patel Balaji Prabhakar Sudipta Sengupta and Murari Sridharan. 2010. Data center TCP (DCTCP). In SIGCOMM. ACM. Mohammad Alizadeh Albert G. Greenberg David A. Maltz Jitendra Padhye Parveen Patel Balaji Prabhakar Sudipta Sengupta and Murari Sridharan. 2010. Data center TCP (DCTCP). In SIGCOMM. ACM.

2. Anand Bhalgat Ramesh Hariharan Telikepalli Kavitha and Debmalya Panigrahi. 2008. Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. In SODA. Anand Bhalgat Ramesh Hariharan Telikepalli Kavitha and Debmalya Panigrahi. 2008. Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. In SODA.

3. Prosenjit Bose Pat Morin Ivan Stojmenovic and Jorge Urrutia. 1999. Routing with guaranteed delivery in ad hoc wireless networks. In DIAL-M. ACM 48--55. Prosenjit Bose Pat Morin Ivan Stojmenovic and Jorge Urrutia. 1999. Routing with guaranteed delivery in ad hoc wireless networks. In DIAL-M. ACM 48--55.

4. A simplified algorithm computing all s-t bridges and articulation points

5. Marco Chiesa Andrei V. Gurtov Aleksander Madry Slobodan Mitrovic Ilya Nikolaevskiy Michael Schapira and Scott Shenker. 2016. On the Resiliency of Randomized Routing Against Multiple Edge Failures. In ICALP. Marco Chiesa Andrei V. Gurtov Aleksander Madry Slobodan Mitrovic Ilya Nikolaevskiy Michael Schapira and Scott Shenker. 2016. On the Resiliency of Randomized Routing Against Multiple Edge Failures. In ICALP.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SyRep: Efficient Synthesis and Repair of Fast Re-Route Forwarding Tables for Resilient Networks;2024 54th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN);2024-06-24

2. SyPer: Synthesis of Perfectly Resilient Local Fast Re-Routing Rules for Highly Dependable Networks;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20