{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:10:24Z","timestamp":1768345824332,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Wiener Wissenschafts-, Forschungs- und Technologiefonds WWTF","award":["ICT19-045,"],"award-info":[{"award-number":["ICT19-045,"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,12,13]]},"DOI":"10.1145\/3493425.3502747","type":"proceedings-article","created":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T11:11:51Z","timestamp":1642504311000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Improving the Resilience of Fast Failover Routing"],"prefix":"10.1145","author":[{"given":"Oliver","family":"Schweiger","sequence":"first","affiliation":[{"name":"University of Vienna, Austria"}]},{"given":"Klaus-Tycho","family":"Foerster","sequence":"additional","affiliation":[{"name":"TU Dortmund, Germany"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"TU Berlin, University of Vienna, Fraunhofer SIT, Germany and Austria"}]}],"member":"320","published-online":{"date-parts":[[2022,1,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2232111"},{"key":"e_1_3_2_2_2_1","volume-title":"Local Fast Rerouting with Low Congestion: A Randomized Approach","author":"Bankhamer Gregor","unstructured":"Gregor Bankhamer , Robert Els\u00e4sser , and Stefan Schmid . 2019. Local Fast Rerouting with Low Congestion: A Randomized Approach . In ICNP. IEEE , 1--11. Gregor Bankhamer, Robert Els\u00e4sser, and Stefan Schmid. 2019. Local Fast Rerouting with Low Congestion: A Randomized Approach. In ICNP. IEEE, 1--11."},{"key":"e_1_3_2_2_3_1","unstructured":"Gregor Bankhamer Robert Els\u00e4sser and Stefan Schmid. 2021. Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion. In DISC (LIPIcs).  Gregor Bankhamer Robert Els\u00e4sser and Stefan Schmid. 2021. Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion. In DISC (LIPIcs)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Michael Borokhovich Liron Schiff and Stefan Schmid. 2014. Provable data plane connectivity with local fast failover: introducing openflow graph algorithms. In HotSDN. ACM 121--126.  Michael Borokhovich Liron Schiff and Stefan Schmid. 2014. Provable data plane connectivity with local fast failover: introducing openflow graph algorithms. In HotSDN. ACM 121--126.","DOI":"10.1145\/2620728.2620746"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Costas Busch Srikanth Surapaneni and Srikanta Tirthapura. 2003. Analysis of link reversal routing algorithms for mobile ad hoc networks. In SPAA. ACM 210--219.  Costas Busch Srikanth Surapaneni and Srikanta Tirthapura. 2003. Analysis of link reversal routing algorithms for mobile ad hoc networks. In SPAA. ACM 210--219.","DOI":"10.1145\/777412.777446"},{"key":"e_1_3_2_2_6_1","first-page":"1","article-title":"On the Resiliency of Randomized Routing Against Multiple Edge Failures. In ICALP (LIPIcs, Vol. 55)","volume":"134","author":"Chiesa Marco","year":"2016","unstructured":"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 (LIPIcs, Vol. 55) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 134 : 1 -- 134 :15. 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 (LIPIcs, Vol. 55). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 134:1--134:15.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_2_7_1","first-page":"1","article-title":"On the Resiliency of Randomized Routing Against Multiple Edge Failures","volume":"134","author":"Chiesa Marco","year":"2016","unstructured":"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. 134 : 1 -- 134 :15. 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. 134:1--134:15.","journal-title":"ICALP."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3063980"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2619398"},{"key":"e_1_3_2_2_10_1","volume-title":"Exploring the Limits of Static Failover Routing. CoRR abs\/1409.0034.v4","author":"Chiesa Marco","year":"2016","unstructured":"Marco Chiesa , Ilya Nikolaevskiy , Aurojit Panda , Andrei V. Gurtov , Michael Schapira , and Scott Shenker . 2016. Exploring the Limits of Static Failover Routing. CoRR abs\/1409.0034.v4 ( 2016 ). Marco Chiesa, Ilya Nikolaevskiy, Aurojit Panda, Andrei V. Gurtov, Michael Schapira, and Scott Shenker. 2016. Exploring the Limits of Static Failover Routing. CoRR abs\/1409.0034.v4 (2016)."},{"key":"e_1_3_2_2_11_1","unstructured":"Dariusz Dereniowski Adrian Kosowski Dominik Pajak and Przemyslaw Uznanski. 2014. Bounds on the Cover Time of Parallel Rotor Walks. In STACS. 263--275.  Dariusz Dereniowski Adrian Kosowski Dominik Pajak and Przemyslaw Uznanski. 2014. Bounds on the Cover Time of Parallel Rotor Walks. In STACS. 263--275."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_34"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0269-x"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2516442"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On Random Graphs I","volume":"6","author":"Erd\u00f6s P","year":"1959","unstructured":"P Erd\u00f6s and A R\u00e9nyi . 1959 . On Random Graphs I . Publicationes Mathematicae Debrecen 6 (1959), 290 -- 297 . P Erd\u00f6s and A R\u00e9nyi. 1959. On Random Graphs I. Publicationes Mathematicae Debrecen 6 (1959), 290--297.","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Joan Feigenbaum Brighten Godfrey Aurojit Panda Michael Schapira Scott Shenker and Ankit Singla. 2012. Brief announcement: on the resilience of routing tables. In PODC. ACM 237--238.  Joan Feigenbaum Brighten Godfrey Aurojit Panda Michael Schapira Scott Shenker and Ankit Singla. 2012. Brief announcement: on the resilience of routing tables. In PODC. ACM 237--238.","DOI":"10.1145\/2332432.2332478"},{"key":"e_1_3_2_2_17_1","volume-title":"On the Feasibility of Perfect Resilience with Local Fast Failover","author":"Foerster Klaus-Tycho","unstructured":"Klaus-Tycho Foerster , Juho Hirvonen , Yvonne-Anne Pignolet , Stefan Schmid , and Gilles Tr\u00e9dan . 2021. On the Feasibility of Perfect Resilience with Local Fast Failover . In APOCS. SIAM , 55--69. Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, and Gilles Tr\u00e9dan. 2021. On the Feasibility of Perfect Resilience with Local Fast Failover. In APOCS. SIAM, 55--69."},{"key":"e_1_3_2_2_18_1","volume-title":"Bonsai: Efficient Fast Failover Routing Using Small Arborescences","author":"Foerster Klaus-Tycho","year":"2019","unstructured":"Klaus-Tycho Foerster , Andrzej Kamisinski , Yvonne-Anne Pignolet , Stefan Schmid , and Gilles Tr\u00e9dan . 2019 . Bonsai: Efficient Fast Failover Routing Using Small Arborescences . In DSN. IEEE , 276--288. Klaus-Tycho Foerster, Andrzej Kamisinski, Yvonne-Anne Pignolet, Stefan Schmid, and Gilles Tr\u00e9dan. 2019. Bonsai: Efficient Fast Failover Routing Using Small Arborescences. In DSN. IEEE, 276--288."},{"key":"e_1_3_2_2_19_1","volume-title":"Improved Fast Rerouting Using Postprocessing","author":"Foerster Klaus-Tycho","unstructured":"Klaus-Tycho Foerster , Andrzej Kamisinski , Yvonne-Anne Pignolet , Stefan Schmid , and Gilles Tr\u00e9dan . 2019. Improved Fast Rerouting Using Postprocessing . In SRDS. IEEE , 173--182. Klaus-Tycho Foerster, Andrzej Kamisinski, Yvonne-Anne Pignolet, Stefan Schmid, and Gilles Tr\u00e9dan. 2019. Improved Fast Rerouting Using Postprocessing. In SRDS. IEEE, 173--182."},{"key":"e_1_3_2_2_20_1","volume-title":"Grafting Arborescences for Extra Resilience of Fast Rerouting Schemes","author":"Foerster Klaus-Tycho","unstructured":"Klaus-Tycho Foerster , Andrzej Kamisinski , Yvonne-Anne Pignolet , Stefan Schmid , and Gilles Tr\u00e9dan . 2021. Grafting Arborescences for Extra Resilience of Fast Rerouting Schemes . In INFOCOM. IEEE , 1--10. Klaus-Tycho Foerster, Andrzej Kamisinski, Yvonne-Anne Pignolet, Stefan Schmid, and Gilles Tr\u00e9dan. 2021. Grafting Arborescences for Extra Resilience of Fast Rerouting Schemes. In INFOCOM. IEEE, 1--10."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2018.8406885"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3211852.3211858"},{"key":"e_1_3_2_2_23_1","volume-title":"CASA: Congestion and Stretch Aware Static Fast Rerouting","author":"Foerster Klaus-Tycho","year":"2019","unstructured":"Klaus-Tycho Foerster , Yvonne-Anne Pignolet , Stefan Schmid , and Gilles Tr\u00e9dan . 2019 . CASA: Congestion and Stretch Aware Static Fast Rerouting . In INFOCOM. IEEE , 469--477. Klaus-Tycho Foerster, Yvonne-Anne Pignolet, Stefan Schmid, and Gilles Tr\u00e9dan. 2019. CASA: Congestion and Stretch Aware Static Fast Rerouting. In INFOCOM. IEEE, 469--477."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706098"},{"key":"e_1_3_2_2_25_1","volume-title":"Proceedings of the 7th Python in Science Conference, Ga\u00ebl Varoquaux, Travis Vaught, and Jarrod Millman (Eds.). Pasadena, CA USA, 11 - 15","author":"Hagberg Aric A.","unstructured":"Aric A. Hagberg , Daniel A. Schult , and Pieter J. Swart . 2008. Exploring Network Structure, Dynamics, and Function using NetworkX . In Proceedings of the 7th Python in Science Conference, Ga\u00ebl Varoquaux, Travis Vaught, and Jarrod Millman (Eds.). Pasadena, CA USA, 11 - 15 . Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. 2008. Exploring Network Structure, Dynamics, and Function using NetworkX. In Proceedings of the 7th Python in Science Conference, Ga\u00ebl Varoquaux, Travis Vaught, and Jarrod Millman (Eds.). Pasadena, CA USA, 11 - 15."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Simon Kassing Asaf Valadarsky Gal Shahaf Michael Schapira and Ankit Singla. 2017. Beyond fat-trees without antennae mirrors and disco-balls. In SIGCOMM. ACM 281--294.  Simon Kassing Asaf Valadarsky Gal Shahaf Michael Schapira and Ankit Singla. 2017. Beyond fat-trees without antennae mirrors and disco-balls. In SIGCOMM. ACM 281--294.","DOI":"10.1145\/3098822.3098836"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Karthik Lakshminarayanan Matthew Caesar Murali Rangan Tom Anderson Scott Shenker and Ion Stoica. 2007. Achieving convergence-free routing using failure-carrying packets. In SIGCOMM. ACM.  Karthik Lakshminarayanan Matthew Caesar Murali Rangan Tom Anderson Scott Shenker and Ion Stoica. 2007. Achieving convergence-free routing using failure-carrying packets. In SIGCOMM. ACM.","DOI":"10.1145\/1282380.1282408"},{"key":"e_1_3_2_2_29_1","volume-title":"Ensuring Connectivity via Data Plane Mechanisms","author":"Liu Junda","unstructured":"Junda Liu , Aurojit Panda , Ankit Singla , Brighten Godfrey , Michael Schapira , and Scott Shenker . 2013. Ensuring Connectivity via Data Plane Mechanisms . In NSDI. USENIX Association , 113--126. Junda Liu, Aurojit Panda, Ankit Singla, Brighten Godfrey, Michael Schapira, and Scott Shenker. 2013. Ensuring Connectivity via Data Plane Mechanisms. In NSDI. USENIX Association, 113--126."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2128879"},{"key":"e_1_3_2_2_31_1","first-page":"1","article-title":"Fast Reroute Extensions to RSVP-TE for LSP Tunnels","volume":"4090","author":"Pan Ping","year":"2005","unstructured":"Ping Pan , George Swallow , and Alia Atlas . 2005 . Fast Reroute Extensions to RSVP-TE for LSP Tunnels . RFC 4090 (2005), 1 -- 38 . Ping Pan, George Swallow, and Alia Atlas. 2005. Fast Reroute Extensions to RSVP-TE for LSP Tunnels. RFC 4090 (2005), 1--38.","journal-title":"RFC"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Jacek Rak and David Hutchison (Eds.). 2020. Guide to Disaster-Resilient Communication Networks. Springer.  Jacek Rak and David Hutchison (Eds.). 2020. Guide to Disaster-Resilient Communication Networks. Springer.","DOI":"10.1007\/978-3-030-44685-7"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3493425.3502747"},{"key":"e_1_3_2_2_34_1","volume-title":"Shortcutting Fast Failover Routes in the Data Plane. In ACM\/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).","author":"Shukla Apoorv","year":"2021","unstructured":"Apoorv Shukla and Klaus-Tycho Foerster . 2021 . Shortcutting Fast Failover Routes in the Data Plane. In ACM\/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS). Apoorv Shukla and Klaus-Tycho Foerster. 2021. Shortcutting Fast Failover Routes in the Data Plane. In ACM\/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)."},{"key":"e_1_3_2_2_35_1","volume-title":"Jellyfish: Networking Data Centers Randomly","author":"Singla Ankit","year":"2012","unstructured":"Ankit Singla , Chi-Yao Hong , Lucian Popa , and Philip Brighten Godfrey . 2012 . Jellyfish: Networking Data Centers Randomly . In NSDI. USENIX Association , 225--238. Ankit Singla, Chi-Yao Hong, Lucian Popa, and Philip Brighten Godfrey. 2012. Jellyfish: Networking Data Centers Randomly. In NSDI. USENIX Association, 225--238."},{"key":"e_1_3_2_2_36_1","first-page":"1","article-title":"Plinko: building provably resilient forwarding tables","volume":"26","author":"Stephens Brent E.","year":"2013","unstructured":"Brent E. Stephens , Alan L. Cox , and Scott Rixner . 2013 . Plinko: building provably resilient forwarding tables . In HotNets. ACM , 26 : 1 -- 26 :7. Brent E. Stephens, Alan L. Cox, and Scott Rixner. 2013. Plinko: building provably resilient forwarding tables. In HotNets. ACM, 26:1--26:7.","journal-title":"HotNets. ACM"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Brent E. Stephens Alan L. Cox and Scott Rixner. 2016. Scalable Multi-Failure Fast Failover via Forwarding Table Compression. In SOSR. ACM 9.  Brent E. Stephens Alan L. Cox and Scott Rixner. 2016. Scalable Multi-Failure Fast Failover via Forwarding Table Compression. In SOSR. ACM 9.","DOI":"10.1145\/2890955.2890957"},{"key":"e_1_3_2_2_38_1","volume-title":"List of shared risk link groups representing regional failures with limited size","author":"Tapolcai J\u00e1nos","unstructured":"J\u00e1nos Tapolcai , Lajos R\u00f3nyai , B\u00e1lazs Vass , and Laszlo Gyimothi . 2017. List of shared risk link groups representing regional failures with limited size . In INFOCOM. IEEE , 1--9. J\u00e1nos Tapolcai, Lajos R\u00f3nyai, B\u00e1lazs Vass, and Laszlo Gyimothi. 2017. List of shared risk link groups representing regional failures with limited size. In INFOCOM. IEEE, 1--9."},{"key":"e_1_3_2_2_39_1","first-page":"1","article-title":"Xpander","volume":"16","author":"Valadarsky Asaf","year":"2015","unstructured":"Asaf Valadarsky , Michael Dinitz , and Michael Schapira . 2015 . Xpander : Unveiling the Secrets of High-Performance Datacenters. In HotNets. ACM , 16 : 1 -- 16 :7. Asaf Valadarsky, Michael Dinitz, and Michael Schapira. 2015. Xpander: Unveiling the Secrets of High-Performance Datacenters. In HotNets. ACM, 16:1--16:7.","journal-title":"Unveiling the Secrets of High-Performance Datacenters. In HotNets. ACM"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2999572.2999580"},{"key":"e_1_3_2_2_41_1","volume-title":"Keep Forwarding: Towards k-link failure resilient routing","author":"Yang Baohua","year":"2014","unstructured":"Baohua Yang , Junda Liu , Scott Shenker , Jun Li , and Kai Zheng . 2014 . Keep Forwarding: Towards k-link failure resilient routing . In INFOCOM. IEEE , 1617--1625. Baohua Yang, Junda Liu, Scott Shenker, Jun Li, and Kai Zheng. 2014. Keep Forwarding: Towards k-link failure resilient routing. In INFOCOM. IEEE, 1617--1625."}],"event":{"name":"ANCS '21: Symposium on Architectures for Networking and Communications Systems","location":"Layfette IN USA","acronym":"ANCS '21","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE CS"]},"container-title":["Proceedings of the Symposium on Architectures for Networking and Communications Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3493425.3502747","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3493425.3502747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:19Z","timestamp":1750268959000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3493425.3502747"}},"subtitle":["TREE (Tree Routing to Extend Edge disjoint paths)"],"short-title":[],"issued":{"date-parts":[[2021,12,13]]},"references-count":41,"alternative-id":["10.1145\/3493425.3502747","10.1145\/3493425"],"URL":"https:\/\/doi.org\/10.1145\/3493425.3502747","relation":{},"subject":[],"published":{"date-parts":[[2021,12,13]]},"assertion":[{"value":"2022-01-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}