{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:07Z","timestamp":1750307947358,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:00:00Z","timestamp":1186876800000},"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":[[2007,8,12]]},"DOI":"10.1145\/1281100.1281177","type":"proceedings-article","created":{"date-parts":[[2011,8,3]],"date-time":"2011-08-03T23:36:52Z","timestamp":1312414612000},"page":"368-369","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Bringing order to BGP"],"prefix":"10.1145","author":[{"given":"Anat","family":"Bremler-Barr","sequence":"first","affiliation":[{"name":"Interdisciplinary Center, Herzliya, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nir","family":"Chen","sequence":"additional","affiliation":[{"name":"Interdisciplinary Center, Herzliya, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jussi","family":"Kangasharju","sequence":"additional","affiliation":[{"name":"Darmstadt University of Technology, Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osnat","family":"Mokryn","sequence":"additional","affiliation":[{"name":"Interdisciplinary Center, Herzliya, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Shavitt","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,8,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916775"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/347059.347428"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"A. Bremler-Barr N. Chen J. Kangasharju O. Mokryn and Y. Shavitt \"Bringing Order to BGP: Decreasing Time and Message Complexity \" Technical report 2007 http:\/\/www1.idc.ac.il\/faculty\/bremler.  A. Bremler-Barr N. Chen J. Kangasharju O. Mokryn and Y. Shavitt \"Bringing Order to BGP: Decreasing Time and Message Complexity \" Technical report 2007 http:\/\/www1.idc.ac.il\/faculty\/bremler.","DOI":"10.1145\/1281100.1281177"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4227"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.974527"},{"key":"e_1_3_2_1_6_1","volume-title":"Improved BGP Convergence via Ghostflushing,\" in INFOCOM","author":"Bremler-Barr A.","year":"2003","unstructured":"A. Bremler-Barr , Y. Afek , and S. Schwartz , \" Improved BGP Convergence via Ghostflushing,\" in INFOCOM , 2003 . A. Bremler-Barr, Y. Afek, and S. Schwartz, \"Improved BGP Convergence via Ghostflushing,\" in INFOCOM, 2003."},{"key":"e_1_3_2_1_7_1","volume-title":"Measuring BGP Pass-Through Times,\" in Passive and Active Measurement Workshop (PAM)","author":"Feldmann A.","year":"2004","unstructured":"A. Feldmann , H. Kong , O. Maennel , and A. Tudor , \" Measuring BGP Pass-Through Times,\" in Passive and Active Measurement Workshop (PAM) , 2004 . A. Feldmann, H. Kong, O. Maennel, and A. Tudor, \"Measuring BGP Pass-Through Times,\" in Passive and Active Measurement Workshop (PAM), 2004."},{"key":"e_1_3_2_1_8_1","unstructured":"\"Ssfnet \" http:\/\/www.ssfnet.org\/.  \"Ssfnet \" http:\/\/www.ssfnet.org\/."}],"event":{"name":"PODC07: ACM Symposium on Principles of Distributed Computing 2007","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Portland Oregon USA","acronym":"PODC07"},"container-title":["Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1281100.1281177","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1281100.1281177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:32Z","timestamp":1750258352000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1281100.1281177"}},"subtitle":["decreasing time and message complexity"],"short-title":[],"issued":{"date-parts":[[2007,8,12]]},"references-count":8,"alternative-id":["10.1145\/1281100.1281177","10.1145\/1281100"],"URL":"https:\/\/doi.org\/10.1145\/1281100.1281177","relation":{},"subject":[],"published":{"date-parts":[[2007,8,12]]},"assertion":[{"value":"2007-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}