Improving sketch reconstruction accuracy using linear least squares method

Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC

Volumn , Issue , 2005, Pages 273-278

  Lee, Gene Moo ^a   Liu, Huiya ^a   Yoon, Young ^a   Zhang, Yin ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR LEAST-SQUARES METHOD; MEMORY REQUIREMENTS; NETWORK ANOMALY DETECTION; OPTIMAL SOLUTIONS; RECONSTRUCTION ACCURACY; SKETCH DATA STRUCTURE; SPACE DATA STRUCTURES; TRAFFIC MONITORING;

DATA COMMUNICATION SYSTEMS; LINEAR SYSTEMS; SURFACE RECONSTRUCTION;

DATA STRUCTURES;

EID: 84878716195     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
2. Bell Labs I data set, 2002. http://pma.nlanr.net/Traces/long/bell1.html.
3. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Proceedings of ICALP '2002, pages 693-703, 2002. http://www.cs.princeton.edu/~moses/papers/frequent.ps.
4. G. Cormode and S. Muthukrishnan. What's hot and what's not: Tracking most frequent items dynamically. In Proceedings of ACM PODC '2003, July 2003.
5. G. Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. Proceedings of Latin American Theoretical Informatics (LATIN), pages 29-38, 2004.
6. C. Estan and G. Varghese. New directions in traffic measurement and accounting. Proceedings of ACM SIGCOMM, 2002.
7. P. Gibbons and Y. Matias. Synopsis structures for massive data sets. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1999.
8. B. Krishnamurthy, S. Sen, Y. Zhang, and Y. Chen. Sketch-based change detection: Methods, evaluation, and applications. Proceedings of ACM SIGCOMM Internet Measurement Conference, 2003.
9. A. Kumar, M. Sung, J. Xu, and J. Wang. Data streaming algorithms for efficient and accurate estimation of flow distribution. Proceedings of ACM Sigmetrics/Performance, 2004.
10. E. H. Moore. On the reciprocal of the general algebraic matrix. Bulletin of the American Mathematical Society, 26:394-395, 1920.
11. S. Muthukrishnan. Data streams: Algorithms and applications, 2003. Manuscript based on invited talk from 14th SODA. Available from http://www.cs.rutgers.edu/~muthu/stream-1-1.ps.
12. NLANR. http://www.nlanr.net/.
13. R. Penrose. A generalized inverse of matrices. Mathematical Proceedings of the Cambridge Philosophical Society, 51:406-412, 1955.
14. R. Schweller, A. Gupta, Y. Chen, and E. Parsons. Reversible sketches for efficient and accurate change detection over network data streams. Proceedings of ACM SIGCOMM Internet Measurement Conference, pages 207-212, 2004.
15. Teragrid-I 10GigE trace, 2004. http://pma.nlanr.net/Special/tera1.html.