{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:47:18Z","timestamp":1757623638304,"version":"3.44.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["High-Confidence Computing"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1016\/j.hcc.2022.100072","type":"journal-article","created":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T22:44:48Z","timestamp":1656542688000},"page":"100072","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Order of FIB updates seldom matters: Fast reroute and fast convergence with interface\u2010specific forwarding"],"prefix":"10.1016","volume":"2","author":[{"given":"Phani Krishna","family":"Penumarthi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Pecora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5711-3087","authenticated-orcid":false,"given":"Sanjib","family":"Sur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason M.","family":"O\u2019Kane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5990-394X","authenticated-orcid":false,"given":"Srihari","family":"Nelakuditi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.hcc.2022.100072_bib0001","series-title":"ICCCN","article-title":"Failure-inference-based fast reroute with progressive link metric increments","author":"Penumarthi","year":"2018"},{"key":"10.1016\/j.hcc.2022.100072_bib0002","doi-asserted-by":"crossref","unstructured":"S. Bryant, C. Filsfils, S. Previdi, M. Shand, N. So, Remote Loop-Free Alternate (LFA) Fast Reroute (FRR), 2015, (RFC 7490).","DOI":"10.17487\/RFC7490"},{"key":"10.1016\/j.hcc.2022.100072_bib0003","doi-asserted-by":"crossref","unstructured":"S. Bryant, S. Previdi, M. Shand, A framework for IP and MPLS fast reroute using not-via addresses, 2013, (RFC 6981).","DOI":"10.17487\/rfc6981"},{"key":"10.1016\/j.hcc.2022.100072_bib0004","series-title":"ACM SIGCOMM","article-title":"Achieving convergence-free routing using failure-carrying packets","author":"Lakshminarayanan","year":"2007"},{"issue":"2","key":"10.1016\/j.hcc.2022.100072_bib0005","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1109\/TNET.2007.892851","article-title":"Fast local rerouting for handling transient link failures","volume":"15","author":"Nelakuditi","year":"2007","journal-title":"IEEE\/ACM Trans. Netwo."},{"issue":"3","key":"10.1016\/j.hcc.2022.100072_bib0006","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.comnet.2007.10.012","article-title":"Mitigating transient loops through interface-specific forwarding","volume":"52","author":"Nelakuditi","year":"2008","journal-title":"Comput. Netw."},{"issue":"6","key":"10.1016\/j.hcc.2022.100072_bib0007","doi-asserted-by":"crossref","first-page":"1280","DOI":"10.1109\/TNET.2007.902686","article-title":"Avoiding transient loops during IGP convergence in ip networks","volume":"15","author":"Francois","year":"2007","journal-title":"ACM Trans. Netw."},{"key":"10.1016\/j.hcc.2022.100072_bib0008","series-title":"IEEE INFOCOM","article-title":"Disruption free topology reconfiguration in OSPF networks","author":"Francois","year":"2007"},{"key":"10.1016\/j.hcc.2022.100072_bib0009","series-title":"ACM CoNEXT","article-title":"SafeGuard: safe forwarding during routing changes","author":"Li","year":"2009"},{"key":"10.1016\/j.hcc.2022.100072_bib0010","doi-asserted-by":"crossref","DOI":"10.1109\/TNSM.2017.2675921","article-title":"Loop-free convergence with unordered updates","author":"Robertson","year":"2017","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"issue":"2","key":"10.1016\/j.hcc.2022.100072_bib0011","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1109\/COMST.2021.3063980","article-title":"A survey of fast-recovery mechanisms in packet-switched networks","volume":"23","author":"Chiesa","year":"2021","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"10.1016\/j.hcc.2022.100072_bib0012","series-title":"IEEE Infocom","article-title":"Fast IP network recovery using multiple routing configurations","author":"Kvalbein","year":"2006"},{"key":"10.1016\/j.hcc.2022.100072_bib0013","series-title":"INM","article-title":"IP fast reroute with failure inferencing","author":"Wang","year":"2007"},{"key":"10.1016\/j.hcc.2022.100072_bib0014","series-title":"INFOCOM","first-page":"2948","article-title":"IP fast reroute: loop free alternates revisited","author":"Retvari","year":"2011"},{"issue":"9","key":"10.1016\/j.hcc.2022.100072_bib0015","doi-asserted-by":"crossref","first-page":"1765","DOI":"10.1109\/JSAC.2011.111002","article-title":"The Internet topology zoo","volume":"29","author":"Knight","year":"2011","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"4","key":"10.1016\/j.hcc.2022.100072_bib0016","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s11235-015-0006-9","article-title":"On providing fast protection with remote loop-free alternates","volume":"60","author":"Csikor","year":"2015","journal-title":"Telecommun. Syst."},{"issue":"3","key":"10.1016\/j.hcc.2022.100072_bib0017","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1007\/s10922-016-9369-9","article-title":"Loop-free alternates with loop detection for fast reroute in software-defined carrier and data center networks","volume":"24","author":"Braun","year":"2016","journal-title":"J. Netw. Syst. Manag."},{"key":"10.1016\/j.hcc.2022.100072_bib0018","series-title":"ACM HotNets","article-title":"Packet re-cycling: eliminating packet losses due to network failures","author":"Lor","year":"2010"},{"key":"10.1016\/j.hcc.2022.100072_bib0019","series-title":"Proceedings of the Conference of the ACM Special Interest Group on Data Communication","first-page":"460","article-title":"Swift: predictive fast reroute","author":"Holterbach","year":"2017"},{"key":"10.1016\/j.hcc.2022.100072_bib0020","series-title":"10th USENIX Symposium on Networked Systems Design and Implementation (NSDI 13)","first-page":"113","article-title":"Ensuring connectivity via data plane mechanisms","author":"Liu","year":"2013"},{"issue":"12","key":"10.1016\/j.hcc.2022.100072_bib0021","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/2559899.2560327","article-title":"The road to SDN","volume":"11","author":"Feamster","year":"2013","journal-title":"Queue"},{"key":"10.1016\/j.hcc.2022.100072_bib0022","series-title":"ACM SIGCOMM","article-title":"Central control over distributed routing","author":"Vissicchio","year":"2015"},{"key":"10.1016\/j.hcc.2022.100072_bib0023","unstructured":"S. Litkowski, B. Decraene, C. Filsfils, P. Francois, Micro-loop prevention by local delay, 2018, (RFC 8333)."},{"issue":"1","key":"10.1016\/j.hcc.2022.100072_bib0024","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1109\/TNET.2013.2255891","article-title":"Graceful convergence in link-state ip networks: A lightweight algorithm ensuring minimal operational impact","volume":"22","author":"Clad","year":"2014","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"5","key":"10.1016\/j.hcc.2022.100072_bib0025","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1109\/TNET.2014.2332101","article-title":"Computing minimal update sequences for graceful router-wide reconfigurations","volume":"23","author":"Clad","year":"2015","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.hcc.2022.100072_bib0026","series-title":"Proceedings of the 16th International Conference on emerging Networking EXperiments and Technologies","first-page":"466","article-title":"Detecting routing loops in the data plane","author":"Ku\u010dera","year":"2020"},{"key":"10.1016\/j.hcc.2022.100072_bib0027","series-title":"Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies","first-page":"1","article-title":"PURR: a primitive for reconfigurable fast reroute: hope for the best and program for the worst","author":"Chiesa","year":"2019"},{"key":"10.1016\/j.hcc.2022.100072_bib0028","series-title":"ACM SIGCOMM","article-title":"Measureing ISP topologies with Rocketfuel","author":"Spring","year":"2002"},{"key":"10.1016\/j.hcc.2022.100072_bib0029","series-title":"MASCOTS","article-title":"BRITE: an approach to universal topology generation","author":"Medina","year":"2001"}],"container-title":["High-Confidence Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2667295222000241?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2667295222000241?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T08:40:01Z","timestamp":1757407201000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2667295222000241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["S2667295222000241"],"URL":"https:\/\/doi.org\/10.1016\/j.hcc.2022.100072","relation":{},"ISSN":["2667-2952"],"issn-type":[{"type":"print","value":"2667-2952"}],"subject":[],"published":{"date-parts":[[2022,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Order of FIB updates seldom matters: Fast reroute and fast convergence with interface\u2010specific forwarding","name":"articletitle","label":"Article Title"},{"value":"High-Confidence Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.hcc.2022.100072","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 The Author(s). Published by Elsevier B.V. on behalf of Shandong University.","name":"copyright","label":"Copyright"}],"article-number":"100072"}}