{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:47:44Z","timestamp":1750225664141,"version":"3.37.3"},"reference-count":70,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,5,10]]},"DOI":"10.1109\/infocom42981.2021.9488782","type":"proceedings-article","created":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T00:07:32Z","timestamp":1627344452000},"page":"1-10","source":"Crossref","is-referenced-by-count":9,"title":["Grafting Arborescences for Extra Resilience of Fast Rerouting Schemes"],"prefix":"10.1109","author":[{"given":"Klaus-Tycho","family":"Foerster","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Kamisinski","sequence":"additional","affiliation":[]},{"given":"Yvonne-Anne","family":"Pignolet","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Tredan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-012-0455-y"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098849"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/0405003"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2070562.2070570"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2019.00039"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737438"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524552"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of ‘small-world’ networks","volume":"393","author":"watts","year":"1998","journal-title":"Nature"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3211852.3211858"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS47363.2019.00028"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2025374"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3359989.3365410"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/2620728.2620746"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218382"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/1391289.1391291"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848098"},{"key":"ref64","article-title":"Bounds on the cover time of parallel rotor walks","author":"dereniowski","year":"2014","journal-title":"STACS"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2619398"},{"key":"ref65","article-title":"Exploring the limits of static failover routing (v4)","author":"chiesa","year":"2016","journal-title":"CoRR"},{"key":"ref66","article-title":"On the resiliency of randomized routing against multiple edge failures","author":"chiesa","year":"2016","journal-title":"ICALP"},{"key":"ref29","article-title":"Fast edge splitting and edmonds’ arborescence construction for unweighted graphs","author":"bhalgat","year":"2008","journal-title":"SODA"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2019.8888087"},{"key":"ref68","article-title":"How (not) to shoot in your foot with SDN local fast failover - A load-connectivity tradeoff","author":"borokhovich","year":"2013","journal-title":"OPODIS"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851192"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018477"},{"year":"2013","key":"ref20","article-title":"OpenFlow"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2004.1301021"},{"year":"2017","key":"ref21","article-title":"Configuring BGP PIC Edge and Core for IP and MPLS"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2020981"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1364\/OFC.2001.WDD3"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848157"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.17487\/rfc5286"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2015.47"},{"key":"ref51","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/2814326","article-title":"A purpose-built global network: Google’s move to SDN","volume":"59","author":"vahdat","year":"2016","journal-title":"Commun ACM"},{"key":"ref59","article-title":"Bgp prefix independent convergence (pic)","author":"filsfils","year":"2011","journal-title":"CISCO San Jose CA USA Tech Rep"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/3281411.3281432"},{"key":"ref57","article-title":"Local fast segment rerouting on hypercubes","author":"foerster","year":"2018","journal-title":"OPODIS"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2018.8406885"},{"key":"ref55","article-title":"Topology independent fast reroute using segment routing","author":"bashandy","year":"2018","journal-title":"Working Draft Internet-Draft draft-bashandy-rtgwg-segment- routing-tilfa-05"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935135"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.17487\/rfc5286"},{"key":"ref52","article-title":"Ensuring connectivity via data plane mechanisms","author":"liu","year":"2013","journal-title":"NSDI"},{"key":"ref10","article-title":"Tesseract: A 4d network control plane","author":"yan","year":"2007","journal-title":"NSDI"},{"key":"ref11","article-title":"Ensuring connectivity via data plane mechanisms","author":"liu","year":"2013","journal-title":"NSDI"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44685-7_5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332478"},{"key":"ref13","article-title":"A survey of fast recovery mechanisms in the data plane","author":"chiesa","year":"2020","journal-title":"TechRxiv"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/49.887914"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674985"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICETA.2018.8572205"},{"key":"ref17","first-page":"881","article-title":"Fast reroute paths algorithms","volume":"52","author":"jarry","year":"2013","journal-title":"Telecommunication Systems"},{"key":"ref18","article-title":"Evolution of IP fast-reroute strategies","author":"kamisi?ski","year":"2018","journal-title":"RNDM"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.17487\/rfc4090"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342390"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342388"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2328"},{"key":"ref5","first-page":"35","article-title":"Achieving sub-second IGP convergence in large IP networks","volume":"35","author":"fran\u00e7ois","year":"2005","journal-title":"ACM CCR"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1096536.1096541"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/BF01196259"},{"journal-title":"ISO\/IEC 10589","article-title":"Intermediate Ststem-to-Intermediate System (IS-IS) Routing Protocol","year":"2002","key":"ref7"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626314"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405858"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1094876"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777446"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851220"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.902727"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2523616.2523638"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934891"}],"event":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications","start":{"date-parts":[[2021,5,10]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2021,5,13]]}},"container-title":["IEEE INFOCOM 2021 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9488422\/9488423\/09488782.pdf?arnumber=9488782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:43:38Z","timestamp":1652197418000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9488782\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,10]]},"references-count":70,"URL":"https:\/\/doi.org\/10.1109\/infocom42981.2021.9488782","relation":{},"subject":[],"published":{"date-parts":[[2021,5,10]]}}}