{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T18:09:50Z","timestamp":1763748590924,"version":"3.41.0"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2022,1,30]],"date-time":"2022-01-30T00:00:00Z","timestamp":1643500800000},"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":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2022,1,30]]},"abstract":"<jats:p>We describe a new system for distributed tracing at the IP level of the routes that packets take through the IPv4 internet. Our Zeph algorithm coordinates route tracing efforts across agents at multiple vantage points, assigning to each agent a number of \/24 destination prefixes in proportion to its probing budget and chosen according to a reinforcement learning heuristic that aims to maximize the number of multipath links discovered. Zeph runs on top of Iris, our fault tolerant system for orchestrating internet measurements across distributed agents of heterogeneous probing capacities. Iris is built around third party free open source software and modern containerization technology, thereby presenting a new model for assembling a resilient and maintainable internet measurement architecture. We show that carefully choosing the destinations to probe from which vantage point matters to optimize topology discovery and that a system can learn which assignment will maximize the overall discovery based on previous measurements. After 10 cycles of probing, Zeph is capable of discovering 2.4M nodes and 10M links in a cycle of 6 hours, when deployed on 5 Iris agents. This is at least 2 times more nodes and 5 times more links than other production systems for the same number of prefixes probed.<\/jats:p>","DOI":"10.1145\/3523230.3523232","type":"journal-article","created":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T17:09:59Z","timestamp":1646154599000},"page":"2-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Zeph &amp; Iris map the internet"],"prefix":"10.1145","volume":"52","author":[{"given":"Matthieu","family":"Gouel","sequence":"first","affiliation":[{"name":"Sorbonne Universit\u00e9"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Vermeulen","sequence":"additional","affiliation":[{"name":"LAAS-CNRS"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Mouchet","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin P.","family":"Rohrer","sequence":"additional","affiliation":[{"name":"Naval Postgraduate School"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Fourmaux","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9 - CNRS"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timur","family":"Friedman","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,3]]},"reference":[{"volume-title":"d.]. PlanetLab Europe. https:\/\/planet-lab.eu\/. ([n. d.]). Accessed","year":"2022","key":"e_1_2_1_1_1","unstructured":"[n. d.]. PlanetLab Europe. https:\/\/planet-lab.eu\/. ([n. d.]). Accessed February 2, 2022 . [n. d.]. PlanetLab Europe. https:\/\/planet-lab.eu\/. ([n. d.]). Accessed February 2, 2022."},{"key":"e_1_2_1_2_1","unstructured":"2004. Oregon Route Views. http:\/\/routeviews.org\/. (2004). June 8 2004; accessed February 2 2022.  2004. Oregon Route Views. http:\/\/routeviews.org\/. (2004). June 8 2004; accessed February 2 2022."},{"volume-title":"The CAIDA UCSD IPv4 Routed \/24 Topology Dataset. https:\/\/www.caida.org\/catalog\/datasets\/ipv4_routed_24_topology_dataset\/. (2008)","year":"2008","key":"e_1_2_1_3_1","unstructured":"2008. The CAIDA UCSD IPv4 Routed \/24 Topology Dataset. https:\/\/www.caida.org\/catalog\/datasets\/ipv4_routed_24_topology_dataset\/. (2008) . February 1, 2008 ; version of July 8, 2020. 2008. The CAIDA UCSD IPv4 Routed \/24 Topology Dataset. https:\/\/www.caida.org\/catalog\/datasets\/ipv4_routed_24_topology_dataset\/. (2008). February 1, 2008; version of July 8, 2020."},{"volume-title":"The Impact of the Archipelago Measurement Platform. https:\/\/www.caida.org\/projects\/ark\/impact\/. (2014)","year":"2014","key":"e_1_2_1_4_1","unstructured":"2014. The Impact of the Archipelago Measurement Platform. https:\/\/www.caida.org\/projects\/ark\/impact\/. (2014) . July 3, 2014 ; version of November 15, 2019. 2014. The Impact of the Archipelago Measurement Platform. https:\/\/www.caida.org\/projects\/ark\/impact\/. (2014). July 3, 2014; version of November 15, 2019."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342393"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1177080.1177100"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/505202.505204"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987443.2987479"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879162"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CATCH.2009.38"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871501"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3434770.3459737"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2930611.2930633"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2269837"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185376.2185388"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071690.1064256"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1823844.1823853"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3419394.3423654"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2663716.2663743"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832534"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3419394.3423619"},{"key":"e_1_2_1_22_1","unstructured":"Van Jacobson. 1988. 4BSD routing diagnostic tool available for ftp. Email 8812201313.AA03127@helios.ee.lbl.gov to the IETF and end2end-interest e-mail lists. (1988).  Van Jacobson. 1988. 4BSD routing diagnostic tool available for ftp. Email 8812201313.AA03127@helios.ee.lbl.gov to the IETF and end2end-interest e-mail lists. (1988)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/3323234.3323282"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1177080.1177090"},{"key":"e_1_2_1_25_1","unstructured":"Volodymyr Kuleshov and Doina Precup. 2014. Algorithms for multi-armed bandit problems. (2014). [arxiv]1402.6028  Volodymyr Kuleshov and Doina Precup. 2014. Algorithms for multi-armed bandit problems. (2014). [arxiv]1402.6028"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098858"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2504730.2504759"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1267308.1267334"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/NGI.2011.5985865"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1096536.1096546"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633039"},{"key":"e_1_2_1_32_1","first-page":"3","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 . The Internet Protocol Journal 18 , 3 (Sept. 2015), 2&ndash;26. http:\/\/ipj.dreamhosters.com\/wp-content\/uploads\/2015\/10\/ipj18.3.pdf RIPE NCC Staff. 2015. RIPE Atlas: A Global Internet Measurement Network. The Internet Protocol Journal 18, 3 (Sept. 2015), 2&ndash;26. http:\/\/ipj.dreamhosters.com\/wp-content\/uploads\/2015\/10\/ipj18.3.pdf","journal-title":"The Internet Protocol Journal"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-011-9573-6"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.23919\/TMA.2019.8784525"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062055"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/3388242.3388278"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3278532.3278536"},{"key":"e_1_2_1_38_1","volume-title":"Mathematics and the internet: A source of enormous confusion and great potential. Notices of the American Mathematical Society 56, 5","author":"Willinger Walter","year":"2009","unstructured":"Walter Willinger , David Alderson , and John C Doyle . 2009. Mathematics and the internet: A source of enormous confusion and great potential. Notices of the American Mathematical Society 56, 5 ( 2009 ), 586&ndash;599. https:\/\/www.ams.org\/notices\/200905\/rtx090500586p.pdf Walter Willinger, David Alderson, and John C Doyle. 2009. Mathematics and the internet: A source of enormous confusion and great potential. Notices of the American Mathematical Society 56, 5 (2009), 586&ndash;599. https:\/\/www.ams.org\/notices\/200905\/rtx090500586p.pdf"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402996"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3523230.3523232","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3523230.3523232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:30Z","timestamp":1750183770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3523230.3523232"}},"subtitle":["A resilient reinforcement learning approach to distributed IP route tracing"],"short-title":[],"issued":{"date-parts":[[2022,1,30]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1,30]]}},"alternative-id":["10.1145\/3523230.3523232"],"URL":"https:\/\/doi.org\/10.1145\/3523230.3523232","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2022,1,30]]},"assertion":[{"value":"2022-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}