Name
Abstract | ||
|---|---|---|
In this paper we focus on the process of deep packet inspection of compressed web traffic. The major limiting factor in this process imposed by the compression, is the high memory requirements of 32KB per connection. This leads to the requirements of hundreds of megabytes to gigabytes of main memory on a multi-connection setting. We introduce new algorithms and techniques that drastically reduce this space requirement for such bump-in-the-wire devices like security and other content based networking tools. Our proposed scheme improves both space and time performance by almost 80% and over 40% respectively, thus making real-time compressed traffic inspection a viable option for networking devices. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.comcom.2012.01.017 | Computer Communications |
Keywords | Field | DocType |
high memory requirement,multi-connection setting,web traffic,space efficient deep packet,new algorithm,traffic inspection,bump-in-the-wire device,space requirement,networking device,main memory,deep packet inspection,network security,pattern matching | Web traffic,Deep packet inspection,Deep content inspection,High memory,Computer science,Megabyte,Network security,Networking hardware,Gigabyte,Computer network,Real-time computing | Journal |
Volume | Issue | ISSN |
35 | 7 | 0140-3664 |
Citations | PageRank | References |
3 | 0.41 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yehuda Afek | 1 | 1840 | 176.95 |
| Anat Bremler-Barr | 2 | 505 | 39.95 |
| Yaron Koral | 3 | 97 | 5.74 |