论文信息 - An improved analysis of the lossy difference aggregator

An improved analysis of the lossy difference aggregator

We provide a detailed analysis of the Lossy Difference Aggregator, a recently developed data structure for measuring latency in a router environment where packet losses can occur. Our analysis provides stronger performance bounds than those given originally, and leads us to a model for how to optimize the parameters for the data structure when the loss rate is not known in advance by using competitive analysis.

Michael Mitzenmacher | Hilary Finucane | M. Mitzenmacher | H. Finucane

[1] George Varghese,et al. Every microsecond counts: tracking fine-grain latencies with a lossy difference aggregator , 2009, SIGCOMM '09.

[2] Eli Upfal,et al. Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[3] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[4] Donald E. Knuth,et al. The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[5] Donald E. Knuth,et al. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[6] Kai-Min Chung,et al. Why simple hash functions work: exploiting the entropy in a data stream , 2008, SODA '08.

[7] George Varghese,et al. Bitmap algorithms for counting active flows on high speed links , 2003, IMC '03.