Elements of information theory
Elements of information theory
A review of some exchange algorithms for constructing discrete D-optimal designs
Computational Statistics & Data Analysis - Second special issue on optimization techniques in statistics
Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion
Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion
The effects of wide-area conditions on WWW server performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Fast accurate computation of large-scale IP traffic matrices from link loads
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
An information-theoretic approach to traffic matrix estimation
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Rank degeneracy and least squares problems
Rank degeneracy and least squares problems
Tomography-based overlay network monitoring
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
An algebraic approach to practical and scalable overlay network monitoring
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A statistical framework for efficient monitoring of end-to-end network properties
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Blind source separation approach to performance diagnosis and dependency discovery
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
NetQuest: a flexible framework for large-scale network measurement
IEEE/ACM Transactions on Networking (TON)
Sampling biases in network path measurements and what to do about it
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Netscope: practical network loss tomography
INFOCOM'10 Proceedings of the 29th conference on Information communications
Efficient active probing for fault diagnosis in large scale and noisy networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Network tomography on correlated links
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
Scalable and systematic Internet-wide path and delay estimation from existing measurements
Computer Networks: The International Journal of Computer and Telecommunications Networking
Shifting network tomography toward a practical goal
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Proceedings of the 2012 ACM conference on Internet measurement conference
| Hi-index | 0.00 |
In this paper, we present NetQuest, a flexible framework for large-scale network measurement. We apply Bayesian experimental design to select active measurements that maximize the amount of information we gain about the network path properties subject to given resource constraints. We then apply network inference techniques to reconstruct the properties of interest based on the partial, indirect observations we get through these measurements.By casting network measurement in a general Bayesian decision theoretic framework, we achieve flexibility. Our framework can support a variety of design requirements, including (i) differentiated design for providing better resolution to certain parts of the network, (ii) augmented design for conducting additional measurements given existing observations, and (iii) joint design for supporting multiple users who are interested in different parts of the network. Our framework is also scalable and can design measurement experiments that span thousands of routers and end hosts.We develop a toolkit that realizes the framework on PlanetLab. We conduct extensive evaluation using both real traces and synthetic data. Our results show that the approach can accurately estimate network-wide and individual path properties by only monitoring within 2-10% of paths. We also demonstrate its effectiveness in providing differentiated monitoring, supporting continuous monitoring, and satisfying the requirements of multiple users.