Network Capability in Localizing Node Failures via End-to-end Path Measurements
Preprint
Abstract
We investigate the capability of localizing node failures in communication networks from binary states (normal/failed) of end-to-end paths. Given a set of nodes of interest, uniquely localizing failures within this set requires that different observable path states associate with different node failure events. However, this condition is difficult to test on large networks due to the need to enumerate all possible node failures. Our first contribution is a set of sufficient/necessary conditions for identifying a bounded number of failures within an arbitrary node set that can be tested in polynomial time. In addition to network topology and locations of monitors, our conditions also incorporate constraints imposed by the probing mechanism used. We consider three probing mechanisms that differ according to whether measurement paths are (i) arbitrarily controllable, (ii) controllable but cycle-free, or (iii) uncontrollable (determined by the default routing protocol). Our second contribution is to quantify the capability of failure localization through (1) the maximum number of failures (anywhere in the network) such that failures within a given node set can be uniquely localized, and (2) the largest node set within which failures can be uniquely localized under a given bound on the total number of failures. Both measures in (1-2) can be converted into functions of a per-node property, which can be computed efficiently based on the above sufficient/necessary conditions. We demonstrate how measures (1-2) proposed for quantifying failure localization capability can be used to evaluate the impact of various parameters, including topology, number of monitors, and probing mechanisms.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Localizing link failures in all-optical networks using monitoring toursComputer Networks, 2014
- Graph-Constrained Group TestingIEEE Transactions on Information Theory, 2012
- Polynomial flow-cut gaps and hardness of directed cut problemsJournal of the ACM, 2009
- Single-Link Failure Detection in All-Optical Networks Using Monitoring Cycles and PathsIEEE/ACM Transactions on Networking, 2009
- Practical issues with using network tomography for fault diagnosisACM SIGCOMM Computer Communication Review, 2008
- The Boolean Solution to the Congested IP Link Location Problem: Theory and Practice2007
- Active Measurement for Multiple Link Failures Diagnosis in IP Networks2004
- d-Disjunct matrices: bounds and Lovász Local LemmaDiscrete Mathematics, 2002
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956