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.
Chapter PDF
Similar content being viewed by others
Keywords
References
Padmanabhan, V.N., Qiu, L., Wang, H.J.: Server-based inference of internet link lossiness. In: IEEE INFOCOM, pp. 145–155 (March 2003)
Candes, E., Tao, T.: Decoding by linear programming. IEEE Transactions on Information Theory 51(12), 4203–4215 (2005)
Candés, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory 52(2), 489–509 (2006)
Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM Journal on Computing 24(2), 227–234 (1995)
Arya, V., Veitch, D.: Sparsity without the complexity: Loss localisation using tree measurements. CoRR abs/1108.1377 (2011), http://arxiv.org/abs/1108.1377
Duffield, N.G.: Network tomography of binary network performance characteristics. IEEE Transactions on Information Theory 52(12), 5373–5388 (2006)
Chen, Y., Bindel, D., Song, H.H., Katz, R.H.: An algebraic approach to practical and scalable overlay network monitoring. In: ACM SIGCOMM, pp. 55–66 (August 2004)
Chua, D., Kolaczyk, E., Crovella, M.: Network Krigging. IEEE Journal on Selected Areas in Communications 24(12), 2263–2272 (2006)
Song, H.H., Qiu, L., Zhang, Y.: Netquest: a flexible framework for large-scale network measurement. IEEE/ACM Trans. Netw. 17(1), 106–119 (2009)
Ghita, D., Nguyen, H., Kurant, M., Argyraki, K., Thiran, P.: Netscope: practical network loss tomography. In: IEEE INFOCOM, pp. 1262–1270 (March 2010)
Adams, A., Bu, T., Caceres, T., Duffield, N.G., Friedman, T., Horowitz, J., Lo Presti, F., Moon, S.B., Paxson, V., Towsley, D.: The use of End-to-end Multicast Measurements for Characterising Internal Network Behavior. IEEE Communications Magazine 38(5), 152–158 (2000)
Donoho, D.L.: Compressed sensing. IEEE Transactions on Information Theory 52(4), 1289–1306 (2006)
Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Rev 43(1), 129–159 (2001)
Firooz, M.H., Roy, S.: Network tomography via compressed sensing. In: IEEE GLOBECOM, pp. 1–5 (December 2010)
Indyk, P.: Sparse Recovery Using Sparse Random Matrices. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 157–157. Springer, Heidelberg (2010)
Xu, W., Mallada, E., Tang, A.: Compressive sensing over graphs. In: IEEE INFOCOM, pp. 2087–2095 (March 2011)
Tibshirani, R.: Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society Series B Methodological 58, 267–288 (1996)
Spring, N., Mahajan, R., Wetherall, D., Anderson, T.: Measuring ISP topologies with Rocketfuel. IEEE/ACM Trans. Netw. 12(1), 2–16 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Arya, V., Veitch, D. (2012). Sparsity without the Complexity: Loss Localisation Using Tree Measurements. In: Bestak, R., Kencl, L., Li, L.E., Widmer, J., Yin, H. (eds) NETWORKING 2012. NETWORKING 2012. Lecture Notes in Computer Science, vol 7289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30045-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-30045-5_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30044-8
Online ISBN: 978-3-642-30045-5
eBook Packages: Computer ScienceComputer Science (R0)