{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:07:49Z","timestamp":1755907669145,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T00:00:00Z","timestamp":1716508800000},"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":[[2024,5,24]]},"DOI":"10.1145\/3670105.3670118","type":"proceedings-article","created":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T18:29:36Z","timestamp":1722277776000},"page":"74-80","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Landmark-Based Optimal Routing for BGP-ORR Protocol"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-4132-8029","authenticated-orcid":false,"given":"Subin","family":"Wang","sequence":"first","affiliation":[{"name":"China Telecom Co., Ltd., China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4111-8200","authenticated-orcid":false,"given":"Wenjie","family":"Chu","sequence":"additional","affiliation":[{"name":"Huawei Techonologies Co., Ltd., China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7931-1321","authenticated-orcid":false,"given":"Litong","family":"Su","sequence":"additional","affiliation":[{"name":"China Telecom Co., Ltd., China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-6732-7678","authenticated-orcid":false,"given":"Junyi","family":"Yang","sequence":"additional","affiliation":[{"name":"Huawei Techonologies Co., Ltd., China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0676-1464","authenticated-orcid":false,"given":"Jianbo","family":"Zhu","sequence":"additional","affiliation":[{"name":"Huawei Techonologies Co., Ltd., China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7579-6722","authenticated-orcid":false,"given":"Yang","family":"Huang","sequence":"additional","affiliation":[{"name":"Huawei Techonologies Co., Ltd., China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,7,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.198"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_5"},{"key":"e_1_3_2_1_6_1","volume-title":"A note on two problems in connexion with graphs. Numer. Math. 1, 1","author":"Dijkstra W.","year":"1959","unstructured":"E.\u00a0W. Dijkstra. 1959. A note on two problems in connexion with graphs. Numer. Math. 1, 1 (1959)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02092136"},{"key":"e_1_3_2_1_8_1","unstructured":"Andrew Goldberg and Renato Werneck. 2005. Computing Point-to-Point Shortest Paths from External Memory.26\u201340."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211045"},{"key":"e_1_3_2_1_11_1","volume-title":"Finding the hidden path: time bounds for all-pairs shortest paths","author":"Karger R.","year":"1993","unstructured":"David\u00a0R. Karger, Daphne Koller, and Steven\u00a0J. Phillips. 1993. Finding the hidden path: time bounds for all-pairs shortest paths. Society for Industrial and Applied Mathematics (1993)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11764298_29"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"Robert Raszuk Bruno Decraene Christian Cassar Erik Aman and Kevin Wang. 2021. BGP Optimal Route Reflection (BGP ORR). RFC 9107. https:\/\/doi.org\/10.17487\/RFC9107","DOI":"10.17487\/RFC9107"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063834"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44676-1_3"}],"event":{"name":"CNIOT 2024: 2024 5th International Conference on Computing, Networks and Internet of Things","acronym":"CNIOT 2024","location":"Tokyo Japan"},"container-title":["Proceedings of the 2024 5th International Conference on Computing, Networks and Internet of Things"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670105.3670118","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670105.3670118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T15:50:10Z","timestamp":1755877810000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670105.3670118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,24]]},"references-count":18,"alternative-id":["10.1145\/3670105.3670118","10.1145\/3670105"],"URL":"https:\/\/doi.org\/10.1145\/3670105.3670118","relation":{},"subject":[],"published":{"date-parts":[[2024,5,24]]},"assertion":[{"value":"2024-07-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}