On Identifying Additive Link Metrics Using Linearly Independent Cycles and Paths

In this paper, we study the problem of identifying constant additive link metrics using linearly independent monitoring cycles and paths. A monitoring cycle starts and ends at the same monitoring station, while a monitoring path starts and ends at distinct monitoring stations. We show that three-edge connectivity is a necessary and sufficient condition to identify link metrics using one monitoring station and employing monitoring cycles. We develop a polynomial-time algorithm to compute the set of linearly independent cycles. For networks that are less than three-edge-connected, we show how the minimum number of monitors required and their placement may be computed. For networks with symmetric directed links, we show the relationship between the number of monitors employed, the number of directed links for which metric is known a priori, and the identifiability for the remaining links. To the best of our knowledge, this is the first work that derives the necessary and sufficient conditions on the network topology for identifying additive link metrics and develops a polynomial-time algorithm to compute linearly independent cycles and paths.

[1]  S. N. Maheshwari,et al.  Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs , 1988, J. Algorithms.

[2]  Alon Itai,et al.  Three tree-paths , 1989, J. Graph Theory.

[3]  Zvi Galil,et al.  Reducing edge connectivity to vertex connectivity , 1991, SIGA.

[4]  Samir Khuller,et al.  On Independent Spanning Trees , 1992, Inf. Process. Lett..

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

[6]  Charles E. Perkins,et al.  IP Encapsulation within IP , 1996, RFC.

[7]  Haruhiko Ichino,et al.  Optical path fault management in layered networks , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[8]  Muriel Médard,et al.  Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs , 1999, TNET.

[9]  Robert Nowak,et al.  Internet tomography , 2002, IEEE Signal Process. Mag..

[10]  Ratul Mahajan,et al.  Inferring link weights using end-to-end measurements , 2002, IMW '02.

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

[12]  Sudhir S. Dixit,et al.  A hybrid distributed fault-management protocol for combating single-fiber failures in mesh-based DWDM optical networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[13]  Randy H. Katz,et al.  Tomography-based overlay network monitoring , 2003, IMC '03.

[14]  Li Chen,et al.  Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees , 2003, IEEE J. Sel. Areas Commun..

[15]  Nick G. Duffield,et al.  Simple network performance tomography , 2003, IMC '03.

[16]  Avishai Wool,et al.  Computing the unmeasured: an algebraic approach to Internet mapping , 2004, IEEE Journal on Selected Areas in Communications.

[17]  Randy H. Katz,et al.  An algebraic approach to practical and scalable overlay network monitoring , 2004, SIGCOMM '04.

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

[19]  Jian Tang,et al.  Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[20]  Yonggang Wen,et al.  Efficient fault-diagnosis algorithms for all-optical WDM networks with probabilistic link failures , 2005, Journal of Lightwave Technology.

[21]  R. Kumar,et al.  Practical Beacon Placement for Link Monitoring Using Network Tomography , 2006, IEEE Journal on Selected Areas in Communications.

[22]  Vijayan N. Nair,et al.  Network tomography: A review and recent developments , 2006 .

[23]  David Tse,et al.  Inference of Link Delay in Communication Networks , 2006, IEEE Journal on Selected Areas in Communications.

[24]  Eric S. Fetzer.  Using Adaptive Circuits to Mitigate Process Variations in a Microprocessor Design , 2006, IEEE Design & Test of Computers.

[25]  Yao Zhao,et al.  Towards deterministic network diagnosis , 2006, SIGMETRICS '06/Performance '06.

[26]  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.

[27]  Vijayan N. Nair,et al.  Statistical inverse problems in active network tomography , 2007, 0708.1079.

[28]  Jacob A. Abraham,et al.  Small-Delay Defect Detection in the Presence of Process Variations , 2007, 8th International Symposium on Quality Electronic Design (ISQED'07).

[29]  Preetha Thulasiraman,et al.  Disjoint Multipath Routing to Two Distinct Drains in a Multi-Drain Sensor Network , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

[31]  Jian Ni,et al.  Network tomography based on additive metrics , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[32]  Paul Barford,et al.  Network discovery from passive measurements , 2008, SIGCOMM '08.

[33]  Marwan Krunz,et al.  SRLG Failure Localization in All-Optical Networks Using Monitoring Cycles and Paths , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[34]  Srinivasan Ramasubramanian,et al.  Single-link failure detection in all-optical networks using monitoring cycles and paths , 2009, TNET.

[35]  Peng Ning,et al.  False data injection attacks against state estimation in electric power grids , 2009, CCS.

[36]  Lian-Kuan Chen,et al.  Monitoring of Linearly Accumulated Optical Impairments in All-Optical Networks , 2009, IEEE/OSA Journal of Optical Communications and Networking.

[37]  G. Jayavelu,et al.  Maintaining Colored Trees for Disjoint Multipath Routing Under Node Failures , 2009, IEEE/ACM Transactions on Networking.

[38]  Jin Cao,et al.  Network Tomography: Identifiability and Fourier Domain Estimation , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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