Failure Localization Capability: Theorem Proof and Evaluation
Liang Ma, Ting He, Ananthram Swami, Don Towsley, Kin K. Leung

TL;DR
This paper provides rigorous theorem proofs and comprehensive evaluations of network failure localization capabilities using end-to-end path measurements, advancing theoretical understanding and practical assessment.
Contribution
It offers formal proofs of failure localization theorems and detailed evaluation results, enhancing the theoretical foundation and empirical validation of network failure detection methods.
Findings
Theorem proofs establish fundamental limits of failure localization.
Evaluation demonstrates effectiveness of proposed measurement techniques.
Results highlight conditions for accurate failure detection.
Abstract
This is a technical report, containing all the theorem proofs and additional evaluations in paper "Network Capability in Localizing Node Failures via End-to-end Path Measurements" by Liang Ma, Ting He, Ananthram Swami, Don Towsley, and Kin K. Leung, published in IEEE/ACM Transactions on Networking, vol. 25, no. 1, pp. 434-450, 2017.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNetwork Security and Intrusion Detection · Smart Grid Security and Resilience · Internet Traffic Analysis and Secure E-voting
