Multicast-Based Weight Inference in General Network Topologies

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.

[1]  Donald F. Towsley,et al.  Network loss tomography using striped unicast probes , 2006, IEEE/ACM Transactions on Networking.

[2]  Robert D. Nowak,et al.  Maximum likelihood network topology identification from edge-based unicast measurements , 2002, SIGMETRICS '02.

[3]  Fangzhe Chang,et al.  Topology inference in the presence of anonymous routers , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[4]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[5]  A. Bruckstein,et al.  Sparse non-negative solution of a linear system of equations is unique , 2008, 2008 3rd International Symposium on Communications, Control and Signal Processing.

[6]  Robert D. Nowak,et al.  Multiple source, multiple destination network tomography , 2004, IEEE INFOCOM 2004.

[7]  Kamil Saraç,et al.  Resolving IP Aliases in Building Traceroute-Based Internet Maps , 2009, IEEE/ACM Transactions on Networking.

[8]  Ting He,et al.  Looking Glass of NFV: Inferring the Structure and State of NFV Network from External Observations , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.

[9]  Mike E. Davies,et al.  Fast Non-Negative Orthogonal Matching Pursuit , 2015, IEEE Signal Processing Letters.

[10]  R. Caceres,et al.  Loss-based inference of multicast network topology , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[11]  D. Donoho For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution , 2006 .

[12]  Salekul Islam,et al.  A Survey on Multicasting in Software-Defined Networking , 2018, IEEE Communications Surveys & Tutorials.

[13]  Akshay Krishnamurthy,et al.  Robust multi-source network tomography using selective probes , 2012, 2012 Proceedings IEEE INFOCOM.

[14]  Robert D. Nowak,et al.  Multiple-Source Internet Tomography , 2006, IEEE Journal on Selected Areas in Communications.

[15]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[16]  Avinatan Hassidim,et al.  Topology discovery of sparse random graphs with few participants , 2011, SIGMETRICS '11.

[17]  Donald F. Towsley,et al.  OCCAM: An Optimization Based Approach to Network Inference , 2018, PERV.

[18]  Robert Beverly,et al.  A Technique for Network Topology Deception , 2013, MILCOM 2013 - 2013 IEEE Military Communications Conference.

[19]  Christina Fragouli,et al.  Active topology inference using network coding , 2010, Phys. Commun..

[20]  Jian Ni,et al.  Efficient and dynamic routing topology inference from end-to-end measurements , 2010, TNET.

[21]  Steven McCanne,et al.  Inference of multicast routing trees and bottleneck bandwidths using end-to-end measurements , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[22]  Kate Ching-Ju Lin,et al.  Deploying chains of virtual network functions: On the relation between link and server usage , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[23]  Aditya Akella,et al.  On the treeness of internet latency and bandwidth , 2009, SIGMETRICS '09.