{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:33Z","timestamp":1750221213978,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T00:00:00Z","timestamp":1533600000000},"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":[[2018,8,7]]},"DOI":"10.1145\/3230543.3230561","type":"proceedings-article","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T19:13:06Z","timestamp":1533755586000},"page":"103-116","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Asynchronous convergence of policy-rich distributed bellman-ford routing protocols"],"prefix":"10.1145","author":[{"given":"Matthew L.","family":"Daggitt","sequence":"first","affiliation":[{"name":"University of Cambridge"}]},{"given":"Alexander J. T.","family":"Gurney","sequence":"additional","affiliation":[{"name":"Comcast"}]},{"given":"Timothy G.","family":"Griffin","sequence":"additional","affiliation":[{"name":"University of Cambridge"}]}],"member":"320","published-online":{"date-parts":[[2018,8,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2200\/S00245ED1V01Y201001CNT003"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934909"},{"volume-title":"Data networks","author":"Bertsekas Dimitri P","key":"e_1_3_2_1_3_1","unstructured":"Dimitri P Bertsekas , Robert G Gallager , and Pierre Humblet . 1992. Data networks . Vol. 2 . Prentice-Hall International New Jersey . Dimitri P Bertsekas, Robert G Gallager, and Pierre Humblet. 1992. Data networks. Vol. 2. Prentice-Hall International New Jersey."},{"key":"e_1_3_2_1_4_1","volume-title":"BGP Communities Attribute. RFC 1997","author":"Chandra R.","year":"1997","unstructured":"R. Chandra , P. Traina , and T. Li . 1996 . BGP Communities Attribute. RFC 1997 . http:\/\/www.ietf.org\/rfc\/rfc 1997 .txt R. Chandra, P. Traina, and T. Li. 1996. BGP Communities Attribute. RFC 1997. http:\/\/www.ietf.org\/rfc\/rfc1997.txt"},{"key":"e_1_3_2_1_5_1","volume-title":"Griffin","author":"Daggitt Matthew L.","year":"2018","unstructured":"Matthew L. Daggitt and Timothy G . Griffin . 2018 . Rate of convergence of increasing path-vector routing protocols. (2018). Under submission. Matthew L. Daggitt and Timothy G. Griffin. 2018. Rate of convergence of increasing path-vector routing protocols. (2018). Under submission."},{"key":"e_1_3_2_1_6_1","volume-title":"Griffin","author":"Daggitt Matthew L.","year":"2018","unstructured":"Matthew L. Daggitt , Ran Zmigrod , and Timothy G . Griffin . 2018 . Agda Routing Library . (2018). https:\/\/github.com\/MatthewDaggitt\/agda-routing\/tree\/sigcomm2018 Matthew L. Daggitt, Ran Zmigrod, and Timothy G. Griffin. 2018. Agda Routing Library. (2018). https:\/\/github.com\/MatthewDaggitt\/agda-routing\/tree\/sigcomm2018"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(00)00409-X"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.974523"},{"volume-title":"dioids and semirings: new models and algorithms","author":"Gondran Michel","key":"e_1_3_2_1_9_1","unstructured":"Michel Gondran and Michel Minoux . 2008. Graphs , dioids and semirings: new models and algorithms . Vol. 41 . Springer Science & Business Media . Michel Gondran and Michel Minoux. 2008. Graphs, dioids and semirings: new models and algorithms. Vol. 41. Springer Science & Business Media."},{"key":"e_1_3_2_1_10_1","volume-title":"Exploring the stratified shortest-paths problem. Networking Science 1, 1 (01","author":"Griffin Timothy G.","year":"2012","unstructured":"Timothy G. Griffin . 2012. Exploring the stratified shortest-paths problem. Networking Science 1, 1 (01 Mar 2012 ), 2--14. Timothy G. Griffin. 2012. Exploring the stratified shortest-paths problem. Networking Science 1, 1 (01 Mar 2012), 2--14."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Timothy G Griffin and G Huston. 2005. BGP wedgies. RFC 4264. http:\/\/www.ietf.org\/rfc\/rfc4264.txt  Timothy G Griffin and G Huston. 2005. BGP wedgies. RFC 4264. http:\/\/www.ietf.org\/rfc\/rfc4264.txt","DOI":"10.17487\/rfc4264"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.993304"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645532.656173"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462178"},{"key":"e_1_3_2_1_16_1","first-page":"1","article-title":"Interconnection, Peering and Settlements: Part I","volume":"2","author":"Huston Geoff","year":"1999","unstructured":"Geoff Huston . 1999 . Interconnection, Peering and Settlements: Part I . Internet Protocol Journal (Cisco) 2 , 1 (June 1999). Geoff Huston. 1999. Interconnection, Peering and Settlements: Part I. Internet Protocol Journal (Cisco) 2, 1 (June 1999).","journal-title":"Internet Protocol Journal (Cisco)"},{"key":"e_1_3_2_1_17_1","first-page":"2","article-title":"Interconnection, Peering and Settlements: Part II","volume":"2","author":"Huston Geoff","year":"1999","unstructured":"Geoff Huston . 1999 . Interconnection, Peering and Settlements: Part II . Internet Protocol Journal (Cisco) 2 , 2 (June 1999). Geoff Huston. 1999. Interconnection, Peering and Settlements: Part II. Internet Protocol Journal (Cisco) 2, 2 (June 1999).","journal-title":"Internet Protocol Journal (Cisco)"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629596"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535841"},{"key":"e_1_3_2_1_20_1","unstructured":"Parantap Lahiri George Chen Petr Lapukhov Edet Nkposong Dave Maltz Robert Toomey and Lihua Yuan. 2012. Building Scalable Data Centers: BGP is the Better IGP! presentation.  Parantap Lahiri George Chen Petr Lapukhov Edet Nkposong Dave Maltz Robert Toomey and Lihua Yuan. 2012. Building Scalable Data Centers: BGP is the Better IGP! presentation."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538814"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"D. McPherson V. Gill D. Walton and A. Retana. 2002. Border Gateway Protocol (BGP) Persistent Route Oscillation Condition. RFC 3345. http:\/\/www.ietf.org\/rfc\/rfc3345.txt  D. McPherson V. Gill D. Walton and A. Retana. 2002. Border Gateway Protocol (BGP) Persistent Route Oscillation Condition. RFC 3345. http:\/\/www.ietf.org\/rfc\/rfc3345.txt","DOI":"10.17487\/rfc3345"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1481861.1481862"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Y. Rekhter T. Li and S. Hares. 2006. A Border Gateway Protocol 4 (BGP-4). RFC 4271. http:\/\/www.ietf.org\/rfc\/rfc4271.txt  Y. Rekhter T. Li and S. Hares. 2006. A Border Gateway Protocol 4 (BGP-4). RFC 4271. http:\/\/www.ietf.org\/rfc\/rfc4271.txt","DOI":"10.17487\/rfc4271"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.857111"},{"key":"e_1_3_2_1_26_1","volume-title":"Routing in equilibrium. Mathematical Theory of Networks and System","author":"Sobrinho Joao Luis","year":"2010","unstructured":"Joao Luis Sobrinho and Timothy G Griffin . 2010. Routing in equilibrium. Mathematical Theory of Networks and System ( 2010 ). Joao Luis Sobrinho and Timothy G Griffin. 2010. Routing in equilibrium. Mathematical Theory of Networks and System (2010)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79162"},{"key":"e_1_3_2_1_28_1","volume-title":"Persistent route oscillations in inter-domain routing. Computer networks 32, 1","author":"Varadhan Kannan","year":"2000","unstructured":"Kannan Varadhan , Ramesh Govindan , and Deborah Estrin . 2000. Persistent route oscillations in inter-domain routing. Computer networks 32, 1 ( 2000 ), 1--16. Kannan Varadhan, Ramesh Govindan, and Deborah Estrin. 2000. Persistent route oscillations in inter-domain routing. Computer networks 32, 1 (2000), 1--16."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098833"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94821-8_37"}],"event":{"name":"SIGCOMM '18: ACM SIGCOMM 2018 Conference","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Budapest Hungary","acronym":"SIGCOMM '18"},"container-title":["Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230543.3230561","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3230543.3230561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:46Z","timestamp":1750210786000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230543.3230561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,7]]},"references-count":29,"alternative-id":["10.1145\/3230543.3230561","10.1145\/3230543"],"URL":"https:\/\/doi.org\/10.1145\/3230543.3230561","relation":{},"subject":[],"published":{"date-parts":[[2018,8,7]]},"assertion":[{"value":"2018-08-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}