Multicast-Based Weight Inference in General Network Topologies
Multicast-Based Weight Inference in General Network Topologies
复制标题
通用网络拓扑中基于组播的权重推断
DOI：
--
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Stephen Pasteris
中科院分区：
文献类型：
--
作者：
Yilei Lin;T. He;Shiqiang Wang;K. Chan;Stephen Pasteris
网络拓扑在许多网络操作中起着重要的作用。然而，由于缺乏内部合作，获取公共网络的拓扑结构是非常困难的。网络断层扫描提供了一种强大的解决方案，可以从端到端的测量中推断网络路由拓扑。现有的解决方案都假设来自单个源的路由形成树。然而，随着软件定义网络（SDN）和网络功能虚拟化（NFV）的快速部署，现代网络中的路由路径变得更加复杂。为了解决这个问题，我们提出了一种新的推理问题，称为权重推理问题，它推断出最细粒度的信息，从端到端的测量一般路由路径在一般拓扑结构。我们的测量基于具有可控“宽度”的模拟多播探测器。我们表明，当多播宽度不受约束时，该问题有一个唯一的解决方案;否则，我们表明，该问题可以被视为一个稀疏近似问题，这使我们能够应用各种各样的追求算法。基于真实的网络拓扑结构的仿真结果表明，该算法的性能明显优于现有的网络断层扫描算法，并且增加组播宽度可以显著提高推理精度.
Network topology plays an important role in many network operations. However, it is very difficult to obtain the topology of public networks due to the lack of internal cooperation. Network tomography provides a powerful solution that can infer the network routing topology from end-to-end measurements. Existing solutions all assume that routes from a single source form a tree. However, with the rapid deployment of Software Defined Networking (SDN) and Network Function Virtualization (NFV), the routing paths in modern networks are becoming more complex. To address this problem, we propose a novel inference problem, called the weight inference problem, which infers the finest-granularity information from end-to-end measurements on general routing paths in general topologies. Our measurements are based on emulated multicast probes with a controllable “width”. We show that the problem has a unique solution when the multicast width is unconstrained; otherwise, we show that the problem can be treated as a sparse approximation problem, which allows us to apply variations of the pursuit algorithms. Simulations based on real network topologies show that our solution significantly outperforms a state-of-the-art network tomography algorithm, and increasing the width of multicast substantially improves the inference accuracy.