Network Capability in Localizing Node Failures via End-to-End Path Measurements
Abstract of Network Capability in Localizing Node Failures
Network Capability in Localizing Node Failures
Network Capability in Localizing Node Failures via End-to-End Path Measurements.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.
Advantages
- These probing mechanisms assume different levels of control over routing of probing packets and are feasible in different network scenarios.
- Answers to the above three problems under these probing mechanisms thus provide insights on how the level of control bestowed on the monitoring system affects its capability in failure localization.
Conclusion
Network Capability in Localizing Node Failures via End-to-End Path Measurements.
We showed that both the conditions and the bounds can be evaluated efficiently using polynomial-time algorithms. In this paper, we study an application of Boolean network tomography to localize node failures from measurements of path states.
The goal of Boolean network tomography is essentially to solve this system of Boolean equations.
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.
