{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T23:03:37Z","timestamp":1754262217937,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,20]],"date-time":"2010-10-20T00:00:00Z","timestamp":1287532800000},"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,10,20]]},"DOI":"10.1145\/1868447.1868450","type":"proceedings-article","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T12:36:11Z","timestamp":1288096571000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Putting BGP on the right path"],"prefix":"10.1145","author":[{"given":"Michael","family":"Schapira","sequence":"first","affiliation":[{"name":"Yale University, CT, and UC Berkeley, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaping","family":"Zhu","sequence":"additional","affiliation":[{"name":"Princeton University, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer","family":"Rexford","sequence":"additional","affiliation":[{"name":"Princeton University, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,10,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633027"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1823844.1823849"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.929852"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00108-5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.993304"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282427.1282411"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402989"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374388"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134722"},{"key":"e_1_3_2_1_10_1","volume-title":"Distributed algorithmic mechanism design,\" in Algorithmic Game Theory","author":"Feigenbaum J.","year":"2007","unstructured":"J. Feigenbaum , M. Schapira , and S. Shenker , \" Distributed algorithmic mechanism design,\" in Algorithmic Game Theory (N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, eds.), ch. 14, Cambridge University Press , 2007 . J. Feigenbaum, M. Schapira, and S. Shenker, \"Distributed algorithmic mechanism design,\" in Algorithmic Game Theory (N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, eds.), ch. 14, Cambridge University Press, 2007."},{"key":"e_1_3_2_1_11_1","volume-title":"Hotnets V","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 V , 2006 . D. Wendlandt, I. Avramopoulos, D. Andersen, and J. Rexford, \"Don't Secure Routing Protocols, Secure Data Delivery,\" in Proc. Hotnets V, 2006."},{"key":"e_1_3_2_1_12_1","volume-title":"USENIX NSDI","author":"Andersen D. G.","year":"2005","unstructured":"D. G. Andersen , H. Balakrishnan , M. F. Kaashoek , and R. Rao , \" Improving Web availability for clients with MONET,\" in Proc . USENIX NSDI , 2005 . D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Rao, \"Improving Web availability for clients with MONET,\" in Proc. USENIX NSDI, 2005."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402963"},{"key":"e_1_3_2_1_14_1","volume-title":"Some results on BGP convergence","author":"Syed U.","year":"2010","unstructured":"U. Syed and J. Rexford , \" Some results on BGP convergence ,\" Jan. 2010 . working paper, http:\/\/www.cs.princeton.edu\/~usyed\/bgp_convergence_time.pdf. U. Syed and J. Rexford, \"Some results on BGP convergence,\" Jan. 2010. working paper, http:\/\/www.cs.princeton.edu\/~usyed\/bgp_convergence_time.pdf."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.974523"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1052812.1052825"},{"key":"e_1_3_2_1_17_1","unstructured":"\"BGP best path selection algorithm.\" http:\/\/www.cisco.com\/en\/US\/tech\/tk365\/technologies_tech_note09186a0080094431.shtml.  \"BGP best path selection algorithm.\" http:\/\/www.cisco.com\/en\/US\/tech\/tk365\/technologies_tech_note09186a0080094431.shtml."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592583"},{"key":"e_1_3_2_1_19_1","volume-title":"USENIX NSDI","author":"Kushman N.","year":"2007","unstructured":"N. Kushman , S. Kandula , D. Katabi , and B. Maggs , \" R-BGP: Staying connected in a connected world,\" in Proc . USENIX NSDI , 2007 . N. Kushman, S. Kandula, D. Katabi, and B. Maggs, \"R-BGP: Staying connected in a connected world,\" in Proc. USENIX NSDI, 2007."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555375"},{"key":"e_1_3_2_1_21_1","unstructured":"\"Understanding route aggregation in BGP.\" http:\/\/www.cisco.com\/en\/US\/tech\/tk365\/technologies_tech_note09186a0080094826.shtml.  \"Understanding route aggregation in BGP.\" http:\/\/www.cisco.com\/en\/US\/tech\/tk365\/technologies_tech_note09186a0080094826.shtml."}],"event":{"name":"Hotnets-X: 10th ACM Workshop on Hot Topics in Networks","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Monterey California","acronym":"Hotnets-X"},"container-title":["Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1868447.1868450","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1868447.1868450","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:54Z","timestamp":1750248534000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1868447.1868450"}},"subtitle":["a case for next-hop routing"],"short-title":[],"issued":{"date-parts":[[2010,10,20]]},"references-count":21,"alternative-id":["10.1145\/1868447.1868450","10.1145\/1868447"],"URL":"https:\/\/doi.org\/10.1145\/1868447.1868450","relation":{},"subject":[],"published":{"date-parts":[[2010,10,20]]},"assertion":[{"value":"2010-10-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}