FRANTIC: A Fast Reference-based Algorithm for Network Tomography via compressive sensing

We study the problem of link and node delay estimation in undirected networks when at most k out of n links or nodes in the network are congested. Our approach relies on end-to-end measurements of path delays across pre-specified paths in the network. We present a class of algorithms that we call FRANTIC. The FRANTIC algorithms are motivated by compressive sensing; however, unlike traditional compressive sensing, the measurement design here is constrained by the network topology and the matrix entries are constrained to be positive integers. A key component of our design is a new compressive sensing algorithm SHO-FA-INT that is related to the SHO-FA algorithm [1] for compressive sensing, but unlike SHO-FA, the matrix entries here are drawn from the set of integers {0, 1, ...,M}. We show that O(k log n/log M) measurements suffice both for SHO-FA-INT and FRANTIC. Further, we show that the computational complexity of decoding is also O(k log n/log M) for each of these algorithms. Finally, we look at efficient constructions of the measurement operations through Steiner Trees.

[1]  Enrique Mallada,et al.  Compressive sensing over graphs , 2010, 2011 Proceedings IEEE INFOCOM.

[2]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[3]  Yao Zhao,et al.  Towards Unbiased End-to-End Network Diagnosis , 2006, IEEE/ACM Transactions on Networking.

[4]  Alex Zelikovsky,et al.  An 11/6-approximation algorithm for the network steiner problem , 1993, Algorithmica.

[5]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[6]  Donald F. Towsley,et al.  Network tomography on general topologies , 2002, SIGMETRICS '02.

[7]  B. M. Waxman.  New Approximation Algorithms for the Steiner Tree Problem , 1989 .

[8]  Michael Molloy,et al.  Cores in random hypergraphs and Boolean formulas , 2005, Random Struct. Algorithms.

[9]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[10]  Amin Karbasi,et al.  Graph-Constrained Group Testing , 2010, IEEE Transactions on Information Theory.

[11]  Marwan Krunz,et al.  SRLG Failure Localization in Optical Networks , 2011, IEEE/ACM Transactions on Networking.

[12]  Patrick Thiran,et al.  Using End-to-End Data to Infer Lossy Links in Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[13]  Mohammad Hamed Firooz,et al.  Network Tomography via Compressed Sensing , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[14]  Yonggang Wen,et al.  Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[15]  Enrique Mallada,et al.  Sparse recovery with graph constraints: Fundamental limits and measurement construction , 2011, 2012 Proceedings IEEE INFOCOM.

[16]  A. Zelikovsky.  Better approximation bounds for the network and Euclidean Steiner tree problems , 1996 .

[17]  Weiyu Xu,et al.  Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs , 2007, 2007 IEEE Information Theory Workshop.

[18]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[19]  Piotr Berman,et al.  Improved approximations for the Steiner tree problem , 1992, SODA '92.

[20]  Michael T. Goodrich,et al.  Invertible bloom lookup tables , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[21]  Jon M. Kleinberg,et al.  Detecting a Network Failure , 2004, Internet Math..

[22]  Hans Jürgen Prömel,et al.  A 1.598 approximation algorithm for the Steiner problem in graphs , 1999, SODA '99.

[23]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[24]  Y. Vardi,et al.  Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data , 1996 .

[25]  Hans Jürgen Prömel,et al.  RNC-Approximation Algorithms for the Steiner Problem , 1997, STACS.

[26]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[27]  Piotr Indyk,et al.  Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[28]  Marek Karpinski,et al.  New Approximation Algorithms for the Steiner Tree Problems , 1997, J. Comb. Optim..

[29]  Yan Chen,et al.  Algebra-Based Scalable Overlay Network Monitoring: Algorithms, Evaluation, and Applications , 2007, IEEE/ACM Transactions on Networking.

[30]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[31]  Robert Nowak,et al.  Network Tomography: Recent Developments , 2004 .

[32]  Mayank Bakshi,et al.  SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[33]  A Better TOMORROW: A Fast Algorithm for Network Tomography with Few Probes , 2013 .

[34]  Nam P. Nguyen,et al.  Efficient Multi-Link Failure Localization Schemes in All-Optical Networks , 2013, IEEE Transactions on Communications.