Adaptive statistical optimization techniques for firewall packet filtering

Proceedings - IEEE INFOCOM

Volumn , Issue , 2006, Pages

  Hamed, Hazem ^a   El Atawy, Adel ^a   Al Shaer, Ehab ^a  

^a DEPAUL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SYSTEM FIREWALLS; DATA STRUCTURES; GATEWAYS (COMPUTER NETWORKS); OPTIMIZATION; QUALITY OF SERVICE; ROUTERS;

PACKET FILTERING; PACKET MATCHING TIME; PACKET REJECTION; STATISTICAL SEARCH TREES;

PACKET NETWORKS;

EID: 39049096178     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2006.129     Document Type: Conference Paper

References (23)

1. E. Al-Shaer and H. Hamed. Discovery of policy anomalies in distributed firewalls. In IEEE INFOCOM'04, March 2004.
2. F. Baboescu and G. Varghese. Scalable packet classification. In ACM SIGCOMM'01, 2001.
3. F. Baboescu and G. Varghese. Fast and scalable conflict detection for packet classifiers. Computer Networks, 42(6), 2003.
4. Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. John Wiley & sons, 1991.
5. A. L. Edwards. An Introduction to Linear Regression and Correlation. W. H. Freeman and Co, San Francisco, 1993.
6. A. El-Atawy, H. Hamed, and E. Al-Shaer. Adaptive statistical optimization techniques for firewall packet filtering. Technical Report CTI-TR-05-019, DePaul University, 2005.
7. A. Feldmann and S. Muthukrishnan. Tradeoffs for packet classification. In IEEE INFOCOM'00, March 2000.
8. A. Garsia and M. Wachs. A new algorithm for minimum cost binary trees. SIAM Journal on Computing, 6(4):622-642, 1977.
9. P. Gupta and N. McKeown. Algorithms for packet classification. IEEE Network, 15(2):24-32, 2001.
10. P. Gupta and N. McKeown. Packet classification using hierarchical intelligent cuttings. In Interconnects VII, August 1999.
11. P. Gupta, B. Prabhakar, and S. Boyd. Near optimal routing lookups with bounded worst case performance. In IEEE INFOCOM'00, 2000.
12. H. Hamed, E. Al-Shaer, and W. Marrero. Modeling and verification of IPSec and VPN security policies. In IEEE ICNP'05, Nov. 2005.
13. D.S. Hochbaum. Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing, pages 555-556, 1982.
14. T. C. Hu and A. C. Tucker. Optimal computer search trees and variable length alphabetic codes. SIAM Journal on Applied Mathematics, 21:514-532, 1971.
15. D. S. Johnson. Approximation algorithms for combinatorial problems. In STOC '73: Proceedings of the fifth annual ACM symposium on Theory of computing, pages 38-49, 1973.
16. D. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading, Massachusetts, second edition.
17. K. Lan and J. Heidemann. On the correlation of internet flow characteristics. Technical Report ISI-TR-574, USC/ISI, 2003.
18. A. J. McAulay and P. Francis. Fast routing table lookup using CAMs. In IEEE INFOCOM'93, March 1993.
19. Passive Measurement and Analysis Project, National Laboratory for Applied Network Research. Auckland-VIII Traces. http://pma.nlanr.net/Special/auck8. html, December 2003.
20. V. Srinivasan, Subhash Suri, and George Varghese. Packet classification using tuple space search. In Computer ACM SIGCOMM Communication Review, pages 135-146, October 1999.
21. Cisco Systems. Netflow services solutions guide. http://www.cisco.com, Oct. 2004.
22. Thomas Y. C. Woo. A modular approach to packet classification: Algorithms and results. In IEEE INFOCOM'00, pages 1213-1222, March 2000.
23. A. Wool. A quantitative study of firewall configuration errors. IEEE Computer, 37(6):62-67, 2004.