K-Shell Decomposition of AS Level Multigraphs

A. Nur
{"title":"K-Shell Decomposition of AS Level Multigraphs","authors":"A. Nur","doi":"10.1109/SysCon48628.2021.9447067","DOIUrl":null,"url":null,"abstract":"The Internet is one of the immense human-engineered systems and understanding of the topology can be helpful for network engineers and researchers. Categorization of Autonomous Systems (ASes) plays an essential role in understanding the structure and evolution of the Internet. However, the traditional categorization exhibits variation in different studies, contains ambiguity, involves subjectiveness, and sometimes does not match the reality. A better approach to classify ASes is defining the AS level topology maps as graphs and taking advantage of the graph properties through k-shell decomposition. However, the proposed solutions neither capture the parallel connections nor incorporate the varying business relations among the ASes. Abstracting ASes without any internal structure is an oversimplification since the ASes in the Internet span over various geographic regions and often cover the same regions in part or whole. In this work, we introduce k-shell decomposition on AS level multigraphs and comparison with AS level graphs. The decomposition is based on pruning the graphs according to the nodes’ connectivity pattern to generate a layered structure of the Internet. In our experiments, we analyze the structure of the shells and the connectivity structure of the Internet. Additionally, we compare top-20 ASes to understand the central core of the Internet. Our comparative results help us to understand the structure of the Internet better.","PeriodicalId":384949,"journal":{"name":"2021 IEEE International Systems Conference (SysCon)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Systems Conference (SysCon)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SysCon48628.2021.9447067","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Internet is one of the immense human-engineered systems and understanding of the topology can be helpful for network engineers and researchers. Categorization of Autonomous Systems (ASes) plays an essential role in understanding the structure and evolution of the Internet. However, the traditional categorization exhibits variation in different studies, contains ambiguity, involves subjectiveness, and sometimes does not match the reality. A better approach to classify ASes is defining the AS level topology maps as graphs and taking advantage of the graph properties through k-shell decomposition. However, the proposed solutions neither capture the parallel connections nor incorporate the varying business relations among the ASes. Abstracting ASes without any internal structure is an oversimplification since the ASes in the Internet span over various geographic regions and often cover the same regions in part or whole. In this work, we introduce k-shell decomposition on AS level multigraphs and comparison with AS level graphs. The decomposition is based on pruning the graphs according to the nodes’ connectivity pattern to generate a layered structure of the Internet. In our experiments, we analyze the structure of the shells and the connectivity structure of the Internet. Additionally, we compare top-20 ASes to understand the central core of the Internet. Our comparative results help us to understand the structure of the Internet better.
AS级多图的k壳分解
互联网是一个巨大的人类工程系统,对其拓扑结构的理解对网络工程师和研究人员很有帮助。自治系统分类在理解互联网的结构和演变过程中起着至关重要的作用。然而,传统的分类在不同的研究中表现出差异,存在模糊性,涉及主观性,有时与现实不符。对AS进行分类的更好方法是将AS级拓扑图定义为图,并通过k-shell分解利用图属性。然而,所建议的解决方案既没有捕获并行连接,也没有包含ase之间不同的业务关系。抽象没有任何内部结构的as是一种过度简化,因为Internet中的as跨越不同的地理区域,并且通常部分或全部覆盖相同的区域。本文介绍了AS级多图的k壳分解,并与AS级图进行了比较。分解的基础是根据节点的连接模式对图进行修剪,从而生成互联网的分层结构。在我们的实验中,我们分析了外壳的结构和互联网的连接结构。此外,我们比较了前20个应用程序,以了解互联网的核心。我们的比较结果有助于我们更好地理解互联网的结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信