首页> 外文期刊>Selected Areas in Communications, IEEE Journal on >Inferring Unseen Components of the Internet Core
【24h】

Inferring Unseen Components of the Internet Core

机译:推断Internet核心的看不见的组件

获取原文
获取原文并翻译 | 示例
       

摘要

Despite many efforts over the past decade, the ability to generate topological maps of the Internet at the router-level accurately and in a timely fashion remains elusive. Mapping campaigns commonly involve {t traceroute}-like probing that are usually non-adaptive and incomplete, thus revealing only a portion of the underlying topology. In this paper we demonstrate that standard probing methods yield datasets that implicitly contain information about much more than just the directly observed links and routers. Each probe yields information that places constraints on the underlying topology, and by integrating a large number of such constraints it is possible to accurately infer the existence of unseen components of the Internet (i.e., links and routers not directly revealed by the probing). Moreover, we show that this information can be used to adaptively re-focus the probing in order to more quickly discover the topology. These findings suggest radically new and more efficient approaches to Internet mapping. Our work focuses on the discovery of the core of the Internet. We define "Internet core" as the set of routers that is roughly bounded by ingress/egress routers from stub autonomous systems. We describe a novel data analysis methodology designed to accurately infer (i) the number of unseen core routers, (ii) the unseen hop-count distances between observed routers, and (iii) unseen links between observed routers. We use a large experimental dataset to validate the proposed methods. For our data set, we show that our methods can predict the number of unseen routers to within a 13% error level, estimate 60% of the unseen distances between observed routers to within a one-hop error, and robustly detect over 35% of the unseen links between observed routers. Furthermore, we use the information extracted by our inference methodology to drive an adaptive active-probing scheme. The adaptive probing method allows us to generate maps on our data set using 50% fewer probes-n-n than standard non-adaptive approaches.
机译:尽管在过去的十年中付出了许多努力,但是在路由器级别准确,及时地生成Internet拓扑图的能力仍然难以捉摸。映射活动通常涉及类似{t traceroute}的探测,这些探测通常不自适应且不完整,因此仅揭示了基础拓扑的一部分。在本文中,我们证明了标准的探测方法所产生的数据集隐含的信息远不止直接观察到的链路和路由器。每个探针都产生将约束置于基础拓扑上的信息,并且通过集成大量此类约束,可以准确地推断出Internet中看不见的组件(即,链路和路由器未由探测直接揭示)的存在。此外,我们表明该信息可用于自适应地重新集中探测,以便更快地发现拓扑。这些发现提出了全新的,更有效的Internet映射方法。我们的工作重点是发现Internet的核心。我们将“ Internet核心”定义为由存根自治系统的入口/出口路由器大致限制的一组路由器。我们描述了一种新颖的数据分析方法,旨在准确地推断(i)看不见的核心路由器的数量,(ii)观察到的路由器之间的看不见的跳数距离,以及(iii)观察到的路由器之间的看不见的链接。我们使用大型实验数据集来验证所提出的方法。对于我们的数据集,我们证明了我们的方法可以将看不见的路由器的数量预测到13%的错误级别内,将观察到的路由器之间的看不见的距离的60%估算到一跳错误以内,并可靠地检测出35%以上的观察到的路由器之间看不见的链接。此外,我们使用推理方法提取的信息来驱动自适应主动探测方案。自适应探测方法允许我们使用比标准非自适应方法少50%的探测器n-n在数据集上生成地图。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号