The Connectivity and Fault-Tolerance of the Internet Topology
The Connectivity and Fault-Tolerance of the Internet Topology
复制标题
DOI：
--
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
C. R. Palmer;Georgos Siganos;M. Faloutsos;C. Faloutsos;Phillip B. Gibbons
中科院分区：
文献类型：
--
作者：
C. R. Palmer;Georgos Siganos;M. Faloutsos;C. Faloutsos;Phillip B. Gibbons
本文将数据挖掘分析应用于Internet拓扑结构的研究，从而建立了一个新的处理框架。据我们所知，这是在路由器级（即每个节点都是一个路由器）上对Internet拓扑结构进行研究的第一次研究之一。拓扑性质然后我们提出了一个有效的近似算法，使这些指标的计算成为可能最后我们展示了我们的框架的初步结果，例如，我们表明，我们可以识别中央路由器和连接不良，甚至孤立的节点，我们还发现，互联网是令人惊讶的弹性随机链路和路由器故障只有很小的变化，为少于故障，我们的框架似乎是理解和表征互联网拓扑结构和其他可能的真实的通信图（如Web图）的一个有希望的步骤
In this paper we apply data mining analysis to study the topology of the Internet thus creating a new processing framework To the best of our knowledge this is one of the rst studies that focus on the Internet topology at the router level i e each node is a router The size K nodes and the nature of the graph are such that new analysis methods have to be employed First we suggest computationally expensive metrics to characterize topological properties Then we present an e cient approximation algorithm that makes the calculation of these metrics possible Finally we demonstrate the initial results of our framework For example we show that we can identify central routers and poorly connected or even isolated nodes We also nd that the Internet is surprisingly resilient to random link and router failures having only small changes in the connectivity for fewer than failures Our framework seems a promising step towards understanding and characterizing the Internet topology and possible other real communication graphs such as web graphs