Statistical Science

Comment: Monitoring Networked Applications With Incremental Quantile Estimation

Earl Lawrence, George Michailidis, and Vijayan N. Nair

Full-text: Open access

Abstract

Our comments are in two parts. First, we make some observations regarding the methodology in Chambers et al. Second, we briefly describe another interesting network monitoring problem that arises in the context of assessing quality of service, such as loss rates and delay distributions, in packet-switched networks.

Article information

Source
Statist. Sci., Volume 21, Number 4 (2006), 479-482.

Dates
First available in Project Euclid: 23 April 2007

Permanent link to this document
https://projecteuclid.org/euclid.ss/1177334522

Digital Object Identifier
doi:10.1214/088342306000000600

Mathematical Reviews number (MathSciNet)
MR2380711

Zentralblatt MATH identifier
05191836

Citation

Lawrence, Earl; Michailidis, George; Nair, Vijayan N. Comment: Monitoring Networked Applications With Incremental Quantile Estimation. Statist. Sci. 21 (2006), no. 4, 479--482. doi:10.1214/088342306000000600. https://projecteuclid.org/euclid.ss/1177334522


Export citation

References

  • Blum, M., Pratt, V. R., Tarjan, R. E., Floyd, R. W. and Rivest, R. L. (1973). Time bounds for selection. J. Comput. System Sci. 7 448--461.
  • Dasu, T., Johnson, T., Muthukrishnan, S. and Shkapenyuk, V. (2002). Mining database structure; or, how to build a data quality browser. In Proc. 2002 ACM SIGMOD International Conference on Management of Data 240--251. ACM Press, New York.
  • Gilbert, A. C., Guha, S., Indyk, P., Kotidis, Y., Muthukrishnan, S. and Strauss, M. J. (2002). Fast, small-space algorithms for approximate histogram maintenance. In Proc. 34th Annual ACM Symposium on Theory of Computing 389--398. ACM Press, New York.
  • Gilbert, A. C., Kotidis, Y., Muthukrishnan, S. and Strauss, M. J. (2002). How to summarize the universe: Dynamic maintenance of quantiles. In Proc. 28th International Conference on Very Large Data Bases 454--465. Morgan Kaufman, San Francisco.
  • Greenwald, M. and Khanna, S. (2001). Space-efficient online computation of quantile summaries. In Proc. 2001 ACM SIGMOD International Conference on Management of Data 58--66. ACM Press, New York.
  • Guha, S., Koudas, N. and Shim, K. (2001). Data-streams and histograms. In Proc. 33rd Annual ACM Symposium on Theory of Computing 471--475. ACM Press, New York.
  • Information Sciences Institute (2004). The Network Simulator. Information Sciences Institute. Available at www.isi.edu/nsnam/ns.
  • Lawrence, E., Michailidis, G. and Nair, V. N. (2006). Network delay tomography using flexicast experiments. J. R. Stat. Soc. Ser. B Stat. Methodol. 68 785--813.
  • Manku, G. S., Rajagopalan, S. and Lindsey, B. G. (1998). Approximate medians and other quantiles in one-pass and with limited memory. In Proc. 1998 ACM SIGMOD International Conference on Management of Data 426--435. ACM Press, New York.
  • Paterson, M. (1996). Progress in selection. In Algorithm Theory---SWAT'96. Lecture Notes in Comput. Sci. 1097 368--379. Springer, London.
  • Srikant, R. and Agrawal, R. (1996). Mining quantitative association rules in large relational tables. In Proc. 1996 ACM SIGMOD International Conference on Management of Data 1--12. ACM Press, New York.
  • Xi, B., Michailidis, G. and Nair, V. N. (2006). Estimating network loss rates using active tomography. J. Amer. Statist. Assoc. 101 1430--1448.