B. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, vol.13, issue.7, pp.422-426, 1970.
DOI : 10.1145/362686.362692

K. Bratbergsengen, Hashing methods and relational algebra operations, Proceedings of the Tenth International Conference on Very Large Data Base, pp.323-333, 1984.

Y. Chabchoub, C. Fricker, H. M. Mohamed, A. Ghandour, K. Fawaz et al., Analysis of a Bloom Filter algorithm via the supermarket model Slow port scanning detection, Proceedings of the 7th conference on Information Assurance and Security (IAS), pp.128-133, 2009.

M. Devivo, E. Carrasco, G. Isern, and G. O. Devivo, A review of port scanning techniques, SIGCOMM Computer Communications Review, 1999.

D. K. Dilip, W. C. Feng, K. G. Shin, and D. Saha, Stochastic fair blue: A queue management algorithm for enforcing fairness, Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM-01), pp.1520-1529, 2001.

P. Druschel and A. Rowstron, Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility, Proceedings of the Eighteenth ACM Symposium on Operations Systems Principles, pp.188-201, 2001.

C. Estan and G. Varghese, New directions in traffic measurement and accounting, Proceedings of the ACM 2002 SIGCOMM, 2002.

J. A. Fan, P. Cao, and A. Z. Broder, Summary cache: a scalable wide-area Web cache sharing protocol, IEEE/ACM Transactions on Networking, vol.8, issue.3, pp.281-293, 2000.
DOI : 10.1109/90.851975

P. Flajolet, E. Fusy, O. Gandouet, and F. Meunier, Hyperloglog: the analysis of a nearoptimal cardinality estimation algorithm, Proceedings of the 13th conference on analysis of algorithm (AofA 07), pp.127-146, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00406166

P. Flajolet and 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

F. Giroire and E. Fusy, Estimating the number of active flows in a data stream over a sliding window, Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALC0), pp.223-231, 2007.

B. Gronvall, Scalable multicast forwarding, Poster in the ACM 2002 SIGCOMM Conference, 2002.
DOI : 10.1145/510726.510742

T. Heberlein, G. Dias, K. Levitt, B. Mukherjee, J. Wood et al., A network security monitor, Proceedings of RISP90, 1990.

M. D. Mcilroy, Development of a Spelling List, IEEE Transactions on Communications, vol.30, issue.1, pp.91-99, 1982.
DOI : 10.1109/TCOM.1982.1095395

H. Monowar, D. K. Bhattacharyya, and J. K. Kalita, Surveying port scans and their detection methodologies, Computer Journal, 2010.

J. K. Mullin, Optimal semijoins for distributed database systems, IEEE Transactions on Software Engineering, vol.16, issue.5, 1990.
DOI : 10.1109/32.52778

J. K. Mullin and D. J. Margoliash, A tale of three spelling checkers. Software Practice and Experience, pp.625-630, 1990.

. Nessus, Tenable network security inc. Columbia. nessus

S. Robertson, E. V. Siegel, M. Miller, and S. J. Stolfo, Surveillance detection in high bandwidth environments, Proceedings DARPA Information Survivability Conference and Exposition, 2003.
DOI : 10.1109/DISCEX.2003.1194879

M. Roesch, Snort-lightweight intrusion detection for networks, Proceedings of LISA99, 1999.

S. Staniford, J. A. Hoagland, and J. M. Mcalerney, Practical automated detection of stealthy portscans, Journal of Computer Security, vol.10, issue.1-2, pp.105-136, 2002.
DOI : 10.3233/JCS-2002-101-205

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, Chord, Proceedings of the ACM 2001 SIGCOMM Conference), pp.149-160, 2001.
DOI : 10.1145/964723.383071

A. Whitaker and D. Wetherall, Forwarding without loops in Icarus, 2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571), pp.63-75, 2002.
DOI : 10.1109/OPNARC.2002.1019229