{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T19:10:50Z","timestamp":1760469050836,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","funder":[{"name":"BMBF - XLerate","award":["16KIS2056"],"award-info":[{"award-number":["16KIS2056"]}]},{"name":"LOEWE center emergenCITY","award":["LOEWE\/1\/12\/519\/03\/05.001(0016)\/72"],"award-info":[{"award-number":["LOEWE\/1\/12\/519\/03\/05.001(0016)\/72"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,9,8]]},"DOI":"10.1145\/3744969.3748457","type":"proceedings-article","created":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T19:14:48Z","timestamp":1757531688000},"page":"121-123","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Crawling Alice Looking Glasses at IXPs to Quantify BGP Route Diversity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4412-581X","authenticated-orcid":false,"given":"Yasin","family":"Alhamwy","sequence":"first","affiliation":[{"name":"University of Kassel, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0993-7825","authenticated-orcid":false,"given":"Bashar","family":"Khoulani","sequence":"additional","affiliation":[{"name":"University of Kassel, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7557-1081","authenticated-orcid":false,"given":"Oliver","family":"Hohlfeld","sequence":"additional","affiliation":[{"name":"University of Kassel, Germany"}]}],"member":"320","published-online":{"date-parts":[[2025,9,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n. d.]. ([n. d.]). https:\/\/github.com\/alice-lg\/alice-lg"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Todd Arnold Matt Calder Italo Cunha Arpit Gupta Harsha V. Madhyastha Michael Schapira and Ethan Katz-Bassett. 2019. Beating BGP is Harder than we Thought.","DOI":"10.1145\/3365609.3365865"},{"volume-title":"Evaluating Potential Routing Diversity for Internet Failure Recovery","author":"Hu Chengchen","key":"e_1_3_2_1_3_1","unstructured":"Chengchen Hu, Kai Chen, Yan Chen, and Bin Li. 2010. Evaluating Potential Routing Diversity for Internet Failure Recovery. In IEEE INFOCOM."},{"key":"e_1_3_2_1_4_1","volume-title":"Building an AS-topology model that captures route diversity. SIGCOMM CCR 36, 4","author":"M\u00fchlbauer Wolfgang","year":"2006","unstructured":"Wolfgang M\u00fchlbauer, Anja Feldmann, Olaf Maennel, Matthew Roughan, and Steve Uhlig. 2006. Building an AS-topology model that captures route diversity. SIGCOMM CCR 36, 4 (2006)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Steve Uhlig and S\u00e9bastien Tandel. 2006. Quantifying the BGP Routes Diversity Inside a Tier-1 Network. In IFIP NETWORKING.","DOI":"10.1007\/11753810_83"}],"event":{"name":"SIGCOMM '25: ACM SIGCOMM 2025 Conference","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Coimbra Portugal","acronym":"SIGCOMM '25"},"container-title":["Proceedings of the ACM SIGCOMM 2025 Posters and Demos"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3744969.3748457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T18:29:00Z","timestamp":1760466540000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3744969.3748457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"references-count":5,"alternative-id":["10.1145\/3744969.3748457","10.1145\/3744969"],"URL":"https:\/\/doi.org\/10.1145\/3744969.3748457","relation":{},"subject":[],"published":{"date-parts":[[2025,9,8]]},"assertion":[{"value":"2025-09-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}