NetQuest: a flexible framework for large-scale network measurement

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.

[1]  Srinivasan Seshan,et al.  The effects of wide-area conditions on WWW server performance , 2001, SIGMETRICS '01.

[2]  W. J. Studden,et al.  Theory Of Optimal Experiments , 1972 .

[3]  David Lindley,et al.  Bayesian Statistics, a Review , 1987 .

[4]  Ratul Mahajan,et al.  Inferring link weights using end-to-end measurements , 2002, IMW '02.

[5]  Alan J. Miller,et al.  A review of some exchange algorithms for constructing discrete D-optimal designs , 1992 .

[6]  Randy H. Katz,et al.  Tomography-based overlay network monitoring , 2003, IMC '03.

[7]  Yin Zhang,et al.  NetQuest: A Flexible Framework for Large-Scale Network Measurement , 2009, IEEE/ACM Transactions on Networking.

[8]  Alan J. Miller,et al.  A Fedorov Exchange Algorithm for D-optimal Design , 1994 .

[9]  D. Donoho For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution , 2006 .

[10]  Mark Crovella,et al.  Efficient monitoring of end-to-end network properties , 2004, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Mark Crovella,et al.  Efficient monitoring of end-to-end network properties , 2005, INFOCOM.

[12]  Randy H. Katz,et al.  An algebraic approach to practical and scalable overlay network monitoring , 2004, SIGCOMM 2004.

[13]  P. Hansen Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion , 1987 .

[14]  Dennis K. J. Lin,et al.  Bayesian D-optimal supersaturated designs , 2008 .

[15]  Albert G. Greenberg,et al.  Fast accurate computation of large-scale IP traffic matrices from link loads , 2003, SIGMETRICS '03.

[16]  K. Chaloner,et al.  Bayesian Experimental Design: A Review , 1995 .

[17]  Merlise A. Clyde,et al.  Experimental Design: A Bayesian Perspective , 2001 .

[18]  G. Stewart,et al.  Rank degeneracy and least squares problems , 1976 .

[19]  Helen J. Wang,et al.  Server-based inference of Internet link lossiness , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[20]  MedinaA.,et al.  Traffic matrix estimation , 2002 .

[21]  Yan Chen,et al.  Towards unbiased end-to-end network diagnosis , 2006, SIGCOMM 2006.

[22]  David Wetherall,et al.  Scriptroute: A Public Internet Measurement Facility , 2003, USENIX Symposium on Internet Technologies and Systems.

[23]  Toby J. Mitchell,et al.  An algorithm for the construction of “ D -optimal” experimental designs , 2000 .

[24]  Carsten Lund,et al.  An information-theoretic approach to traffic matrix estimation , 2003, SIGCOMM '03.

[25]  Albert G. Greenberg,et al.  Network anomography , 2005, IMC '05.

[26]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, SIGCOMM 2002.

[27]  Christophe Diot,et al.  Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM 2002.