Link Identifiability with Two Monitors: Proof of Selected Theorems
Liang Ma, Ting He, Kin K. Leung, Ananthram Swami, Don Towsley
TL;DR
This technical report provides detailed proofs of the theorems related to link identifiability in communication networks with two monitors, complementing the original conference paper.
Contribution
It offers rigorous mathematical proofs for the theorems on link identifiability with two monitors, enhancing the theoretical foundation of the original study.
Findings
Theorems on link identifiability are formally proven.
Mathematical conditions for link identifiability are established.
The proofs support the original claims in the conference paper.
Abstract
This is a technical report, containing all the theorem proofs in paper "Link Identifiability in Communication Networks with Two Monitors" by Liang Ma, Ting He, Kin K. Leung, Ananthram Swami, and Don Towsley, published in IEEE Globecom, 2013.
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
TopicsComplex Network Analysis Techniques · Spam and Phishing Detection · Network Security and Intrusion Detection