NetQuest: A flexible framework for large-scale network measurement

Performance Evaluation Review

Volumn 34, Issue 1, 2006, Pages 121-132

  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

COMPUTER AIDED DESIGN; CONSTRAINT THEORY; DECISION THEORY; INFORMATION RETRIEVAL; MEASUREMENT THEORY; USER INTERFACES;

BAYESIAN EXPERIMENTAL DESIGN; NETWORK INFERENCE; NETWORK MEASUREMENTS; NETWORK TOMOGRAPHY;

TELECOMMUNICATION NETWORKS;

EID: 33750306272     PISSN: 01635999     EISSN: 01635999     Source Type: Conference Proceeding    
DOI: 10.1145/1140103.1140293     Document Type: Conference Paper

References (28)

1. K. Chaloncr and I. Verdinelli. Bayesian experimental design: A review.Statistical Science. 10:273-304. 1995. http://citeseer.ist.psu.edu/ chaloner95bayesian.html.
2. Y. Chen, D, Bindel. and R. H. Katz. Tomography based overlay network monitoring. In Proc. ofACMIUSENIX Internet Measurement Conference, 2003.
3. Y. Chen, D. Bindel. H. Song, and R. H. Katz. An algebraic approach to practical and scalable overlay network monitoring. In Proc. of ACM SIGCOMM. 2004.
4. D. B. Chua, E. D. Kolaczyk, and M. Crovella. Efficient monitoring of end-to-end network properties. In Proc. of IEEE INFOCOM. Jul. 2004.
5. D. B. Chua. E. D. Kolaczyk. and M. Crovella. A statistical framework for efficient monitoring of end-to-end network properties. In Proc. of ACM SICMETKICS. 2005.
6. M. A. Clyde. Experimental design: A Bayesian perspective. International Encyclopia 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.http://www.cise.ufl.edu/research/sparse/1dl/.
9. D. Donoho. For most large underdetermined systems of linear equations, the minimal II-norm near-solution approximates the sparsest near-solution. http://www-stat.stanford.edu/~donoho/Reports/2004/ 1110approx.pdf.
10. V. Fcdorov. Theory of Optimal Experiments. Academic Press. New York, 1972.
11. G. H. Golub. V. Klemn, and G. W. Stewart. Rank degeneracy and least squares problems. Technical Report CS-TR-76-559. Stanford University, Aug. 1976. http://www-db.Stanford.edu/TR/CS-TR-76 - 559.html.
12. G. H. Golub and C. F. V. Loan. Matrix Compulations. Johns Hopkins University Press, Baltimore. Maryland. 2nd edition. 1989.
13. P. C. Hansen. Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion. SIAM. 1997.
14. B. Jones, D. Lin, and C. Nachtshcim. Bayesian D-optimal supersaturated designs. 2004. Submitted for publication.
15. D. V. Lindley. Bayesian Statistics - A Review. SIAM. Philadelphia. PA, 1972.
16. A. Medina, A. Lakhina, I. Matta, and J. Byers. Boston university representative Internet topology generator (BRITI:). http://www.cs.bu.edu/brite/ .
17. A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya. and C. Diot. Traffic matrix estimation: Existing techniques and new directions. In Proc. of ACM SIOCOMM. Aug. 2002.
18. A. J. Miller and N. K. Nguyen. A Fedorov exchange algorithm for D-optimal design. Applied Statistics. 1994.
19. T. J. Mitchell. An algorithm for the construction of D-optimal designs. Technometrics. 1974.
20. E. M. Nahum, C. C. Rosn, S. Seshun, and J, Almeida. The effects of wide-area conditions oil WWW server performance. In Proc. of SIGMETRICS. Jun. 2001.
21. N. K. Nguyen and A. J. Miller. A review of exchange algorithms for constructing discrete D-optimal designs. Combinational Statistics and Data Analysis. 1992.
22. V. N. Padmanabhan, L. Qiu, and H. Wang. Server-based inference of Internet performance. In Proc. of IEEE INFOCOM. Mar. 2003.
23. Planetlab, http://www.planet-lab.org.
24. M. Saunders. PDCO: Primal-Dual interior method for Convex Objectives, 2003. http://www.stanford.edu/group/SOL/software/pdco.html.
25. N. Spring. D. Wetherall. and T. Anderson. Scriptroute: A facility for distributed internet measurement. In Proc. of USITS. Mar. 2003.
26. Y. Zhang, Z. Ge, A. Greenberg, and M. Roughan. Network anomography. In Proc. Internet Measurement Conference. Oct. 2005.
27. Y. Zhang, M. Roughan, N. Duffield. and A. Greenberg. Fast accurate computation of large-scale ip traffic matrices from link loads. In Proc. of ACM SICMETRICS. Jun. 2003.
28. Y. Zhang, M. Roughan, C. Lund, and D. Donoho, An information-theoretic approach to traffic matrix estimation. In Proc. of ACM SIGCOMM. Aug. 2003.