Adaptive shared-state sampling

Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC

Volumn , Issue , 2008, Pages 271-284

  Raspall, Frederic ^a   Sallent, Sebastia ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Frequent items; Heavy hitters; Sampling; Scalability

Indexed keywords

EMPIRICAL RESULTS; FREQUENT ITEMS; HEAVY-HITTERS; HIGH PROBABILITIES; MALICIOUS TRAFFICS; PERFORMANCE GUARANTEES; REAL TRAFFICS; SOFTWARE IMPLEMENTATIONS; TRAFFIC MIXES;

INTERNET; SEMICONDUCTING INTERMETALLICS;

SCALABILITY;

EID: 63049105894     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1452520.1452552     Document Type: Conference Paper

References (16)

1. Internet Measurement Data Catalog, www.datcat.org.
2. A. Arasu and G. S. Manku. Approximate counts and quantiles over sliding windows. In Proceedings of ACM SIGMOD-SIGACT-SIGART, pages 286-296, New York, NY, USA, 2004. ACM.
3. S. Bhattacharyya, A. Madeira, S. Muthukrishnan, and T. Ye. How to scalably and accurately skip past streams. In Proceedings of IEEE &3rd International Conference on Data Engineering, pages 654-663, 2007.
4. G. Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. Journal of Algorithms, 55:58-75, 2003.
5. G. Cormode and S. Muthukrishnan. What's hot and what's notitracking most frequent items dynamically. In ACM TODS, pages 249-278, 2005.
6. X. Dimitropoulos, P. Hurley, and A. Kind. Probabilistic lossy counting: a,n efficient algorithm for finding heavy hitters. SIGCOMM Comput. Commun. Rev., 38(1):5-5, 2008.
7. C. Estan and G. Varghese. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACAi TOCS, 21(3):270-313, 2003.
8. L. Golab, D. DeHaan, E. Demaine, A. Lopez-Ortiz, and J. Munro. Finding frequent items in sliding windows with multinomial-distributed item frequencies. In Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.
9. L. Golab, D. DeHaan, E. D. Demaine, A. Lopez-Ortiz, and J. I. Munro. Identifying frequent items in sliding windows over on-line packet streams. In Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, pages 173-178, New York, NY, USA, 2003. ACM.
10. R. M. Karp, S. Shenker, and C. H. Papadimitriou. A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst., 28(1):51-55, 2003.
11. G. S. Manku and R. Motwani. Approximate frequency counts over data streams. In VLDB '02, pages 346-357. VLDB Endowment, 2002.
12. NLANR. http://pma.nlanr.net/traces/.
13. F. Raspall and S. Salient. Shared-State Sampling, technical report; av. at http://147.83.113.45/s3tr.pdf.
14. F. Raspall, S. Salient, and J. Yufera. Shared-State Sampling. In Proceedings of the 6th ACM SIGCOMM Internet Measurement Conference, pages 1-14, 2006.
15. S. Singh, C. Estan, G. Varghese, and S. Savage. Automated worm fingerprinting. In OSDI'04: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation, 2004.
16. H. Toivonen. Sampling large databases for association rules. In VLDB '96, 1996.