An improved analysis of the lossy difference aggregator

Computer Communication Review

Volumn 40, Issue 2, 2010, Pages 4-11

  Finucane, Hilary ^a   Mitzenmacher, Michael ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Competitive analysis; Hashing algorithms; Latency measurement; Lossy Difference Aggregator

Indexed keywords

COMPETITIVE ANALYSIS; HASHING ALGORITHMS; LOSS RATES; LOSSY DIFFERENCE AGGREGATOR; MEASURING LATENCY; PERFORMANCE BOUNDS;

COMMUNICATION;

DATA STRUCTURES;

EID: 82955238461     PISSN: 01464833     EISSN: 19435819     Source Type: Conference Proceeding    
DOI: 10.1145/1764873.1764875     Document Type: Article

References (5)

1. C. Estan, G. Varghese, and M. Fisk. Bitmap Algorithms for Counting Active Flows on High Speed Links. IEEE/ACM Transactions on Networking, volume 14, number 5, pp. 925-937, 2006.
2. D. E. Knuth. The Art of Computer Programming, Volume 1: Fundamental Algorithms (3rd Edition). Addison-Wesley, 1997.
3. R. Kompella, K. Levchenko, A. Snoeren, and G. Varghese. Every Microsecond Counts: Tracking Fine-Grain Latencies with a Lossy Difference Aggregator. In Proceedings of SIGCOMM 2009.
4. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
5. M. Mitzenmacher and S. Vadhan. Why simple hash functions work: exploiting the entropy in a data stream. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 746-755, 2008.