{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:59:12Z","timestamp":1782835152237,"version":"3.54.5"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T00:00:00Z","timestamp":1270771200000},"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,4,9]]},"abstract":"<jats:p>This paper advocates a different approach to reduce routing convergence--side-stepping the problem by avoiding it in the first place! Rather than recomputing paths after temporary topology changes, we argue for a separation of timescale between offline computation of multiple diverse paths and online spreading of load over these paths. We believe decoupling failure recovery from path computation leads to networks that are inherently more efficient, more scalable, and easier to manage.<\/jats:p>","DOI":"10.1145\/1764873.1764885","type":"journal-article","created":{"date-parts":[[2010,4,12]],"date-time":"2010-04-12T18:13:20Z","timestamp":1271096000000},"page":"66-71","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Dynamic route recomputation considered harmful"],"prefix":"10.1145","volume":"40","author":[{"given":"Matthew","family":"Caesar","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Casado","sequence":"additional","affiliation":[{"name":"Nicira Networks Inc., Palo Alto, CO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Teemu","family":"Koponen","sequence":"additional","affiliation":[{"name":"Nicira Networks Inc., Palo Alto, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jennifer","family":"Rexford","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Scott","family":"Shenker","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,4,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015479"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502048"},{"key":"e_1_2_1_3_1","volume-title":"Proc. NSDI","author":"Caesar M.","year":"2005","unstructured":"M. Caesar , D. Caldwell , N. Feamster , J. Rexford , A. Shaikh , and K. van der Merwe. Design and implementation of a routing control platform . In Proc. NSDI , 2005 . M. Caesar, D. Caldwell, N. Feamster, J. Rexford, A. Shaikh, and K. van der Merwe. Design and implementation of a routing control platform. In Proc. NSDI, 2005."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282380.1282382"},{"key":"e_1_2_1_5_1","first-page":"4655","author":"Farrel A.","year":"2006","unstructured":"A. Farrel , J.-P. Vasseur , and J. Ash . A Path Computation Element (PCE)-Based Architecture , August 2006 . RFC 4655 . A. Farrel, J.-P. Vasseur, and J. Ash. A Path Computation Element (PCE)-Based Architecture, August 2006. RFC 4655.","journal-title":"A Path Computation Element (PCE)-Based Architecture"},{"key":"e_1_2_1_6_1","volume-title":"Oct","author":"Ford A.","year":"2009","unstructured":"A. Ford , C. Raiciu , and M. Handley . TCP Extensions for Multipath Operation with Multiple Addresses. Internet Draft. draft-ford-mptcp-multiaddressed-02.txt , Oct 2009 . A. Ford, C. Raiciu, and M. Handley. TCP Extensions for Multipath Operation with Multiple Addresses. Internet Draft. draft-ford-mptcp-multiaddressed-02.txt, Oct 2009."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1070873.1070877"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402989"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375457.1375480"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1384609.1384625"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1364654.1364676"},{"key":"e_1_2_1_12_1","volume-title":"Proc. NSDI","author":"John J. P.","year":"2008","unstructured":"J. P. John , E. Katz-Bassett , A. Krishnamurthy , T. Anderson , and A. Venkataramani . Consensus Routing: The Internet as a Distributed System . In Proc. NSDI , 2008 . J. P. John, E. Katz-Bassett, A. Krishnamurthy, T. Anderson, and A. Venkataramani. Consensus Routing: The Internet as a Distributed System. In Proc. NSDI, 2008."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080122"},{"key":"e_1_2_1_14_1","author":"Kent S.","year":"2000","unstructured":"S. Kent , C. Lynn , and K. Seo . Secure Border Gateway Protocol (S-BGP). IEEE J. Selected Areas in Communications , 2000 . S. Kent, C. Lynn, and K. Seo. Secure Border Gateway Protocol (S-BGP). IEEE J. Selected Areas in Communications, 2000.","journal-title":"Secure Border Gateway Protocol (S-BGP). IEEE J. Selected Areas in Communications"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282380.1282402"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232919.1232927"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.929852"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.902727"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402963"},{"key":"e_1_2_1_21_1","volume-title":"Proc. HotNets","author":"Wendlandt D.","year":"2006","unstructured":"D. Wendlandt , I. Avramopoulos , D. Andersen , and J. Rexford . Don't secure routing protocols, secure data delivery . In Proc. HotNets , 2006 . D. Wendlandt, I. Avramopoulos, D. Andersen, and J. Rexford. Don't secure routing protocols, secure data delivery. In Proc. HotNets, 2006."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1452335.1452342"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159934"},{"key":"e_1_2_1_24_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\/1764873.1764885","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1764873.1764885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:44Z","timestamp":1750246784000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1764873.1764885"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,9]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4,9]]}},"alternative-id":["10.1145\/1764873.1764885"],"URL":"https:\/\/doi.org\/10.1145\/1764873.1764885","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2010,4,9]]},"assertion":[{"value":"2010-04-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}