Space efficient deep packet inspection of compressed web traffic

Computer Communications

Volumn 35, Issue 7, 2012, Pages 810-819

  Afek, Yehuda ^a   Bremler Barr, Anat ^b   Koral, Yaron ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b INTERDISCIPLINARY CENTER   (Israel)

Author keywords

Compressed http; Deep packet inspection; Network security; Pattern matching

Indexed keywords

CONTENT-BASED NETWORKING; DEEP PACKET INSPECTION; LIMITING FACTORS; MAIN MEMORY; MEMORY REQUIREMENTS; MULTI-CONNECTION; NETWORKING DEVICES; SPACE AND TIME; SPACE EFFICIENT; SPACE REQUIREMENTS; WEB TRAFFIC;

HTTP; NETWORK SECURITY; PATTERN MATCHING; WORLD WIDE WEB;

PACKET NETWORKS;

EID: 84858703663     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2012.01.017     Document Type: Conference Paper

References (36)

1. A. Bremler-Barr, Y. Koral, Accelerating multi-patterns matching on compressed http traffic., in: INFOCOM, IEEE, 2009, pp. 397-405.
2. Y. Afek, A. Bremler-Barr, and Y. Koral Efficient processing of multi-connection compressed web traffic Proceedings of the 10th international IFIP TC 6 conference on Networking - Part I, Networking'11 2011 Springer-Verlag Berlin, Heidelberg 52 65
3. Hypertext transfer protocol - 1.1, June 1999. RFC 2616, .
4. J. Ziv, and A. Lempel A universal algorithm for sequential data compression IEEE Transactions on Information Theory 23 1977 337 343
5. D. A. Huffman, A method for the construction of minimum-redundancy codes, in: Proceedings of the Institute of Radio Engineers, vol. 40, 1952, pp. 1098-1101.
6. zlib 1.2.5, April 2010. .
7. M. Fisk, G. Varghese, An analysis of fast string matching applied to content-based forwarding and intrusion detection, Techical Report CS2001-0670 (updated version) 2002.
8. A.V. Aho, and M.J. Corasick Efficient string matching: an aid to bibliographic search Communications ACM 18 1975 333 340
9. R.S. Boyer, and J.S. Moore A fast string searching algorithm Communications ACM 20 1977 762 772
10. N. Tuck, T. Sherwood, B. Calder, G. Varghese, Deterministic memory-efficient string matching algorithms for intrusion detection, in: INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 4, pp. 2628-2639.
11. Clam antivirus, 2010. (version 0.82).
12. Snort, 2010. . (accessed on May 2010).
13. T. Song, W. Zhang, D. Wang, Y. Xue, A memory efficient multiple pattern matching architecture for network security, in: INFOCOM, pp. 166-170.
14. J. van Lunteren, High-performance pattern-matching for intrusion detection, in: INFOCOM, IEEE, 2006.
15. V. Dimopoulos, I. Papaefstathiou, D.N. Pnevmatikatos, A memory-efficient reconfigurable Aho-Corasick FSM implementation for intrusion detection systems, in: H. Blume, G. Gaydadjiev, C.J. Glossner, P.M.W. Knijnenburg (Eds.), ICSAMOS, IEEE, 2007, pp. 186-193.
16. M. Alicherry, M. Muthuprasanna, V. Kumar, High speed pattern matching for network ids/ips, in: Proceedings of the 2006 IEEE International Conference on Network Protocols, IEEE Computer Society, Washington, DC, USA, 2006, pp. 187-196.
17. L. Tan, T. Sherwood, Architectures for bit-split string scanning in intrusion detection, in: IEEE Micro, vol. 26, 2006, pp. 110-117. (Pubitemid 43380042)
18. A. Amir, G. Benson, and M. Farach Let sleeping files lie: pattern matching in z-compressed files Journal of Computer and System Sciences 1996 299 307 (Pubitemid 126375142)
19. T. Kida, M. Takeda, A. Shinohara, S. Arikawa, Shift-and approach to pattern matching in LZW compressed text, in: 10th Annual Symposium on Combinatorial Pattern Matching, (CPM 99), 1999.
20. G. Navarro, M. Raffinot, A general practical approach to pattern matching over ziv-lempel compressed text, in: 10th Annual Symposium on Combinatorial Pattern Matching (CPM 99), 1999.
21. G. Navarro, J. Tarhio, Boyer-moore string matching over ziv-lempel compressed text, in: Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, 2000, pp. 166-180.
22. M. Farach, M. Thorup, String matching in lempel-ziv compressed strings, in: 27th annual ACM symposium on the theory of computing, 1998, pp. 703-712.
23. L. Gasieniec, M. Karpinski, W. Plandowski, and W. Rytter Efficient algorithms for lempel-ziv encoding (extended abstract) Proceedings 4th Scandinavian Workshop on Algorithm Theory 1996 Springer-Verlag 392 403 (Pubitemid 126091945)
24. S. Klein, D. Shapira, A new compression method for compressed matching, in: Proceedings of data compression conference DCC-2000, Snowbird, Utah, 2000, pp. 400-409. (Pubitemid 30588716)
25. A. Bremler-Barr, Y. Koral, V. Zigdon, Multi-pattern matching in compressed communication traffic, in: Workshop on High Performance Switching and Routing (HPSR 2011), Cartagena, Spain, 2011.
26. S. Wu, U. Manber, A fast algorithm for multi-pattern searching, Technical Report TR94-17, May 1994.
27. M. F. Oberhumer, LZO, April 2010. .
28. GB-800/GB-800eDataSheet, 2010. .
29. SonicWALLPRO 3060, 2010. .
30. StoneGate FW/VPN Appliances, 2010. .
31. srx5800 specification, 2010. .
32. Cisco ASA 5500 series, 2010. .
33. P. Deutsch, Gzip file format specification, May 1996. RFC 1952, .
34. T. H. Cormen, C. Stein, R. L. Rivest, C. E. Leiserson, Introduction to Algorithms, McGraw-Hill Higher Education, 2nd edition, 2001.
35. Top sites, July 2010. .
36. W. Lin, B. Liu, Pipelined parallel ac-based approach for multi-string matching, in: Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems, IEEE Computer Society, Washington, DC, USA, 2008, pp. 665-672.