当前位置: X-MOL 学术arXiv.cs.NI › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Inferring Multiple Relationships between ASes using Graph Convolutional Network
arXiv - CS - Networking and Internet Architecture Pub Date : 2021-07-28 , DOI: arxiv-2107.13504
Songtao Peng, Xincheng Shu, Zhongyuan Ruan, Zegang Huang, Qi Xuan

Precisely understanding the business relationships between Autonomous Systems (ASes) is essential for studying the Internet structure. So far, many inference algorithms have been proposed to classify the AS relationships, which mainly focus on Peer-Peer (P2P) and Provider-Customer (P2C) binary classification and achieved excellent results. However, there are other types of AS relationships in actual scenarios, i.e., the businessbased sibling and structure-based exchange relationships, that were neglected in the previous research. These relationships are usually difficult to be inferred by existing algorithms because there is no discrimination on the designed features compared to the P2P or P2C relationships. In this paper, we focus on the multi-classification of AS relationships for the first time. We first summarize the differences between AS relationships under the structural and attribute features, and the reasons why multiple relationships are difficult to be inferred. We then introduce new features and propose a Graph Convolutional Network (GCN) framework, AS-GCN, to solve this multi-classification problem under complex scene. The framework takes into account the global network structure and local link features concurrently. The experiments on real Internet topological data validate the effectiveness of our method, i.e., AS-GCN achieves comparable results on the easy binary classification task, and outperforms a series of baselines on the more difficult multi-classification task, with the overall accuracy above 95%.

中文翻译:

使用图卷积网络推断 AS 之间的多重关系

准确理解自治系统 (AS) 之间的业务关系对于研究互联网结构至关重要。迄今为止,已经提出了许多对AS关系进行分类的推理算法,主要集中在Peer-Peer(P2P)和Provider-Customer(P2C)二元分类上,取得了很好的效果。然而,在实际场景中还有其他类型的AS关系,即基于业务的兄弟关系和基于结构的交换关系,这些在以前的研究中被忽略了。这些关系通常很难被现有算法推断出来,因为与 P2P 或 P2C 关系相比,设计的特征没有区别。在本文中,我们首次关注AS关系的多分类。我们首先总结结构和属性特征下AS关系的区别,以及多重关系难以推断的原因。然后,我们引入了新功能并提出了图卷积网络 (GCN) 框架 AS-GCN,以解决复杂场景下的多分类问题。该框架同时考虑了全局网络结构和本地链接特征。在真实互联网拓扑数据上的实验验证了我们方法的有效性,即 AS-GCN 在简单的二元分类任务上取得了可比的结果,并在更困难的多分类任务上优于一系列基线,整体准确率在 95 以上%。以及难以推断多重关系的原因。然后,我们引入了新功能并提出了图卷积网络 (GCN) 框架 AS-GCN,以解决复杂场景下的多分类问题。该框架同时考虑了全局网络结构和本地链接特征。在真实互联网拓扑数据上的实验验证了我们方法的有效性,即 AS-GCN 在简单的二元分类任务上取得了可比的结果,并在更困难的多分类任务上优于一系列基线,整体准确率在 95 以上%。以及难以推断多重关系的原因。然后,我们引入了新功能并提出了图卷积网络 (GCN) 框架 AS-GCN,以解决复杂场景下的多分类问题。该框架同时考虑了全局网络结构和本地链接特征。在真实互联网拓扑数据上的实验验证了我们方法的有效性,即 AS-GCN 在简单的二元分类任务上取得了可比的结果,并在更困难的多分类任务上优于一系列基线,整体准确率在 95 以上%。该框架同时考虑了全局网络结构和本地链接特征。在真实互联网拓扑数据上的实验验证了我们方法的有效性,即 AS-GCN 在简单的二元分类任务上取得了可比的结果,并在更困难的多分类任务上优于一系列基线,整体准确率在 95 以上%。该框架同时考虑了全局网络结构和本地链接特征。在真实互联网拓扑数据上的实验验证了我们方法的有效性,即 AS-GCN 在简单的二元分类任务上取得了可比的结果,并在更困难的多分类任务上优于一系列基线,整体准确率在 95 以上%。
更新日期:2021-07-29
down
wechat
bug