×

zbMATH — the first resource for mathematics

Comment: Monitoring networked applications with incremental quantile estimation. (English) Zbl 1426.62386
Summary: Our comments are in two parts. First, we make some observations regarding the methodology in [J. M. Chambers et al., Stat. Sci. 21, No. 4, 463–475 (2006; Zbl 1426.62379)]. 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.
MSC:
62P30 Applications of statistics in engineering and industry; control charts
PDF BibTeX XML Cite
Full Text: DOI Euclid
References:
[1] 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. · Zbl 0278.68033 · doi:10.1016/S0022-0000(73)80033-9
[2] 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.
[3] 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. · Zbl 1192.68962 · doi:10.1145/509907.509966
[4] 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.
[5] 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.
[6] 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. · Zbl 1323.68567 · doi:10.1145/380752.380841
[7] Information Sciences Institute (2004). The Network Simulator. Information Sciences Institute. Available at www.isi.edu/nsnam/ns.
[8] 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. · Zbl 1110.62163 · doi:10.1111/j.1467-9868.2006.00567.x
[9] 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.
[10] Paterson, M. (1996). Progress in selection. In Algorithm Theory—SWAT’96. Lecture Notes in Comput. Sci. 1097 368–379. Springer, London.
[11] 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.
[12] Xi, B., Michailidis, G. and Nair, V. N. (2006). Estimating network loss rates using active tomography. J. Amer. Statist. Assoc. 101 1430–1448. · Zbl 1171.62368 · doi:10.1198/016214506000000366
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.