Document Open Access Logo

Fast Rerouting Against Dynamic Failures: 2-Resilience via Ear-Decomposition and Planarity

Authors Wenkai Dai , Klaus-Tycho Foerster , Stefan Schmid

PDF

File

Thumbnail PDF
PDF
LIPIcs.OPODIS.2025.20.pdf
  • Filesize: 1.08 MB
  • 20 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Networks → Routing protocols
  • Computer systems organization → Dependable and fault-tolerant systems and networks
Keywords
  • Resilience
  • Local Failover
  • Routing
  • Dynamic Link Failures
  • Link Flapping

Metrics

Abstract

Modern communication networks employ local fast failover mechanisms in the data plane, swiftly reacting to link failures through pre-installed rerouting rules. This paper investigates resilient routing schemes that guarantee packet delivery under up to k link failures, provided the source and destination remain connected in the degraded network. While prior theoretical studies have mainly addressed static failures, where multiple links fail simultaneously and permanently, real networks often experience dynamic failures, such as transient link flapping caused by short-lived faults.
We study the limits of basic and source-matched failover routing with packet-header rewriting against dynamic failures in general graphs. In basic routing, forwarding depends only on active links, incoming ports, and the destination, whereas source-matched routing additionally incorporates the source, requiring more memory (and logic) at the router. The 2-resilient source-matched routing for static failures is shown to fail under permanent but non-simultaneous failures. Moreover, even with source matching, we prove that in planar graphs k ≥ 2 resilience is impossible without bit rewriting, and in general graphs, perfect k-resilience is unachievable by only rewriting O(log k) bits. 
For planar graphs, we introduce ear-decomposition into basic routing and develop novel local rerouting mechanisms that tolerate dynamic failures. These yield tight 2-resilient basic routing by rewriting only one or two bits, closing the gap between lower bounds and practical routing scheme.

Cite As Get BibTex

