A. Lakhina, M. Crovella, and C. Diot, Mining anomalies using traffic feature distributions, Procs of the ACM Conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM), 2005.
DOI : 10.1145/1080091.1080118
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.4156

T. Qiu, Z. Ge, D. Pei, J. Wang, and J. Xu, What happened in my network, Proceedings of the 10th annual conference on Internet measurement, IMC '10, 2010.
DOI : 10.1145/1879141.1879202

D. S. Yeung, Covariance-Matrix Modeling and Detecting Various Flooding Attacks, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, vol.37, issue.2, pp.157-169, 2007.
DOI : 10.1109/TSMCA.2006.889480

Y. Zhu, X. Fu, B. Graham, R. Bettati, and W. Zhao, On Flow Correlation Attacks and Countermeasures in Mix Networks, Procs of the 4th ACM International Conference on Privacy Enhancing Technologies (PET), 2004.
DOI : 10.1007/11423409_13

S. Ganguly, M. Garafalakis, R. Rastogi, and K. Sabnani, Streaming Algorithms for Robust, Real-Time Detection of DDoS Attacks, 27th International Conference on Distributed Computing Systems (ICDCS '07), 2007.
DOI : 10.1109/ICDCS.2007.142

S. Jin and D. Yeung, A covariance analysis model for ddos attack detection, 4th IEEE International Conference on Communications, pp.1882-1886, 2004.

E. Anceaume, Y. Busnel, and S. Gambs, Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes, Procs of the 14th International Conference on Principles of Distributed Systems (OPODIS), 2010.
DOI : 10.1007/11561071_71
URL : https://hal.archives-ouvertes.fr/hal-00554219

Z. Bar-yossef, T. S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan, Counting Distinct Elements in a Data Stream, 6th International Workshop on Randomization and Approximation Techniques (RANDOM)
DOI : 10.1007/3-540-45726-7_1

P. Flajolet and G. N. Martin, Probabilistic counting algorithms for data base applications, Journal of Computer and System Sciences, vol.31, issue.2, pp.182-209, 1985.
DOI : 10.1016/0022-0000(85)90041-8
URL : https://hal.archives-ouvertes.fr/inria-00076244

D. M. Kane, J. Nelson, and D. P. Woodruff, An optimal algorithm for the distinct elements problem, Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems of data, PODS '10, 2010.
DOI : 10.1145/1807085.1807094

N. Alon, Y. Matias, and M. Szegedy, The space complexity of approximating the frequency moments, Procs of the 22th ACM Symposium on Theory of computing (STOC), 1996.

M. Charikar, K. Chen, and M. Farach-colton, Finding frequent items in data streams, Theoretical Computer Science, vol.312, issue.1, pp.3-15, 2004.
DOI : 10.1016/S0304-3975(03)00400-6

A. Chakrabarti, G. Cormode, and A. Mcgregor, A near-optimal algorithm for computing the entropy of a stream, Procs of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007.

A. Lall, V. Sekar, M. Ogihara, J. Xu, and H. Zhang, Data streaming algorithms for estimating entropy of network traffic, Procs of the Joint International ACM Conference on Measurement and Modeling of Computer systems (SIGMETRICS), 2006.

E. Anceaume, Y. Busnel, and S. Gambs, On the Power of the Adversary to Solve the Node Sampling Problem, Transactions on Large-Scale Dataand Knowledge-Centered Systems (TLDKS), pp.102-126, 2013.
DOI : 10.1007/978-3-642-45269-7_5
URL : https://hal.archives-ouvertes.fr/hal-00926485

E. Anceaume and Y. Busnel, A Distributed Information Divergence Estimation over Data Streams, IEEE Transactions on Parallel and Distributed Systems, vol.25, issue.2, pp.478-487, 2014.
DOI : 10.1109/TPDS.2013.101
URL : https://hal.archives-ouvertes.fr/hal-00998708

G. Cormode, S. Muthukrishnan, and K. Yi, Algorithms for distributed functional monitoring, Procs of the 19th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), 2008.
DOI : 10.1145/1921659.1921667

C. Arackaparambil, J. Brody, and A. Chakrabarti, Functional Monitoring without Monotonicity, Procs of the 36th ACM International Colloquium on Automata, Languages and Programming, 2009.
DOI : 10.1007/978-3-642-02927-1_10

P. B. Gibbons and S. Tirthapura, Estimating simple functions on the union of data streams, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '01, pp.281-291, 2001.
DOI : 10.1145/378580.378687

Z. Haung, K. Yi, and Q. Zhang, Randomized algorithms for tracking distributed count, frequencies, and ranks, Proceedings of the 31st symposium on Principles of Database Systems, PODS '12, 2012.
DOI : 10.1145/2213556.2213596

Z. Liu, B. Radunovic, and M. Vojnovic, Continuous distributed counting for non-monotonic streams, Proceedings of the 31st symposium on Principles of Database Systems, PODS '12, 2012.
DOI : 10.1145/2213556.2213597

J. Yuan and K. Mills, Monitoring the macroscopic effect of DDoS flooding attacks, IEEE Transactions on Dependable and Secure Computing, vol.2, issue.4, 2005.

. Muthukrishnan, Data Streams: Algorithms and Applications, Foundations and Trends?? in Theoretical Computer Science, vol.1, issue.2, 2005.
DOI : 10.1561/0400000002

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.
DOI : 10.1016/j.jalgor.2003.12.001