{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:44:20Z","timestamp":1782834260938,"version":"3.54.5"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund [Wiener Wissenschafts\u2013, Forschungs\u2013 und Technologiefonds (WWTF)] through the Project","doi-asserted-by":"publisher","award":["WHATIF 2020\u20132024"],"award-info":[{"award-number":["WHATIF 2020\u20132024"]}],"id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund [Wiener Wissenschafts\u2013, Forschungs\u2013 und Technologiefonds (WWTF)] through the Project","doi-asserted-by":"publisher","award":["ICT19-045"],"award-info":[{"award-number":["ICT19-045"]}],"id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]},{"name":"European Union\u2019s Horizon 2020 Research and Innovation Program","award":["824115"],"award-info":[{"award-number":["824115"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1109\/tnet.2022.3174731","type":"journal-article","created":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T19:36:29Z","timestamp":1653507389000},"page":"2403-2418","source":"Crossref","is-referenced-by-count":6,"title":["Local Fast Rerouting With Low Congestion: A Randomized Approach"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5437-1315","authenticated-orcid":false,"given":"Gregor","family":"Bankhamer","sequence":"first","affiliation":[{"name":"Department of Computer Sciences, University of Salzburg, Salzburg, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5766-8103","authenticated-orcid":false,"given":"Robert","family":"Elsasser","sequence":"additional","affiliation":[{"name":"Department of Computer Sciences, University of Salzburg, Salzburg, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, University of Vienna, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2031064"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2055887"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848098"},{"key":"ref32","first-page":"113","article-title":"Ensuring connectivity via data plane mechanisms","author":"liu","year":"2013","journal-title":"Proc 10th USENIX NSDI"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/WAINA.2011.55"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/637235.637238"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2020981"},{"key":"ref36","article-title":"Fast recovery mechanisms in the data plane","author":"chiesa","year":"2020","journal-title":"TechRxiv"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.2200\/S00389ED1V01Y201111DCT008"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1094876"},{"key":"ref28","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref27","article-title":"Exploring the limits of static failover routing","author":"chiesa","year":"2014","journal-title":"arXiv 1409 0034"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3063980"},{"key":"ref2","author":"pan","year":"4090","journal-title":"Fast Reroute Extensions to RSVP-TE for LSP Tunnels"},{"key":"ref1","author":"atlas","year":"5286","journal-title":"Basic specification for IP fast reroute Loop-free alternates"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1096536.1096551"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"ref21","author":"clad","year":"2014","journal-title":"Disruption-free routing convergence Computing minimal link-state update sequences"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2619398"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787508"},{"key":"ref26","first-page":"455","article-title":"Fast edge splitting and Edmonds’ arborescence construction for unweighted graphs","author":"bhalgat","year":"2008","journal-title":"Proc SODA"},{"key":"ref25","article-title":"Edge-disjoint branchings","author":"edmonds","year":"1973","journal-title":"Combinatorial Algorithms"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524552"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1095921.1095962"},{"key":"ref58","year":"0","journal-title":"Simulation source code"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4_1"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49543-6_13"},{"key":"ref54","first-page":"9:1","article-title":"Randomized local fast rerouting for datacenter networks with almost optimal congestion","author":"bankhamer","year":"2021","journal-title":"Proc 35th Int Symp Distrib Comput (DISC)"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2019.00039"},{"key":"ref52","first-page":"1","article-title":"On the resiliency of randomized routing against multiple edge failures","author":"chiesa","year":"2016","journal-title":"Proc ICALP"},{"key":"ref10","author":"atlas","year":"5286","journal-title":"Basic specification for IP fast-reroute loop-free alternates"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848157"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2079945"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332478"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03850-6_6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2871089"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1109\/TNET.2012.2197411","article-title":"ICTCP: Incast congestion control for TCP in data-center networks","volume":"21","author":"wu","year":"2013","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098825"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737438"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2019.8888087"},{"key":"ref4","article-title":"Topology independent fast reroute using segment routing","author":"fran\u00e7ois","year":"2014"},{"key":"ref3","year":"2013","journal-title":"Openflow"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2328"},{"key":"ref5","year":"0"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674985"},{"key":"ref7","author":"filsfils","year":"2011","journal-title":"BGP prefix independent convergence"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2890955.2890957"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018477"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ANTS.2011.6163659"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2161329"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1282427.1282408"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2516442"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2123916"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900411"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.926507"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2255891"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/9990997\/09781799.pdf?arnumber=9781799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T19:19:25Z","timestamp":1673896765000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9781799\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":58,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2022.3174731","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12]]}}}