{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T07:17:22Z","timestamp":1776755842822,"version":"3.51.2"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2010,10,22]],"date-time":"2010-10-22T00:00:00Z","timestamp":1287705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2010,10,22]]},"abstract":"<jats:p>Multipath routing is a promising technique to increase the Internet's reliability and to give users greater control over the service they receive. However, past proposals choose paths which are not guaranteed to have high diversity. In this paper, we propose yet another multipath routing scheme (YAMR) for the interdomain case. YAMR provably constructs a set of paths that is resilient to any one inter-domain link failure, thus achieving high reliability in a systematic way. Further, even though YAMR maintains more paths than BGP, it actually requires significantly less control traffic, thus alleviating instead of worsening one of the Internet's scalability problems. This reduction in churn is achieved by a novel hiding technique that automatically localizes failures leaving the greater part of the Internet completely oblivious.<\/jats:p>","DOI":"10.1145\/1880153.1880156","type":"journal-article","created":{"date-parts":[[2010,11,9]],"date-time":"2010-11-09T13:52:03Z","timestamp":1289310723000},"page":"13-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["YAMR"],"prefix":"10.1145","volume":"40","author":[{"given":"Igor","family":"Ganichev","sequence":"first","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Dai","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. Brighten","family":"Godfrey","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Shenker","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,10,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402997"},{"key":"e_1_2_1_2_1","unstructured":"Routing table report. http:\/\/thyme.apnic.net\/ap-data\/2009\/07\/23\/0400\/mail-global.  Routing table report. http:\/\/thyme.apnic.net\/ap-data\/2009\/07\/23\/0400\/mail-global."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.850224"},{"key":"e_1_2_1_4_1","volume-title":"NSDI","author":"Dimitropoulos X.","year":"2007","unstructured":"X. Dimitropoulos , D. Krioukov , A. Vahat , and G. Riley . Graph annotations in modeling complex network topologies . In NSDI , August 2007 . X. Dimitropoulos, D. Krioukov, A. Vahat, and G. Riley. Graph annotations in modeling complex network topologies. In NSDI, August 2007."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0122-y"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0134-7"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/339331.339426"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.993304"},{"key":"e_1_2_1_10_1","volume-title":"NSDI","author":"Kushman N.","year":"2007","unstructured":"N. Kushman , S. Kandula , D. Katabi , and B. M. Maggs . R-BGP: Staying connected in a connected world . In NSDI , 2007 . N. Kushman, S. Kandula, D. Katabi, and B. M. Maggs. R-BGP: Staying connected in a connected world. In NSDI, 2007."},{"key":"e_1_2_1_11_1","unstructured":"D. Meyer L. Zhang and K. Fall. Report from the IAB Workshop on Routing and Addressing. RFC 4984.  D. Meyer L. Zhang and K. Fall. Report from the IAB Workshop on Routing and Addressing. RFC 4984."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402963"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159956"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159934"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.893888"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159933"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1880153.1880156","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1880153.1880156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:16Z","timestamp":1750243936000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1880153.1880156"}},"subtitle":["yet another multipath routing protocol"],"short-title":[],"issued":{"date-parts":[[2010,10,22]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,10,22]]}},"alternative-id":["10.1145\/1880153.1880156"],"URL":"https:\/\/doi.org\/10.1145\/1880153.1880156","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2010,10,22]]},"assertion":[{"value":"2010-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}