{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:01:27Z","timestamp":1775815287143,"version":"3.50.1"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005,1]]},"abstract":"<jats:p>At the inter-domain level, the Internet topology can be represented by a graph with Autonomous Systems (ASes) as nodes and AS peerings as links. This AS-level topology graph has been widely used in a variety of research efforts. Conventionally this topology graph is derived from routing tables collected by Route Views or RIPE RIS. In this work, we assemble the most complete AS-level topology by extending the conventional method along two dimensions. First, in addition to using data from RouteViews and RIPE RIS, we also collect data from many other sources, including route servers, looking glasses, and routing registries. Second, in addition to using routing tables, we also accumulate topological information from routing updates over time. The resulting topology graph on a recent day contains 44% more links and 3% more nodes than that from using RouteViews routing tables alone. Our data collection and topology generation process have been automated, and we publish the latest topology on the web on a daily basis.<\/jats:p>","DOI":"10.1145\/1052812.1052825","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T19:28:32Z","timestamp":1131391712000},"page":"53-61","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":203,"title":["Collecting the internet AS-level topology"],"prefix":"10.1145","volume":"35","author":[{"given":"Beichuan","family":"Zhang","sequence":"first","affiliation":[{"name":"UCLA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raymond","family":"Liu","sequence":"additional","affiliation":[{"name":"UCLA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Massey","sequence":"additional","affiliation":[{"name":"Colorado State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lixia","family":"Zhang","sequence":"additional","affiliation":[{"name":"UCLA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,1]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"bgpdump. http:\/\/www.ris.ripe.net\/source\/libbgpdump-1.4.tar.gz.]]  bgpdump. http:\/\/www.ris.ripe.net\/source\/libbgpdump-1.4.tar.gz.]]"},{"key":"e_1_2_1_2_1","volume-title":"June","author":"AS","year":"2004","unstructured":"CAIDA's macroscopic topology AS adjacencies. http:\/\/www.caida.org\/tools\/measurement\/skitter\/as_adjacencies.xml , June 2004 .]] CAIDA's macroscopic topology AS adjacencies. http:\/\/www.caida.org\/tools\/measurement\/skitter\/as_adjacencies.xml, June 2004.]]"},{"key":"e_1_2_1_3_1","volume-title":"Internet Engineering Task Force","author":"Alaettinoglu C.","year":"1999","unstructured":"C. Alaettinoglu , C. Villamizar , E. Gerich , D. Kessens , D. Meyer , T. Bates , D. Karrenberg , and M. Terpstra . Routing policy specification language (RPSL). RFC 2622 , Internet Engineering Task Force , June 1999 .]] C. Alaettinoglu, C. Villamizar, E. Gerich, D. Kessens, D. Meyer, T. Bates, D. Karrenberg, and M. Terpstra. Routing policy specification language (RPSL). RFC 2622, Internet Engineering Task Force, June 1999.]]"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/505202.505204"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208668"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2003.03.001"},{"key":"e_1_2_1_7_1","volume-title":"Proc. of IEEE INFOCOM","author":"Chen Q.","year":"2002","unstructured":"Q. Chen , H. Chang , R. Govindan , S. Jamin , S. Shenker , and W. Willinger . The origin of power-laws in Internet topologies revisited . In Proc. of IEEE INFOCOM , June 2002 .]] Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. The origin of power-laws in Internet topologies revisited. In Proc. of IEEE INFOCOM, June 2002.]]"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316229"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.974527"},{"key":"e_1_2_1_10_1","volume-title":"ITCOM","author":"Ge Z.","year":"2001","unstructured":"Z. Ge , D. Figueiredo , S. Jaiwal , and L. Gao . On the hierarchical structure of the logical Internet graph . In ITCOM , 2001 .]] Z. Ge, D. Figueiredo, S. Jaiwal, and L. Gao. On the hierarchical structure of the logical Internet graph. In ITCOM, 2001.]]"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/839292.842983"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208685"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/882459.882563"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383061"},{"key":"e_1_2_1_15_1","volume-title":"Internet Engineering Task Force","author":"Rekhter Y.","year":"1995","unstructured":"Y. Rekhter and T. Li . Border Gateway Protocol 4. RFC 1771 , Internet Engineering Task Force , July 1995 .]] Y. Rekhter and T. Li. Border Gateway Protocol 4. RFC 1771, Internet Engineering Task Force, July 1995.]]"},{"key":"e_1_2_1_16_1","unstructured":"The RIPE Routing Information Services. http:\/\/www.ris.ripe.net.]]  The RIPE Routing Information Services. http:\/\/www.ris.ripe.net.]]"},{"key":"e_1_2_1_17_1","unstructured":"The Route Views Project. http:\/\/www.antc.uoregon.edu\/route-views\/.]]  The Route Views Project. http:\/\/www.antc.uoregon.edu\/route-views\/.]]"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019307"},{"key":"e_1_2_1_19_1","volume-title":"Proc. of IEEE GLOBECOM","author":"Xia J.","year":"2004","unstructured":"J. Xia and L. Gao . On the evaluation of AS relationship inferences . In Proc. of IEEE GLOBECOM , Dec. 2004 .]] J. Xia and L. Gao. On the evaluation of AS relationship inferences. In Proc. of IEEE GLOBECOM, Dec. 2004.]]"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1052812.1052825","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1052812.1052825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:42Z","timestamp":1750262862000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1052812.1052825"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["10.1145\/1052812.1052825"],"URL":"https:\/\/doi.org\/10.1145\/1052812.1052825","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2005,1]]},"assertion":[{"value":"2005-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}