{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:33:58Z","timestamp":1760240038033,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2019,2,27]],"date-time":"2019-02-27T00:00:00Z","timestamp":1551225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61471101","61301274"],"award-info":[{"award-number":["61471101","61301274"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>The last decades have witnessed the progressive development of research on Internet topology at the router or autonomous systems (AS) level. Routers are essential components of ASes, which dominate their behaviors. It is important to identify the affiliation between routers and ASes because this contributes to a deeper understanding of the topology. However, the existing methods that assign a router to an AS, based on the origin AS of its IP addresses do not make full use of the information during the network interaction procedure. In this paper, we propose a novel method to assign routers to their owners\u2019 AS, based on community discovery. First, we use the initial AS information along with router-pair similarities to construct a weighted router level graph; secondly, with the large amount of graph data (more than 2M nodes and 19M edges) from the CAIDA ITDK project, we propose a fast hierarchy clustering algorithm with time and space complexity, which are both linear for graph community discovery. Finally, router-to-AS mapping is completed, based on these AS communities. Experimental results show that the effectiveness and robustness of the proposed method. Combining with AS communities, our method could have the higher accuracy rate reaching to 82.62% for Routers-to-AS mapping, while the best accuracy of prior works is plateaued at 65.44%.<\/jats:p>","DOI":"10.3390\/info10030087","type":"journal-article","created":{"date-parts":[[2019,2,27]],"date-time":"2019-02-27T11:41:03Z","timestamp":1551267663000},"page":"87","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Method for Router-to-AS Mapping Based on Graph Community Discovery"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8752-4381","authenticated-orcid":false,"given":"Hangyu","family":"Hu","sequence":"first","affiliation":[{"name":"School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiyi","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaolei","family":"Fei","sequence":"additional","affiliation":[{"name":"School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Song","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangmin","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,2,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/TNET.2008.926512","article-title":"Lord of the Links: A Framework for Discovering Missing Links in the Internet Topology","volume":"17","author":"He","year":"2009","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TNET.2009.2020798","article-title":"The (In)Completeness of the Observed Internet AS-level Structure","volume":"18","author":"Oliveira","year":"2010","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1109\/TNET.2012.2198887","article-title":"Internet-scale IPv4 alias resolution with MIDAR","volume":"21","author":"Keys","year":"2013","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Gunes, M.H., and Sarac, K. (2008, January 13\u201318). Resolving Anonymous Routers in Internet Topology Measurement Studies. Proceedings of the 27th Conference on Computer Communications (INFOCOM 2008), Phoenix, AZ, USA.","DOI":"10.1109\/INFOCOM.2008.162"},{"key":"ref_5","unstructured":"Rekhter, Y., Katz, D., Mathis, M., Yu, J.Y., and Honig, J.C. (2019, February 22). Application of the Border Gateway Protocol in the Internet. Available online: https:\/\/buildbot.tools.ietf.org\/html\/rfc1164."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Mao, Z.M., Rexford, J., Wang, J., and Katz, R.H. (2003, January 25\u201329). Towards an Accurate AS-Level Traceroute Tool. Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Karlsruhe, Germany.","DOI":"10.1145\/863955.863996"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/1037107.1037108","article-title":"Does AS Size Determine Degree in AS Topology?","volume":"31","author":"Tangmunarunkit","year":"2001","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"ref_8","unstructured":"Tangmunarunkit, H., Govindan, R., Shenker, S., and Estrin, D. (2001, January 22\u201326). The Impact of Routing Policy on Internet Paths. Proceedings of the IEEE INFOCOM 2001, Conference on Computer Communications, Twentieth Annual Joint Conference of the IEEE Computer and Communications Society, Anchorage, AK, USA."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Pansiot, J.J., M\u00e9rindol, P., Donnet, B., and Bonaventure, O. (2010, January 7\u20139). Extracting Intra-domain Topology from mrinfo Probing. Proceedings of the 11th International Conference on Passive and Active Measurement, Zurich, Switzerland.","DOI":"10.1007\/978-3-642-12334-4_9"},{"key":"ref_10","unstructured":"Claffy, K., and Fomenkov, M. (2018). Supporting Research and Development of Security Technologies through Network and Security Data Collection, University of California San Diego."},{"key":"ref_11","unstructured":"(2019, February 22). Archipelago Measurement Infrastructure (Ark). Available online: http:\/\/www.caida.org\/projects\/ark\/."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Marder, A., and Smith, J.M. (2016, January 14\u201316). MAP-IT: Multipass accurate passive inferences from traceroute. Proceedings of the 2016 Internet Measurement Conference, Santa Monica, CA, USA.","DOI":"10.1145\/2987443.2987468"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1314","DOI":"10.1109\/TNET.2014.2323128","article-title":"A novel methodology to address the internet as-level data incompleteness","volume":"23","author":"Gregori","year":"2015","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Huffaker, B., Dhamdhere, A., and Fomenkov, M. (2010). Toward Topology Dualism: Improving the Accuracy of AS Annotations for Routers. Passive and Active Measurement (PAM), Springer.","DOI":"10.1007\/978-3-642-12334-4_11"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"Statistical mechanics of complex networks","volume":"74","author":"Albert","year":"2002","journal-title":"Rev. Mod. Phys."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.physa.2015.02.089","article-title":"Comparison of communities detection algorithms for multiplex","volume":"431","author":"Loe","year":"2015","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","article-title":"The structure and function of complex networks","volume":"45","author":"Newman","year":"2003","journal-title":"SIAM Rev."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","article-title":"Uncovering the overlapping community structure of complex networks in nature and society","volume":"435","author":"Palla","year":"2005","journal-title":"Nature"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Fabian, B., Ghazaryan, Z., and Ermakova, T. (2019, February 22). Internet Connectivity of Financial Services\u2014A Graph-Based Analysis. Available online: https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3213204.","DOI":"10.2139\/ssrn.3213204"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","article-title":"Predicting missing links via local information","volume":"71","author":"Zhou","year":"2009","journal-title":"Eur. Phys. J. B Condens. Matter Complex Syst."},{"key":"ref_21","unstructured":"(2019, February 22). Center for Applied Internet Data Analysis. Available online: http:\/\/www.caida.org\/home\/."},{"key":"ref_22","unstructured":"(2019, February 22). PeeringDB Database. Available online: https:\/\/www.peeringdb.com\/."},{"key":"ref_23","unstructured":"(2019, February 22). ITDK Data. Available online: http:\/\/data.caida.org\/datasets\/topology\/ark\/ipv4\/itdk\/2012-07\/."},{"key":"ref_24","unstructured":"(2019, February 22). PeeringDB Resources. Available online: https:\/\/docs.peeringdb.com\/faq\/."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/3\/87\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:35:09Z","timestamp":1760186109000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/3\/87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,27]]},"references-count":24,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,3]]}},"alternative-id":["info10030087"],"URL":"https:\/\/doi.org\/10.3390\/info10030087","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2019,2,27]]}}}