C. , Data Streams: Models and Algorithms, 2007.

C. Barakat, G. Iannaccone, and C. Diot, Ranking Flows From Sampled Traffic, Proceedings of the 2005 ACM conference on Emerging network experiment and technology, pp.188-199, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00070732

S. Bhattacharyya, A. Madeira, S. Muthukrishnan, and T. Ye, How To Scalably and Accurately Skip Past Streams, Proceedings of the IEEE 23rd International Conference on Data Engineeringg, pp.654-663, 2007.

T. Bu, J. Cao, A. Chen, and P. P. Lee, Sequential Hashing: A Flexible Approach for Unveiling Significant Patterns in High Speed Networks, Computer Network, vol.54, issue.18, pp.3309-3326, 2010.

G. Cormode and S. Muthukrishnan, An Improved Data Stream Summary: The Count-Min Sketch and its Applications, Journal of Algorithms, vol.55, issue.1, pp.58-75, 2005.

E. D. Demaine, A. López-ortiz, and J. I. Munro, Frequency Estimation of Internet Packet Streams with Limited Space, Proceedings of the 10th Annual European Symposium on Algorithms, pp.348-360, 2002.

X. Dimitropoulos, P. Hurley, and A. Kind, Probabilistic Lossy Counting: An Efficient Algorithm for Finding Heavy-hitters, ACM SIGCOMM Computer Communications Review, vol.38, issue.1, pp.5-5, 2008.

N. Duffeld, C. Lund, and M. Thorup, Flow Sampling Under Hard Resource Constraints, Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, pp.85-96, 2004.

N. Kamiyama and T. Mori, Simple and Accurate Identification of High-rate Flows by Packet Sampling, Proceedings of the 25th IEEE International Conference on Computer Communications, pp.2836-2848, 2006.

M. Kodialam, T. V. Lakshman, and S. Monhanty, Runs Based Traffic Estimator (RATE): A Simple, Memory Efficient Scheme for Per-Flow Rate Estimation, Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, pp.1808-1818, 2004.

X. Li and Z. H. Deng, Mining Frequent Patterns from Network Flows for Monitoring Network, Expert System with Applications, vol.37, issue.12, pp.8850-8860, 2010.

G. S. Manku and R. Motwani, Approximate Frequency Counts over Data Streams, Proceedings of the 28th International Conference on Very Large Data Bases, pp.346-357, 2002.

N. Pasquier, Y. Bastide, R. Touil, and L. Lakhal, Discovering Frequent Closed Itemsets, Proceedings of the 7th International Conference on Database Theory, pp.398-416, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00467747

Q. Rong, G. Zhang, G. Xie, and K. Salamatian, Mnemonic Lossy Counting: An Efficient and Accurate Heavy-hitters Identification Algorithm, Proceedings of the 29th IEEE International Performance Computing and Communications Conference, 2010.

Y. Zhang, B. X. Fang, and Y. Z. Zhang, Identifying Heavy-hitters in High-speed Network Monitoring, Science China, vol.53, issue.3, pp.659-676, 2010.

Z. Zhang, B. Wang, S. Chen, and K. Zhu, Mining Frequent Flows Based on Adaptive Threshold with a Sliding Window over Online Packet Stream, Proceedings of the International Conference on Communication Software and Networks, pp.210-214, 2009.