Compressed Network Monitoring

Authors:
Mark Coates;Yvan Pointurier;Michael Rabbat
Affiliations:
Department of Electrical and Computer Engineering, McGill University, 3480 University Street, Montreal, Quebec H3A 2A7, Canada;Department of Electrical and Computer Engineering, McGill University, 3480 University Street, Montreal, Quebec H3A 2A7, Canada;Department of Electrical and Computer Engineering, McGill University, 3480 University Street, Montreal, Quebec H3A 2A7, Canada
Venue:
SSP '07 Proceedings of the 2007 IEEE/SP 14th Workshop on Statistical Signal Processing
Year:
2007

Citing 0
Cited 2

Large scale probabilistic available bandwidth estimation

Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing topology inference for wireless sensor networks

ACM SIGCOMM Computer Communication Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a procedure for estimating a full set of network path metrics, such as loss or delay, from a limited number of measurements. The approach exploits the strong spatial and temporal correlation observed in path-level metric data, which arises due to shared links and stationary components of the observed phenomena. We design diffusion wavelets based on the routing matrix to generate a basis in which the signals are compressible. This allows us to exploit powerful non-linear estimation algorithms that strive for sparse solutions. We demonstrate our results using measurements of end-to-end delay in the Abilene network. Our results show that we can recover network mean end-to-end delay with 95% accuracy while monitoring only 4% of the routes.