A. Bremler-barr and Y. Koral, Accelerating Multi-Patterns Matching on Compressed HTTP Traffic, IEEE INFOCOM 2009, The 28th Conference on Computer Communications, 2009.
DOI : 10.1109/INFCOM.2009.5061944
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.513.6467

J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, pp.337-343, 1977.
DOI : 10.1109/TIT.1977.1055714
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.8921

D. Huffman, A method for the construction of minimum-redundancy codes, Proceedings of IRE, p.10981101, 1952.

M. Fisk and G. Varghese, An analysis of fast string matching applied to contentbased forwarding and intrusion detection, 2002.

A. Aho and M. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975.
DOI : 10.1145/360825.360855

R. Boyer and J. Moore, A fast string searching algorithm, Communications of the ACM, vol.20, issue.10, pp.762-772, 1977.
DOI : 10.1145/359842.359859

W. Lin and B. Liu, Pipelined Parallel AC-Based Approach for Multi-String Matching, 2008 14th IEEE International Conference on Parallel and Distributed Systems, 2008.
DOI : 10.1109/ICPADS.2008.47
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.568.2411

J. Van-lunteren, High-Performance Pattern-Matching for Intrusion Detection, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, pp.1-13, 2006.
DOI : 10.1109/INFOCOM.2006.204

L. Tan and T. Sherwood, Architectures for bit-split string scanning in intrusion detection, pp.110-117, 2006.

M. F. Oberhumer, Top sites, 2010.