{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:15:31Z","timestamp":1767183331733,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DARPA","award":["HR0011-17-C-0030"],"award-info":[{"award-number":["HR0011-17-C-0030"]}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","award":["8300751"],"award-info":[{"award-number":["8300751"]}],"id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1910867, 1763617, 1763742, 1822965, 1827674"],"award-info":[{"award-number":["1910867, 1763617, 1763742, 1822965, 1827674"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,9]]},"DOI":"10.1145\/3452296.3472935","type":"proceedings-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T18:13:15Z","timestamp":1628532795000},"page":"447-462","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["AnyOpt"],"prefix":"10.1145","author":[{"given":"Xiao","family":"Zhang","sequence":"first","affiliation":[{"name":"Duke University and Akamai Technologies"}]},{"given":"Tanmoy","family":"Sen","sequence":"additional","affiliation":[{"name":"University of Virginia"}]},{"given":"Zheyuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Virginia"}]},{"given":"Tim","family":"April","sequence":"additional","affiliation":[{"name":"Akamai Technologies"}]},{"given":"Balakrishnan","family":"Chandrasekaran","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Amsterdam and MPI-INF"}]},{"given":"David","family":"Choffnes","sequence":"additional","affiliation":[{"name":"Northeastern University"}]},{"given":"Bruce M.","family":"Maggs","sequence":"additional","affiliation":[{"name":"Duke University and Emerald Innovations and Massachusetts Institute of Technology"}]},{"given":"Haiying","family":"Shen","sequence":"additional","affiliation":[{"name":"University of Virginia"}]},{"given":"Ramesh K.","family":"Sitaraman","sequence":"additional","affiliation":[{"name":"UMass Amherst & Akamai Technologies"}]},{"given":"Xiaowei","family":"Yang","sequence":"additional","affiliation":[{"name":"Duke University"}]}],"member":"320","published-online":{"date-parts":[[2021,8,9]]},"reference":[{"volume-title":"BGP Best Path Selection Algorithm. https:\/\/www.cisco.com\/c\/en\/us\/support\/docs\/ip\/border-gateway-protocol-bgp\/13753-25.html Retrieved","year":"2021","key":"e_1_3_2_2_1_1","unstructured":"2016. BGP Best Path Selection Algorithm. https:\/\/www.cisco.com\/c\/en\/us\/support\/docs\/ip\/border-gateway-protocol-bgp\/13753-25.html Retrieved Jun 28, 2021 from 2016. BGP Best Path Selection Algorithm. https:\/\/www.cisco.com\/c\/en\/us\/support\/docs\/ip\/border-gateway-protocol-bgp\/13753-25.html Retrieved Jun 28, 2021 from"},{"volume-title":"Understanding BGP Path Selection. https:\/\/www.juniper.net\/documentation\/en_US\/junos\/topics\/reference\/general\/routing-protocols-address-representation.html Retrieved","year":"2021","key":"e_1_3_2_2_2_1","unstructured":"2020. Understanding BGP Path Selection. https:\/\/www.juniper.net\/documentation\/en_US\/junos\/topics\/reference\/general\/routing-protocols-address-representation.html Retrieved Jun 28, 2021 from 2020. Understanding BGP Path Selection. https:\/\/www.juniper.net\/documentation\/en_US\/junos\/topics\/reference\/general\/routing-protocols-address-representation.html Retrieved Jun 28, 2021 from"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2019643.2019644"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815675.2815712"},{"volume-title":"Complexity and approximation: Combinatorial optimization problems and their approximability properties","author":"Ausiello Giorgio","key":"e_1_3_2_2_5_1","unstructured":"Giorgio Ausiello , Pierluigi Crescenzi , Giorgio Gambosi , Viggo Kann , Alberto Marchetti-Spaccamela , and Marco Protasi . 2012. Complexity and approximation: Combinatorial optimization problems and their approximability properties . Springer Science & Business Media . https:\/\/www.springer.com\/gp\/book\/9783540654315 Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, and Marco Protasi. 2012. Complexity and approximation: Combinatorial optimization problems and their approximability properties. Springer Science & Business Media. https:\/\/www.springer.com\/gp\/book\/9783540654315"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1177080.1177109"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815675.2815717"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2675013"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836101"},{"key":"e_1_3_2_2_11_1","volume-title":"Anycast Latency: How Many Sites Are Enough?","author":"de Oliveira Schmidt Ricardo","year":"2017","unstructured":"Ricardo de Oliveira Schmidt , John Heidemann , and Jan Harm Kuipers . 2017 . Anycast Latency: How Many Sites Are Enough? . In Passive and Active Measurement, Mohamed Ali Kaafar, Steve Uhlig, and Johanna Amann (Eds.). Springer International Publishing , Cham , 188--200. https:\/\/link.springer.com\/chapter\/10.1007\/978-3-319-54328-4_14 Ricardo de Oliveira Schmidt, John Heidemann, and Jan Harm Kuipers. 2017. Anycast Latency: How Many Sites Are Enough?. In Passive and Active Measurement, Mohamed Ali Kaafar, Steve Uhlig, and Johanna Amann (Eds.). Springer International Publishing, Cham, 188--200. https:\/\/link.springer.com\/chapter\/10.1007\/978-3-319-54328-4_14"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS47738.2020.9110449"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3131365.3131371"},{"key":"e_1_3_2_2_14_1","volume-title":"Traina","author":"Farinacci Dino","year":"2000","unstructured":"Dino Farinacci , Tony Li , Stanley P. Hanks , David Meyer , and Paul S . Traina . 2000 . Generic Routing Encapsulation (GRE). RFC 2784. RFC Editor . 1--9 pages. 2070-1721 https:\/\/www.rfc-editor.org\/rfc\/rfc2784.txt Dino Farinacci, Tony Li, Stanley P. Hanks, David Meyer, and Paul S. Traina. 2000. Generic Routing Encapsulation (GRE). RFC 2784. RFC Editor. 1--9 pages. 2070-1721 https:\/\/www.rfc-editor.org\/rfc\/rfc2784.txt"},{"key":"e_1_3_2_2_15_1","volume-title":"FastRoute: A Scalable Load-Aware Anycast Routing Architecture for Modern CDNs. In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15)","author":"Flavel Ashley","year":"2015","unstructured":"Ashley Flavel , Pradeepkumar Mani , David Maltz , Nick Holt , Jie Liu , Yingying Chen , and Oleg Surmachev . 2015 . FastRoute: A Scalable Load-Aware Anycast Routing Architecture for Modern CDNs. In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15) . USENIX Association, Oakland, CA, 381--394. https:\/\/www.usenix.org\/conference\/nsdi15\/technical-sessions\/presentation\/flavel Ashley Flavel, Pradeepkumar Mani, David Maltz, Nick Holt, Jie Liu, Yingying Chen, and Oleg Surmachev. 2015. FastRoute: A Scalable Load-Aware Anycast Routing Architecture for Modern CDNs. In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15). USENIX Association, Oakland, CA, 381--394. https:\/\/www.usenix.org\/conference\/nsdi15\/technical-sessions\/presentation\/flavel"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.974523"},{"volume-title":"IFIP workshop on Traffic Monitoring and Analysis (TMA). ouvain La Neuve, Belgium, 30--38","author":"Giordano Danilo","key":"e_1_3_2_2_17_1","unstructured":"Danilo Giordano , Danilo Cicalese , A. Finamore , M. Mellia , M. Munafo , Diana Joumblatt , and D. Rossi . 2016. A First Characterization of Anycast Traffic from Passive Traces . In IFIP workshop on Traffic Monitoring and Analysis (TMA). ouvain La Neuve, Belgium, 30--38 . https:\/\/hal-imt.archives-ouvertes.fr\/hal-01383092 Danilo Giordano, Danilo Cicalese, A. Finamore, M. Mellia, M. Munafo, Diana Joumblatt, and D. Rossi. 2016. A First Characterization of Anycast Traffic from Passive Traces. In IFIP workshop on Traffic Monitoring and Analysis (TMA). ouvain La Neuve, Belgium, 30--38. https:\/\/hal-imt.archives-ouvertes.fr\/hal-01383092"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3025945"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637203"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-0462(87)90011-1"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342435"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3472891"},{"key":"e_1_3_2_2_23_1","first-page":"251","article-title":"Method for generating a network map","volume":"7","author":"Leighton F Thomson","year":"2007","unstructured":"F Thomson Leighton , Ravi Sundaram , Matthew Levine , and Adrian Soviani . 2007 . Method for generating a network map . US Patent 7 , 251 ,688. F Thomson Leighton, Ravi Sundaram, Matthew Levine, and Adrian Soviani. 2007. Method for generating a network map. US Patent 7,251,688.","journal-title":"US Patent"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2504730.2504772"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230547"},{"volume-title":"Measuring Query Latency of Top Level DNS Servers","author":"Liang Jinjin","key":"e_1_3_2_2_26_1","unstructured":"Jinjin Liang , Jian Jiang , Haixin Duan , Kang Li , and Jianping Wu. 2013. Measuring Query Latency of Top Level DNS Servers . In Passive and Active Measurement, Matthew Roughan and Rocky Chang (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 145--154. https:\/\/link.springer.com\/chapter\/10.1007\/978-3-642-36516-4_15 Jinjin Liang, Jian Jiang, Haixin Duan, Kang Li, and Jianping Wu. 2013. Measuring Query Latency of Top Level DNS Servers. In Passive and Active Measurement, Matthew Roughan and Rocky Chang (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 145--154. https:\/\/link.springer.com\/chapter\/10.1007\/978-3-642-36516-4_15"},{"volume-title":"Two Days in the Life of the DNS Anycast Root Servers","author":"Liu Ziqian","key":"e_1_3_2_2_27_1","unstructured":"Ziqian Liu , Bradley Huffaker , Marina Fomenkov , Nevil Brownlee , and kc claffy. 2007. Two Days in the Life of the DNS Anycast Root Servers . In Passive and Active Network Measurement, Steve Uhlig, Konstantina Papagiannaki, and Olivier Bonaventure (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 125--134. https:\/\/link.springer.com\/chapter\/10.1007\/978-3-540-71617-4_13 Ziqian Liu, Bradley Huffaker, Marina Fomenkov, Nevil Brownlee, and kc claffy. 2007. Two Days in the Life of the DNS Anycast Root Servers. In Passive and Active Network Measurement, Steve Uhlig, Konstantina Papagiannaki, and Olivier Bonaventure (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 125--134. https:\/\/link.springer.com\/chapter\/10.1007\/978-3-540-71617-4_13"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/4236.991450"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987443.2987446"},{"key":"e_1_3_2_2_30_1","unstructured":"NTT Labs. 2020. BGP implemented in the Go Programming Language. https:\/\/github.com\/osrg\/gobgp.  NTT Labs. 2020. BGP implemented in the Go Programming Language. https:\/\/github.com\/osrg\/gobgp."},{"key":"e_1_3_2_2_31_1","volume-title":"Host Anycasting Service. RFC 1546","author":"Partridge Craig","year":"2070","unstructured":"Craig Partridge , Trevor Mendez , and Walter Milliken . 1993. Host Anycasting Service. RFC 1546 . RFC Editor. 2070 -1721 https:\/\/www.rfc-editor.org\/rfc\/rfc1546.txt Craig Partridge, Trevor Mendez, and Walter Milliken. 1993. Host Anycasting Service. RFC 1546. RFC Editor. 2070-1721 https:\/\/www.rfc-editor.org\/rfc\/rfc1546.txt"},{"key":"e_1_3_2_2_32_1","volume-title":"Internet Control Message Protocol. RFC 777","author":"Postel Jon","year":"2070","unstructured":"Jon Postel . 1981. Internet Control Message Protocol. RFC 777 . RFC Editor. 1--14 pages. 2070 -1721 https:\/\/www.rfc-editor.org\/rfc\/rfc777.txt Jon Postel. 1981. Internet Control Message Protocol. RFC 777. RFC Editor. 1--14 pages. 2070-1721 https:\/\/www.rfc-editor.org\/rfc\/rfc777.txt"},{"key":"e_1_3_2_2_33_1","volume-title":"A Border Gateway Protocol 4 (BGP-4). RFC 4271","author":"Rekhter Yakov","year":"2070","unstructured":"Yakov Rekhter , Tony Li , and Susan Hares . 2006. A Border Gateway Protocol 4 (BGP-4). RFC 4271 . RFC Editor. 1--103 pages. 2070 -1721 https:\/\/www.rfc-editor.org\/rfc\/rfc4271.txt Yakov Rekhter, Tony Li, and Susan Hares. 2006. A Border Gateway Protocol 4 (BGP-4). RFC 4271. RFC Editor. 1--103 pages. 2070-1721 https:\/\/www.rfc-editor.org\/rfc\/rfc4271.txt"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064212.1064271"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355369.3355567"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405881"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341617.3326145"},{"key":"e_1_3_2_2_38_1","article-title":"RIPE Atlas: A global internet measurement network","volume":"18","author":"Staff RIPE NCC","year":"2015","unstructured":"RIPE NCC Staff . 2015 . RIPE Atlas: A global internet measurement network . Internet Protocol Journal 18 , 3 (2015). RIPE NCC Staff. 2015. RIPE Atlas: A global internet measurement network. Internet Protocol Journal 18, 3 (2015).","journal-title":"Internet Protocol Journal"},{"key":"e_1_3_2_2_39_1","volume-title":"https:\/\/www.akamai.com\/us\/en\/multimedia\/documents\/product-brief\/prolexic-routed-product-brief.pdf Retrieved","author":"Technologies Akamai","year":"2021","unstructured":"Akamai Technologies . 2020. Prolexic Routed . https:\/\/www.akamai.com\/us\/en\/multimedia\/documents\/product-brief\/prolexic-routed-product-brief.pdf Retrieved Jan 28, 2021 from Akamai Technologies. 2020. Prolexic Routed. https:\/\/www.akamai.com\/us\/en\/multimedia\/documents\/product-brief\/prolexic-routed-product-brief.pdf Retrieved Jan 28, 2021 from"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.23919\/TMA.2017.8002905"},{"key":"e_1_3_2_2_41_1","volume-title":"Amazon found every 100ms of latency cost them 1% in sales. https:\/\/www.gigaspaces.com\/blog\/amazon-found-every-100ms-of-latency-cost-them-1-in-sales\/ Retrieved","author":"Yoav Einav","year":"2021","unstructured":"Einav Yoav . 2019. Amazon found every 100ms of latency cost them 1% in sales. https:\/\/www.gigaspaces.com\/blog\/amazon-found-every-100ms-of-latency-cost-them-1-in-sales\/ Retrieved Jan 28, 2021 from Einav Yoav. 2019. Amazon found every 100ms of latency cost them 1% in sales. https:\/\/www.gigaspaces.com\/blog\/amazon-found-every-100ms-of-latency-cost-them-1-in-sales\/ Retrieved Jan 28, 2021 from"}],"event":{"name":"SIGCOMM '21: ACM SIGCOMM 2021 Conference","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Virtual Event USA","acronym":"SIGCOMM '21"},"container-title":["Proceedings of the 2021 ACM SIGCOMM 2021 Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452296.3472935","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452296.3472935","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452296.3472935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:40Z","timestamp":1750191460000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452296.3472935"}},"subtitle":["predicting and optimizing IP Anycast performance"],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":40,"alternative-id":["10.1145\/3452296.3472935","10.1145\/3452296"],"URL":"https:\/\/doi.org\/10.1145\/3452296.3472935","relation":{},"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"2021-08-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}