{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:30Z","timestamp":1772163930739,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T00:00:00Z","timestamp":1151280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,6,26]]},"DOI":"10.1145\/1140277.1140293","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T12:53:01Z","timestamp":1153745581000},"page":"121-132","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["NetQuest"],"prefix":"10.1145","author":[{"given":"Han Hee","family":"Song","sequence":"first","affiliation":[{"name":"University of Texas at Austin, Austin, TX"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lili","family":"Qiu","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177009939"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948233"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015475"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of IEEE INFOCOM","author":"Chua D. B.","year":"2004","unstructured":"D. B. Chua , E. D. Kolaczyk , and M. Crovella . Efficient monitoring of end-to-end network properties . In Proc. of IEEE INFOCOM , Jul. 2004 . D. B. Chua, E. D. Kolaczyk, and M. Crovella. Efficient monitoring of end-to-end network properties. In Proc. of IEEE INFOCOM, Jul. 2004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064212.1064269"},{"key":"e_1_3_2_1_6_1","volume-title":"International Encyclopia Social and Behavioral Sciences","author":"Clyde M. A.","year":"2001","unstructured":"M. A. Clyde . Experimental design : A Bayesian perspective . International Encyclopia Social and Behavioral Sciences , Apr. 2001 . M. A. Clyde. Experimental design: A Bayesian perspective. International Encyclopia Social and Behavioral Sciences, Apr. 2001."},{"key":"e_1_3_2_1_7_1","volume-title":"Elements of Information Theory","author":"Cover T. M.","year":"1991","unstructured":"T. M. Cover and J. A. Thomas . Elements of Information Theory . New York : Wiley , 1991 . T. M. Cover and J. A. Thomas. Elements of Information Theory. New York: Wiley, 1991."},{"key":"e_1_3_2_1_8_1","volume-title":"LDL: A sparse LDL' factorization and solve package (version 1.2)","author":"Davis T.","year":"2005","unstructured":"T. Davis . LDL: A sparse LDL' factorization and solve package (version 1.2) , 2005 . http:\/\/www.cise.ufl.edu\/research\/sparse\/ldl\/. T. Davis. LDL: A sparse LDL' factorization and solve package (version 1.2), 2005. http:\/\/www.cise.ufl.edu\/research\/sparse\/ldl\/."},{"key":"e_1_3_2_1_9_1","unstructured":"D. Donoho. For most large underdetermined systems of linear equations the minimal l1-norm near-solution approximates the sparsest near-solution. http:\/\/www-stat.stanford.edu\/~donoho\/Reports\/2004\/l1l0approx.pdf.  D. Donoho. For most large underdetermined systems of linear equations the minimal l1-norm near-solution approximates the sparsest near-solution. http:\/\/www-stat.stanford.edu\/~donoho\/Reports\/2004\/l1l0approx.pdf."},{"key":"e_1_3_2_1_10_1","volume-title":"Theory of Optimal Experiments","author":"Fedorov V.","year":"1972","unstructured":"V. Fedorov . Theory of Optimal Experiments . Academic Press , New York , 1972 . V. Fedorov. Theory of Optimal Experiments. Academic Press, New York, 1972."},{"key":"e_1_3_2_1_12_1","volume-title":"Matrix Computations","author":"Golub G. H.","year":"1989","unstructured":"G. H. Golub and C. F. V. Loan . Matrix Computations . Johns Hopkins University Press, Baltimore , Maryland , 2 nd edition, 1989 . G. H. Golub and C. F. V. Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, Maryland, 2nd edition, 1989.","edition":"2"},{"key":"e_1_3_2_1_13_1","volume-title":"Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion","author":"Hansen P. C.","year":"1997","unstructured":"P. C. Hansen . Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion . SIAM , 1997 . P. C. Hansen. Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion. SIAM, 1997."},{"key":"e_1_3_2_1_14_1","volume-title":"Bayesian D-optimal supersaturated designs","author":"Jones B.","year":"2004","unstructured":"B. Jones , D. Lin , and C. Nachtsheim . Bayesian D-optimal supersaturated designs , 2004 . Submitted for publication. B. Jones, D. Lin, and C. Nachtsheim. Bayesian D-optimal supersaturated designs, 2004. Submitted for publication."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970654","volume-title":"Bayesian Statistics -- A Review","author":"Lindley D. V.","year":"1972","unstructured":"D. V. Lindley . Bayesian Statistics -- A Review . SIAM , Philadelphia, PA , 1972 . D. V. Lindley. Bayesian Statistics -- A Review. SIAM, Philadelphia, PA, 1972."},{"key":"e_1_3_2_1_16_1","unstructured":"A. Medina A. Lakhina I. Matta and J. Byers. Boston university representative Internet topology generator (BRITE). http:\/\/www.cs.bu.edu\/brite\/.  A. Medina A. Lakhina I. Matta and J. Byers. Boston university representative Internet topology generator (BRITE). http:\/\/www.cs.bu.edu\/brite\/."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633041"},{"key":"e_1_3_2_1_18_1","volume-title":"Applied Statistics","author":"Miller A. J.","year":"1994","unstructured":"A. J. Miller and N. K. Nguyen . A Fedorov exchange algorithm for D-optimal design . Applied Statistics , 1994 . A. J. Miller and N. K. Nguyen. A Fedorov exchange algorithm for D-optimal design. Applied Statistics, 1994."},{"key":"e_1_3_2_1_19_1","volume-title":"Technometrics","author":"Mitchell T. J.","year":"1974","unstructured":"T. J. Mitchell . An algorithm for the construction of D-optimal designs . Technometrics , 1974 . T. J. Mitchell. An algorithm for the construction of D-optimal designs. Technometrics, 1974."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/378420.378790"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9473(92)90064-M"},{"key":"e_1_3_2_1_22_1","volume-title":"Proc. of IEEE INFOCOM","author":"Padmanabhan V. N.","year":"2003","unstructured":"V. N. Padmanabhan , L. Qiu , and H. Wang . Server-based inference of Internet performance . In Proc. of IEEE INFOCOM , Mar. 2003 . V. N. Padmanabhan, L. Qiu, and H. Wang. Server-based inference of Internet performance. In Proc. of IEEE INFOCOM, Mar. 2003."},{"key":"e_1_3_2_1_23_1","unstructured":"Planetlab. http:\/\/www.planet-lab.org.  Planetlab. http:\/\/www.planet-lab.org."},{"key":"e_1_3_2_1_24_1","volume-title":"PDCO: Primal-Dual interior method for Convex Objectives","author":"Saunders M.","year":"2003","unstructured":"M. Saunders . PDCO: Primal-Dual interior method for Convex Objectives , 2003 . http:\/\/www.stanford.edu\/group\/SOL\/software\/pdco.html. M. Saunders. PDCO: Primal-Dual interior method for Convex Objectives, 2003. http:\/\/www.stanford.edu\/group\/SOL\/software\/pdco.html."},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. of USITS","author":"Spring N.","year":"2003","unstructured":"N. Spring , D. Wetherall , and T. Anderson . Scriptroute: A facility for distributed internet measurement . In Proc. of USITS , Mar. 2003 . N. Spring, D. Wetherall, and T. Anderson. Scriptroute: A facility for distributed internet measurement. In Proc. of USITS, Mar. 2003."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251086.1251116"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/781027.781053"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863990"}],"event":{"name":"SIGMETRICS06: 2006 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","location":"Saint Malo France","acronym":"SIGMETRICS06","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the joint international conference on Measurement and modeling of computer systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1140277.1140293","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1140277.1140293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:24Z","timestamp":1750244784000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1140277.1140293"}},"subtitle":["a flexible framework for large-scale network measurement"],"short-title":[],"issued":{"date-parts":[[2006,6,26]]},"references-count":27,"alternative-id":["10.1145\/1140277.1140293","10.1145\/1140277"],"URL":"https:\/\/doi.org\/10.1145\/1140277.1140293","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1140103.1140293","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2006,6,26]]},"assertion":[{"value":"2006-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}