Wenkai Dai, Klaus-Tycho Foerster, and Stefan Schmid. Fast Rerouting Against Dynamic Failures: 2-Resilience via Ear-Decomposition and Planarity. In 29th International Conference on Principles of Distributed Systems (OPODIS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 361, pp. 20:1-20:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.OPODIS.2025.20

Author Details

Wenkai Dai
  • Faculty of Computer Science, TU Berlin, Germany
  • UniVie Doctoral School Computer Science DoCS, University of Vienna, Austria
Klaus-Tycho Foerster
  • Department of Computer Science, Technical University of Dortmund, Germany
Stefan Schmid
  • TU Berlin, Germany
  • Fraunhofer SIT, Darmstadt, Germany

Funding

German Research Foundation (DFG) project ReNO, Schwerpunktprogramm: Resilienz in Vernetzten Welten - Beherrschen von Fehlern, Überlast, Angriffen und dem Unbekannten (SPP 2378), 2023-2027.

References

  1. Mohammad Alizadeh et al. Data center TCP (DCTCP). In SIGCOMM. ACM, 2010. URL: https://doi.org/10.1145/1851182.1851192.
  2. John Boyer and Wendy Myrvold. On the cutting edge: Simplified o(n) planarity by edge addition. Journal of Graph Algorithms and Applications, 8(3):241-273, January 2004. URL: https://doi.org/10.7155/jgaa.00091.
  3. Marco Chiesa et al. On the resiliency of randomized routing against multiple edge failures. In ICALP, 2016. URL: https://doi.org/10.4230/LIPIcs.ICALP.2016.134.
  4. Marco Chiesa et al. The quest for resilient (static) forwarding tables. In INFOCOM. IEEE, 2016. URL: https://doi.org/10.1109/INFOCOM.2016.7524552.
  5. Marco Chiesa et al. On the resiliency of static forwarding tables. IEEE/ACM Trans. Netw., 25(2):1133-1146, 2017. URL: https://doi.org/10.1109/TNET.2016.2619398.
  6. Marco Chiesa et al. Fast reroute on programmable switches. IEEE/ACM Trans. Netw., 29(2):637-650, 2021. URL: https://doi.org/10.1109/TNET.2020.3045293.
  7. Marco Chiesa et al. A survey of fast-recovery mechanisms in packet-switched networks. IEEE Commun. Surv. Tutorials, 23(2):1253-1301, 2021. URL: https://doi.org/10.1109/COMST.2021.3063980.
  8. Wenkai Dai et al. A tight characterization of fast failover routing: Resiliency to two link failures is possible. In SPAA, pages 153-163. ACM, 2023. URL: https://doi.org/10.1145/3558481.3591080.
  9. Wenkai Dai et al. On the resilience of fast failover routing against dynamic link failures, 2024. URL: https://doi.org/10.48550/arXiv.2410.02021.
  10. Wenkai Dai et al. On the resilience of fast failover routing against dynamic link failures. In IFIP Networking, 2025. Google Scholar
  11. Fabien de Montgolfier et al. Treewidth and hyperbolicity of the internet. In NCA, pages 25-32. IEEE Computer Society, 2011. URL: https://doi.org/10.1109/NCA.2011.11.
  12. Reinhard Diestel. Graph Theory, 4th Edition, volume 173 of Graduate texts in mathematics. Springer, 2012. Google Scholar
  13. Joan Feigenbaum et al. Brief announcement: On the resilience of routing tables. In PODC. ACM, 2012. URL: https://doi.org/10.1145/2332432.2332478.
  14. Klaus-Tycho Foerster et al. CASA: congestion and stretch aware static fast rerouting. In INFOCOM. IEEE, 2019. URL: https://doi.org/10.1109/INFOCOM.2019.8737438.
  15. Klaus-Tycho Foerster et al. Brief announcement: What can(not) be perfectly rerouted locally. In DISC, pages 46:1-46:3, 2020. URL: https://doi.org/10.4230/LIPIcs.DISC.2020.46.
  16. Klaus-Tycho Foerster et al. Grafting arborescences for extra resilience of fast rerouting schemes. In INFOCOM, pages 1-10. IEEE, 2021. URL: https://doi.org/10.1109/INFOCOM42981.2021.9488782.
  17. Klaus-Tycho Foerster et al. On the feasibility of perfect resilience with local fast failover. In Symposium on Algorithmic Principles of Computer Systems (APOCS), 2021. URL: https://doi.org/10.1137/1.9781611976489.5.
  18. Phillipa Gill et al. Understanding network failures in data centers: measurement, analysis, and implications. In SIGCOMM. ACM, 2011. URL: https://doi.org/10.1145/2018436.2018477.
  19. S. Hannenhalli et al. A distributed algorithm for ear decomposition. In Proceedings of ICCI'93: 5th International Conference on Computing and Information, pages 180-184, 1993. URL: https://doi.org/10.1109/ICCI.1993.315382.
  20. John Hopcroft and Robert Tarjan. Efficient planarity testing. J. ACM, 21(4):549-568, October 1974. URL: https://doi.org/10.1145/321850.321852.
  21. Louis Ibarra and Dana Richards. Efficient parallel graph algorithms based on open ear decomposition. Parallel Computing, 19(8):873-886, 1993. URL: https://doi.org/10.1016/0167-8191(93)90071-R.
  22. Junda Liu et al. Ensuring connectivity via data plane mechanisms. In NSDI, 2013. URL: https://www.usenix.org/conference/nsdi13/technical-sessions/presentation/liu_junda.
  23. L. Lovasz. Computing ears and branchings in parallel. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pages 464-467, 1985. URL: https://doi.org/10.1109/SFCS.1985.16.
  24. Athina Markopoulou et al. Characterization of failures in an operational ip backbone network. IEEE/ACM transactions on Networking, 16(4):749-762, 2008. URL: https://doi.org/10.1145/1453698.1453699.
  25. H. E. Robbins. A theorem on graphs, with an application to a problem of traffic control. The American Mathematical Monthly, 46(5):281-283, 1939. URL: https://doi.org/10.2307/2303897.
  26. Jens M. Schmidt. A simple test on 2-vertex- and 2-edge-connectivity. Information Processing Letters, 113(7):241-244, 2013. URL: https://doi.org/10.1016/j.ipl.2013.01.016.
  27. Aman Shaikh et al. A case study of ospf behavior in a large enterprise network. In Proceedings of the 2nd ACM SIGCOMM Workshop on Internet Measurment, IMW '02, pages 217-230. ACM, 2002. URL: https://doi.org/10.1145/637201.637236.
  28. Y. H. Tsin. On finding an ear decomposition of an undirected graph distributively. Information Processing Letters, 91(3):147-153, 2004. URL: https://doi.org/10.1016/j.ipl.2004.04.004.
  29. Daniel Turner et al. California fault lines: understanding the causes and impact of network failures. In SIGCOMM. ACM, 2010. URL: https://doi.org/10.1145/1851182.1851220.
  30. Balajee Vamanan et al. Deadline-aware datacenter tcp (D2TCP). In SIGCOMM. ACM, 2012. URL: https://doi.org/10.1145/2342356.2342388.
  31. Erik van den Akker and Klaus-Tycho Foerster. Short paper: Towards 2-resilient local failover in destination-based routing. In ALGOCLOUD. Springer, 2024. URL: https://doi.org/10.1007/978-3-031-94677-6_2.
  32. David Watson et al. Experiences with monitoring ospf on a regional service provider network. In Proceedings of the 23rd International Conference on Distributed Computing Systems, ICDCS '03, page 204, USA, 2003. IEEE Computer Society. URL: https://doi.org/10.1109/ICDCS.2003.1203467.
  33. Douglas B. West. Introduction to Graph Theory. Prentice Hall, 2 edition, September 2000. Google Scholar
  34. Baohua Yang et al. Keep forwarding: Towards k-link failure resilient routing. In INFOCOM. IEEE, 2014. URL: https://doi.org/10.1109/INFOCOM.2014.6848098.
  35. David Zats et al. Detail: reducing the flow completion time tail in datacenter networks. In SIGCOMM. ACM, 2012. URL: https://doi.org/10.1145/2342356.2342390.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact