{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:23:08Z","timestamp":1761402188881,"version":"3.37.3"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["ME2727\/1-2"],"award-info":[{"award-number":["ME2727\/1-2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Serv. Manage."],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1109\/tnsm.2021.3090843","type":"journal-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T20:02:03Z","timestamp":1624305723000},"page":"2570-2586","source":"Crossref","is-referenced-by-count":4,"title":["Robust LFA Protection for Software-Defined Networks (RoLPS)"],"prefix":"10.1109","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1377-995X","authenticated-orcid":false,"given":"Daniel","family":"Merling","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5274-4621","authenticated-orcid":false,"given":"Steffen","family":"Lindner","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3216-1015","authenticated-orcid":false,"given":"Michael","family":"Menth","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/BlackSeaCom.2018.8433706"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2016.7543903"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2012.6364688"},{"journal-title":"A Survey of Fast Recovery Mechanisms in the Data Plane","year":"2020","author":"chiesa","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2015.09.012"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2012.09.011"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/NFV-SDN.2016.7919495"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/NETSOFT.2016.7502425"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2013.6761297"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/EWSDN.2014.13"},{"key":"ref28","first-page":"5","article-title":"Segment Routing: Cutting through the hype and finding the IETF’s innovative nugget of gold","volume":"13","author":"farrel","year":"2017","journal-title":"IET Journal"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-013-9821-z"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2017.04.038"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/NETSOFT.2018.8459923"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10922-016-9369-9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.17487\/rfc5286"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2012.09.004"},{"key":"ref21","first-page":"2","article-title":"Network optimization techniques for improving fast IP-level resilience with loop-free alternates","volume":"3","author":"csikor","year":"2011","journal-title":"Infocommun J"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8102"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.17487\/RFC7490"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935135"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-015-0006-9"},{"journal-title":"OSPF Design Guide","year":"1996","author":"halabi","key":"ref50"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656890"},{"journal-title":"BMv2 Throughput","year":"2018","author":"bas","key":"ref57"},{"journal-title":"FTB-1v2\/FTB-1 Pro Platform","year":"2019","key":"ref56"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3061763"},{"journal-title":"Wedge100BF-32X\/65X Switch","year":"2019","key":"ref54"},{"journal-title":"The World’s Fastest and Most Programmable Networks","year":"2017","key":"ref53"},{"journal-title":"p4lang\/behavioral-model","year":"2019","key":"ref52"},{"journal-title":"No Further Fast Reroute","year":"2020","author":"kompella","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.17487\/rfc6981"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2018.11.020"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1300","DOI":"10.1016\/j.comnet.2009.10.020","article-title":"Loop-free alternates and not-via addresses: A proper combination for IP fast reroute?","volume":"54","author":"martin","year":"2010","journal-title":"Comput Netw"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.892851"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.227"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.17487\/RFC7812"},{"key":"ref16","first-page":"218","article-title":"Performance comparison of not-via addresses and maximally redundant trees (MRTs)","author":"menth","year":"2013","journal-title":"Proc IEEE\/IFIP IM"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2014.6883473"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2161329"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1868447.1868449"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2005.1522138"},{"journal-title":"Topology Independent Fast Reroute using Segment Routing","year":"2021","author":"francois","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46535-7_18"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.09.010"},{"journal-title":"Multiprotocol label switching architecture","year":"3031","author":"rosen","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2018.07.028"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.17487\/rfc4090"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3359989.3365410"},{"journal-title":"D2R Dataplane-only policy-compliant routing under failures","year":"2019","author":"subramanian","key":"ref45"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8660"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8986"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3229591.3229595"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3229574.3229580"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/APSIPAASC47483.2019.9023230"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3426744.3431327"}],"container-title":["IEEE Transactions on Network and Service Management"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4275028\/9530845\/09461214.pdf?arnumber=9461214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:52:35Z","timestamp":1652194355000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9461214\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":57,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnsm.2021.3090843","relation":{},"ISSN":["1932-4537","2373-7379"],"issn-type":[{"type":"electronic","value":"1932-4537"},{"type":"electronic","value":"2373-7379"}],"subject":[],"published":{"date-parts":[[2021,9]]}}}