NetQuest: A flexible framework for large-scale network measurement

IEEE/ACM Transactions on Networking

Volumn 17, Issue 1, 2009, Pages 106-119

  Song, Han Hee ^a   Qiu, Lili ^a   Zhang, Yin ^a  

^a University of Texas at Austin   (United States)

Author keywords

Bayesian experimental design; Network inference; Network measurement; Network tomography

Indexed keywords

BAYESIAN NETWORKS; DESIGN; DIAGNOSTIC RADIOGRAPHY; STATISTICS; TOMOGRAPHY;

ACTIVE MEASUREMENTS; AMOUNT OF INFORMATIONS; BAYESIAN DECISIONS; BAYESIAN EXPERIMENTAL DESIGN; CAN DESIGNS; CONTINUOUS MONITORING; DESIGN REQUIREMENTS; FLEXIBLE FRAMEWORKS; JOINT DESIGNS; LARGE-SCALE NETWORKS; MEASUREMENT EXPERIMENTS; MULTIPLE USERS; NETWORK INFERENCE; NETWORK MEASUREMENT; NETWORK PATHS; NETWORK TOMOGRAPHY; PATH PROPERTIES; PLANETLAB; REAL TRACES; RESOURCE CONSTRAINTS; SYNTHETIC DATUM;

MONITORING;

EID: 61449232617     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2008.925635     Document Type: Article

References (32)

1. K. Chaloner and I. Verdinelli, "Bayesian experimental design: A review," Statistical Science vol. 10, pp. 273-304, 1995 [Online]. Available: http://www.citeseer.ist.psu.edu/chaloner95bayesian.html
2. Y. Chen, D. Bindel, and R. H. Katz, "Tomography based overlay network monitoring," in Proc. ACM/USENIX Internet Measurement Conf., 2003, pp. 216-231.
3. Y. Chen, D. Bindel, H. Song, and R. H. Katz, "An algebraic approach to practical and scalable overlay network monitoring," in Proc. ACM SIGCOMM, 2004, pp. 55-66.
4. D. B. Chua, E. D. Kolaczyk, and M. Crovella, "Efficient monitoring of end-to-end network properties," in Proc. IEEE INFOCOM, 2004, pp. 1701-1711.
5. D. B. Chua, E. D. Kolaczyk, and M. Crovella, "A statistical framework for efficient monitoring of end-to-end network properties," in Proc. ACM SIGMETRICS, 2005, pp. 390-391.
6. M. A. Clyde, "Experimental design: A Bayesian perspective," International Encyclopedia of Social and Behavioral Sciences, Apr. 2001.
7. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
8. T. Davis, "LDL: A Sparse LDL Factorization and Solve Package (Version 1.2)," 2005 [Online]. Available: http://www.cise.ufl.edu/research/sparse/ldl/
9. D. Donoho, "For most large underdetermined systems of linear equations, the minimal 11-norm near-solution approximates the sparsest near-solution," Stanford Univ. [Online]. Available: http:// www-stat.stanford.edu/~donoho/Reports/2004/1110approx.pdf
10. V. Fedorov, Theory of Optimal Experiments. New York: Academic, 1972.
11. G. H. Golub, V. Klema, and G. W. Stewart, "Rank degeneracy and least squares problems," Stanford Univ., Tech. Rep. CS-TR-76-559, Aug. 1976 [Online]. Available: http://www-db.stanford.edu/TR/CS-TR-76-559.html
12. G. H. Golub and C. F. V. Loan, Matrix Computations, 2nd ed. Baltimore, MD: Johns Hopkins Univ. Press, 1989.
13. P. C. Hansen, Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion. Philadelphia, PA: SIAM, 1997.
14. B. Jones, D. Lin, and C. Nachtsheim, "Bayesian D-optimal supersaturated designs," 2004, submitted.
15. D. V. Lindley, Bayesian Statistics - A Review. Philadelphia, PA: SIAM, 1972.
16. R. Mahajan, N. Spring, D. Wetherall, and T. Anderson, "Inferring link weights using end-to-end measurements," in Proc. ACM SIGCOMM Internet Measurement Workshop, Marseilles, France, Nov. 2002, 6 pp.
17. A. Medina, A. Lakhina, I. Matta, and J. Byers, Boston University Representative Internet Topology Generator (BRITE). [Online]. Available: http://www.cs.bu.edu/brite/
18. A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot, "Traffic matrix estimation: Existing techniques and new directions," in Proc. ACM SIGCOMM, Aug. 2002, pp. 161-174.
19. A. J. Miller and N. K. Nguyen, "A Fedorov exchange algorithm for D-optimal design," Applied Statistics, 1994.
20. T. J. Mitchell, "An algorithm for the construction of D-optimal designs," Technometrics, 1974.
21. E. M. Nahum, C. C. Rosu, S. Seshan, and J. Almeida, "The effects of wide-area conditions on WWW server performance," in Proc. ACM SIGMETRICS, Jun. 2001, pp. 257-267.
22. N. K. Nguyen and A. J. Miller, "A review of exchange algorithms for constructing discrete D-optimal designs," Computational Statistics and Data Analysis, 1992.
23. V. N. Padmanabhan, L. Qiu, and H. Wang, "Server-based inference of Internet link lossiness," in Proc. IEEE INFOCOM, Mar. 2003, 11 pp.
24. M. Saunders, "PDCO: Primal-dual interior method for convex objectives," Stanford Univ., Palo Alto, CA, 2003 Online. Available: http://www.stanford.edu/group/SOL/software/pdco.html
25. H. H. Song, L. Qiu, and Y. Zhang, "Netquest: A flexible framework for large-scale network measurement," in Proc. ACM SIGMETRICS, Saint Malo, France, Jun. 2006, pp. 121-132.
26. N. Spring, R. Mahajan, and D. Wetherall, "Measuring ISP topologies with Rocketfuel," in Proc. ACM SIGCOMM, Aug. 2002, pp. 133-145.
27. N. Spring, R. Mahajan, D. Wetherall, and H. Hagerstrom, "Rocketfuel: An ISP topology mapping engine," [Online]. Available: http://www.cs.washigton.edu/research/networking/rocketfuel/
28. N. Spring, D. Wetherall, and T. Anderson, "Scriptroute: A facility for distributed internet measurement," in Proc. USITS, Mar. 2003.
29. Y. Zhang, Z. Ge, A. Greenberg, and M. Roughan, "Network anomography," in Proc. Internet Measurement Conf., Oct. 2005.
30. Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg, "Fast accurate computation of large-scale ip traffic matrices from link loads," in Proc. ACM SIGMETRICS, Jun. 2003, pp. 206-217.
31. Y. Zhang, M. Roughan, C. Lund, and D. Donoho, "An information-theoretic approach to traffic matrix estimation," in Proc. ACM SIGCOMM, Aug. 2003, pp. 301-312.
32. Y. Zhao, Y. Chen, and D. Bindel, "Towards unbiased end-to-end network diagnosis," in Proc. ACM SIGCOMM, Sep. 2006, pp. 219-230.