{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:08:20Z","timestamp":1725808100680},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1109\/icc.2010.5502526","type":"proceedings-article","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T10:22:30Z","timestamp":1278930150000},"page":"1-5","source":"Crossref","is-referenced-by-count":6,"title":["Resilient Multipath Routing with Independent Directed Acyclic Graphs"],"prefix":"10.1109","author":[{"given":"S.","family":"Cho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Elhourani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Ramasubramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/90.803380"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.816597"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.11.029"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062052"},{"key":"ref4","article-title":"Proactive vs. reactive approaches to failure resilient routing","author":"lee","year":"2004","journal-title":"IEEE INFOCOM"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.227"},{"key":"ref6","article-title":"IP fast reroute using not-via addresses","author":"bryant","year":"2008","journal-title":"Internet draft"},{"key":"ref5","article-title":"Failure insensitive routing for ensuring service availability","author":"nelakuditi","year":"2003","journal-title":"IWQoS'03 Lecture Notes in Computer Science 2707"},{"key":"ref8","article-title":"Maintaining colored trees for disjoint multipath routing under node failures","author":"jayavelu","year":"2008","journal-title":"accepted for publication in IEEE\/ACM Transactions on Networking"},{"key":"ref7","article-title":"Distributed linear time construction of colored trees for disjoint multlipath routing","author":"ramasubramanian","year":"2006","journal-title":"Proceedings of IFIP Networking"},{"key":"ref2","article-title":"IP Fast Reroute Framework","author":"shand","year":"2008","journal-title":"IETF Internet Draft"},{"article-title":"A survey of multipath routing for traffic engineering","year":"2002","author":"lee","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202468"}],"event":{"name":"ICC 2010 - 2010 IEEE International Conference on Communications","start":{"date-parts":[[2010,5,23]]},"location":"Cape Town, South Africa","end":{"date-parts":[[2010,5,27]]}},"container-title":["2010 IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5497983\/5501741\/05502526.pdf?arnumber=5502526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T19:23:54Z","timestamp":1489865034000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5502526\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icc.2010.5502526","relation":{},"subject":[],"published":{"date-parts":[[2010,5]]}}}