Sparsity without the Complexity: Loss Localisation Using Tree Measurements

Abstract : We study network loss tomography based on observing average loss rates over a set of paths forming a tree – a severely underdetermined linear problem for the unknown link loss probabilities. We examine in detail the role of sparsity as a regularising principle, pointing out that the problem is technically distinct from others in the compressed sensing literature. While sparsity has been applied in the context of tomography, key questions regarding uniqueness and recovery remain unanswered. Our work exploits the tree structure of path measurements to derive sufficient conditions for sparse solutions to be unique and the condition that ℓ1 minimization recovers the true underlying solution. We present a fast single-pass linear algorithm for ℓ1 minimization and prove that a minimum ℓ1 solution is both unique and sparsest for tree topologies. By considering the placement of lossy links within trees, we show that sparse solutions remain unique more often than is commonly supposed. We prove similar results for a noisy version of the problem.
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01531123
Contributor : Hal Ifip <>
Submitted on : Thursday, June 1, 2017 - 11:34:57 AM
Last modification on : Thursday, June 1, 2017 - 3:00:58 PM
Document(s) archivé(s) le : Wednesday, September 6, 2017 - 6:41:27 PM

File

978-3-642-30045-5_22_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Vijay Arya, Darryl Veitch. Sparsity without the Complexity: Loss Localisation Using Tree Measurements. 11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. pp.289-303, ⟨10.1007/978-3-642-30045-5_22⟩. ⟨hal-01531123⟩

Share

Metrics

Record views

55

Files downloads

35