{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T16:49:32Z","timestamp":1774716572192,"version":"3.50.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1109\/tnet.2010.2055887","type":"journal-article","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T00:34:01Z","timestamp":1280363641000},"page":"1988-1999","source":"Crossref","is-referenced-by-count":39,"title":["Fast Recovery From Dual-Link or Single-Node Failures in IP Networks Using Tunneling"],"prefix":"10.1109","volume":"18","author":[{"given":"Shrinivasa","family":"Kini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasan","family":"Ramasubramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amund","family":"Kvalbein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Audun Fosselie","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref31","first-page":"566","article-title":"Minimizing average path delay in colored trees for multipath routing","author":"balasubramanian","year":"2006","journal-title":"Proc IEEE ICCCNSensors Ad Hoc Netw Symp"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.816597"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2003"},{"key":"ref11","year":"2002","journal-title":"Intermediate System to Intermediate System Routing Information Exchange Protocol for Use in Conjunction With the Protocol for Providing the Connectionless-Mode Network Service (ISO 8473)"},{"key":"ref12","year":"2002","journal-title":"International Standard"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.17487\/rfc5286"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2004.1303507"},{"key":"ref15","article-title":"efficient algorithms for multi-path link state routing","author":"narvaez","year":"1999","journal-title":"Proceedings of ISCOM"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2001.937183"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2005.150"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.17487\/rfc5714"},{"key":"ref19","first-page":"287","article-title":"failure insensitive routing for ensuring service availability","author":"nelakuditi","year":"2003","journal-title":"Proc IWQoS"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1215\/S0012-7094-37-00336-3","article-title":"a structural characterization of planar combinatorial graphs","volume":"3","author":"lane","year":"1937","journal-title":"Duke Math J"},{"key":"ref4","first-page":"176","article-title":"proactive vs. reactive approaches to failure resilient routing","volume":"1","author":"lee","year":"2004","journal-title":"Proc IEEE InfoCom"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/0202012"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.227"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2003.1226686"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0222002"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.11.029"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1070873.1070877"},{"key":"ref7","author":"ward","year":"2010","journal-title":"Bidirectional Forwarding Detection"},{"key":"ref2","author":"shand","year":"2010","journal-title":"IP fast reroute using not-via addresses"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354653"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062052"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.28"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3931"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1701"},{"key":"ref24","author":"bryant","year":"2008","journal-title":"IPFRR in the presence of multiple failures"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1364654.1364688"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.919323"},{"key":"ref25","first-page":"1026","article-title":"distributed linear time construction of colored trees for disjoint multipath routing","author":"ramasubramanian","year":"2006","journal-title":"Proc IFIP Netw"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/90\/5669974\/05524047.pdf?arnumber=5524047","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:46:32Z","timestamp":1633913192000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5524047\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":32,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2010.2055887","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}