{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T20:11:46Z","timestamp":1760472706667,"version":"3.28.0"},"reference-count":45,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/infocom.2019.8737438","type":"proceedings-article","created":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T20:35:56Z","timestamp":1560803756000},"page":"469-477","source":"Crossref","is-referenced-by-count":28,"title":["CASA: Congestion and Stretch Aware Static Fast Rerouting"],"prefix":"10.1109","author":[{"given":"Klaus-Tycho","family":"Foerster","sequence":"first","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":"ref39","article-title":"Network pricing and rate allocation with content-provider participation","author":"hande","year":"2010","journal-title":"Proc IEEE InfoCom"},{"key":"ref38","article-title":"Local fast segment rerouting on hypercubes","author":"foerster","year":"2018","journal-title":"Proc OPODIS"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.822655"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524552"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-009-0363-9"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.02.012"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2018.8406885"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218382"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777446"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1094876"},{"key":"ref10","first-page":"46","article-title":"A purpose-built global network: Google’s move to sdn","volume":"59","author":"vahdat","year":"2016","journal-title":"Commun"},{"key":"ref40","article-title":"Blink: Fast connectivity recovery entirely in the data plane","author":"holterbach","year":"2019","journal-title":"Proc NSDI"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332478"},{"key":"ref12","article-title":"On the resiliency of randomized routing against multiple edge failures","author":"chiesa","year":"2016","journal-title":"Proc ICALP"},{"key":"ref13","article-title":"Exploring the limits of static failover routing (v4)","author":"chiesa","year":"2016","journal-title":"arXiv 1409 0034 [cs NI]"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780599"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1321753.1321764"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2619398"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2620728.2620746"},{"key":"ref18","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":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3211852.3211858"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.11.018"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486218"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2006.12.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637236"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.17487\/rfc5286"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxs157"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848157"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851218"},{"journal-title":"Survey","year":"2006","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354653"},{"key":"ref9","article-title":"Ensuring connectivity via data plane mechanisms","author":"liu","year":"2013","journal-title":"Proc NSDI"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018477"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.131"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0149-0"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-24488-9","author":"korte","year":"2012","journal-title":"Combinatorial Optimization Theory and Algorithms"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77404-6_4"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2535771.2535774"},{"key":"ref24","first-page":"2","article-title":"Edge-disjoint branchings","volume":"9","author":"edmonds","year":"1973","journal-title":"Combinatorial Algorithms"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626314"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2516442"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2871089"},{"key":"ref26","article-title":"Load-optimal local fast rerouting for dependable networks","author":"pignolet","year":"2017","journal-title":"Proc DSN"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2890955.2890957"},{"key":"ref25","article-title":"Fast edge splitting and edmonds’ arborescence construction for unweighted graphs","author":"bhalgat","year":"2008","journal-title":"Proc SODA"}],"event":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","start":{"date-parts":[[2019,4,29]]},"location":"Paris, France","end":{"date-parts":[[2019,5,2]]}},"container-title":["IEEE INFOCOM 2019 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8732929\/8737365\/08737438.pdf?arnumber=8737438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T10:29:25Z","timestamp":1694946565000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8737438\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/infocom.2019.8737438","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}