{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T16:04:58Z","timestamp":1790870698776,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,8,30]],"date-time":"2010-08-30T00:00:00Z","timestamp":1283126400000},"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":[],"published-print":{"date-parts":[[2010,8,30]]},"DOI":"10.1145\/1851182.1851210","type":"proceedings-article","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T09:06:04Z","timestamp":1283245564000},"page":"219-230","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Theory and new primitives for safely connecting routing protocol instances"],"prefix":"10.1145","author":[{"given":"Franck","family":"Le","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Geoffrey G.","family":"Xie","sequence":"additional","affiliation":[{"name":"Naval Postgraduate School, Monterey, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,8,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"100x100 Clean Slate Project. www.100x100network.org.  100x100 Clean Slate Project. www.100x100network.org."},{"key":"e_1_3_2_1_2_1","unstructured":"4D Project. www.cs.cmu.edu\/_4D.  4D Project. www.cs.cmu.edu\/_4D."},{"key":"e_1_3_2_1_3_1","unstructured":"XORP\n  : eXtensible Open source Routing Platform. www.xorp.org.  XORP: eXtensible Open source Routing Platform. www.xorp.org."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383077"},{"key":"e_1_3_2_1_5_1","volume-title":"USENIX NSDI","author":"Benson T.","year":"2009","unstructured":"T. Benson , A. Akella , and D. Maltz . Unraveling the Complexity of Network Management . In USENIX NSDI , 2009 . T. Benson, A. Akella, and D. Maltz. Unraveling the Complexity of Network Management. In USENIX NSDI, 2009."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04639-1_3"},{"key":"e_1_3_2_1_7_1","volume-title":"Graphs and Networks","author":"Carr\u00e9 B.","year":"1979","unstructured":"B. Carr\u00e9 . Graphs and Networks . Oxford University Press , 1979 . B. Carr\u00e9. Graphs and Networks. Oxford University Press, 1979."},{"key":"e_1_3_2_1_8_1","volume-title":"OSPF Redistribution Among Different OSPF Processes","year":"2006","unstructured":"Cisco. OSPF Redistribution Among Different OSPF Processes , 2006 . Cisco. OSPF Redistribution Among Different OSPF Processes, 2006."},{"key":"e_1_3_2_1_9_1","volume-title":"March","year":"2006","unstructured":"Cisco. What Is Administrative Distance? , March 2006 . Cisco. What Is Administrative Distance?, March 2006."},{"key":"e_1_3_2_1_10_1","volume-title":"HotNets","author":"Feamster N.","year":"2004","unstructured":"N. Feamster , H. Balakrishnan , and J. Rexford . Some Foundational Problems in Interdomain Routing . In HotNets , 2004 . N. Feamster, H. Balakrishnan, and J. Rexford. Some Foundational Problems in Interdomain Routing. In HotNets, 2004."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080096"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039866"},{"key":"e_1_3_2_1_13_1","volume-title":"Graphs and Algorithms","author":"Gondran M.","year":"1984","unstructured":"M. Gondran and M. Minoux . Graphs and Algorithms . Wiley , 1984 . M. Gondran and M. Minoux. Graphs and Algorithms. Wiley, 1984."},{"key":"e_1_3_2_1_14_1","volume-title":"Graphs, Dioids, and Semirings : New Models and Algorithms","author":"Gondran M.","year":"2008","unstructured":"M. Gondran and M. Minoux . Graphs, Dioids, and Semirings : New Models and Algorithms . Springer , 2008 . M. Gondran and M. Minoux. Graphs, Dioids, and Semirings : New Models and Algorithms. Springer, 2008."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.1998.723727"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863964"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080094"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2007.4375842"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025124.1025882"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321753.1321765"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402964"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2007.4375839"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1544012.1544021"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015472"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/55482.55502"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2003.1200112"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637236"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916261"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863963"},{"key":"e_1_3_2_1_30_1","volume-title":"Mathematical Theory of Networks and System","author":"Sobrinho J. L.","year":"2010","unstructured":"J. L. Sobrinho and T. G. Griffin . Routing in Equilibrium . In Mathematical Theory of Networks and System , 2010 . J. L. Sobrinho and T. G. Griffin. Routing in Equilibrium. In Mathematical Theory of Networks and System, 2010."}],"event":{"name":"SIGCOMM '10: ACM SIGCOMM 2010 Conference","location":"New Delhi India","acronym":"SIGCOMM '10","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM SIGCOMM 2010 conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1851182.1851210","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1851182.1851210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:08:50Z","timestamp":1750234130000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1851182.1851210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,30]]},"references-count":30,"alternative-id":["10.1145\/1851182.1851210","10.1145\/1851182"],"URL":"https:\/\/doi.org\/10.1145\/1851182.1851210","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1851275.1851210","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,8,30]]},"assertion":[{"value":"2010-08-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}