메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 332-342

Dynamic rule-ordering optimization for high-speed firewall filtering

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; HIGH SPEED NETWORKS; INTERNET PROTOCOLS; OPTIMIZATION; PACKET NETWORKS; TELECOMMUNICATION TRAFFIC;

EID: 34247345394     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1128817.1128867     Document Type: Conference Paper
Times cited : (81)

References (29)
  • 4
    • 33244487487 scopus 로고    scopus 로고
    • Packet classification in large TSPs: Design and evaluation of decision tree classifiers
    • E. Cohen and C. Lund. Packet classification in large TSPs: Design and evaluation of decision tree classifiers. ACM SIGMETRICS Performance Evaluation Review, 33(1):73-84, 2005.
    • (2005) ACM SIGMETRICS Performance Evaluation Review , vol.33 , Issue.1 , pp. 73-84
    • Cohen, E.1    Lund, C.2
  • 6
    • 74849101820 scopus 로고
    • Optimizing and applixation in deterministic seuquencing and scheduling: A surevey
    • R. Graham, E. Lawler, J. Lenstra, and A. Kan. Optimizing and applixation in deterministic seuquencing and scheduling: A surevey. Annals of Discrete Mathematics, 5, 1979.
    • (1979) Annals of Discrete Mathematics , vol.5
    • Graham, R.1    Lawler, E.2    Lenstra, J.3    Kan, A.4
  • 7
    • 0035278163 scopus 로고    scopus 로고
    • Algorithms for packet classification
    • P. Gupta and N. McKeown. Algorithms for packet classification. IEEE Network, 15(2):24-32, 2001.
    • (2001) IEEE Network , vol.15 , Issue.2 , pp. 24-32
    • Gupta, P.1    McKeown, N.2
  • 8
    • 33749829094 scopus 로고    scopus 로고
    • Packet classification using hierarchical intelligent cuttings
    • August
    • P. Gupta and N. McKeown. Packet classification using hierarchical intelligent cuttings. In Interconnects VII, August 1999.
    • (1999) Interconnects VII
    • Gupta, P.1    McKeown, N.2
  • 9
    • 0033885345 scopus 로고    scopus 로고
    • Near optimal routing lookups with bounded worst case performance
    • P. Gupta, B. Prabhakar, and S. Boyd. Near optimal routing lookups with bounded worst case performance. In IEEE INFOCOM'00, 2000.
    • (2000) IEEE INFOCOM'00
    • Gupta, P.1    Prabhakar, B.2    Boyd, S.3
  • 10
    • 33747827114 scopus 로고    scopus 로고
    • Adaptive statistical optimization techniques for firewall packet filtering
    • Technical Report TR-05-012, DePaul University
    • H. Hamed and E. Al-Shaer. Adaptive statistical optimization techniques for firewall packet filtering. Technical Report TR-05-012, DePaul University, 2005.
    • (2005)
    • Hamed, H.1    Al-Shaer, E.2
  • 12
    • 17644384166 scopus 로고    scopus 로고
    • On the correlation of internet flow characteristics
    • Technical Report ISI-TR-574, USC/ISI
    • K. Lan and J. Heidemann. On the correlation of internet flow characteristics. Technical Report ISI-TR-574, USC/ISI, 2003.
    • (2003)
    • Lan, K.1    Heidemann, J.2
  • 13
    • 77951587888 scopus 로고
    • Sequencing jobs to minimize total weighted completion time subject to precedence constraints
    • E. Lawler. Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Annals of Discrete Mathematics, 2, 1978.
    • (1978) Annals of Discrete Mathematics , vol.2
    • Lawler, E.1
  • 14
    • 0017924416 scopus 로고
    • Complexity of scheduling under precendence constraints
    • J. Lenstra and A. Kan. Complexity of scheduling under precendence constraints. Operations Research, 26(1), 1978.
    • (1978) Operations Research , vol.26 , Issue.1
    • Lenstra, J.1    Kan, A.2
  • 16
    • 33747853416 scopus 로고    scopus 로고
    • Passive Measurement and Analysis Project, National Laboratory for Applied Network Research, December
    • Passive Measurement and Analysis Project, National Laboratory for Applied Network Research. Auckland-VIII Traces. http://pma.nlanr.net./Special/auck8. html, December 2003.
    • (2003) Auckland-VIII Traces
  • 18
    • 0016917230 scopus 로고
    • On self-organizing sequenctial search heuristics
    • R. Rivest. On self-organizing sequenctial search heuristics. Communications of the ACM, 19(2), 1976.
    • (1976) Communications of the ACM , vol.19 , Issue.2
    • Rivest, R.1
  • 19
    • 0001175273 scopus 로고    scopus 로고
    • Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
    • th International IPCO Conference, 1996.
    • (1996) th International IPCO Conference
    • Schulz, A.1
  • 21
    • 34247370873 scopus 로고    scopus 로고
    • Cisco Syslonis. Optimizing ACLs. User Guide for ACL Manager 1.4, CiscoWorks2000, 2002.
    • Cisco Syslonis. Optimizing ACLs. User Guide for ACL Manager 1.4, CiscoWorks2000, 2002.
  • 23
    • 25844441677 scopus 로고    scopus 로고
    • Scalable packet classification using distributed crossproducting of field labels
    • D. Taylor and J. Turner. Scalable packet classification using distributed crossproducting of field labels. In IEEE INFOCOM, 2005.
    • (2005) IEEE INFOCOM
    • Taylor, D.1    Turner, J.2
  • 26
    • 0033902127 scopus 로고    scopus 로고
    • A modular approach to packet classification: Algorithms and results
    • March
    • Thomas Y. C. Woo. A modular approach to packet classification: Algorithms and results. In IEEE INFOCOM'00, pages 1213-1222, March 2000.
    • (2000) IEEE INFOCOM'00 , pp. 1213-1222
    • Woo, T.Y.C.1
  • 27
    • 3042617182 scopus 로고    scopus 로고
    • A quantitative study of firewall configuration errors
    • A. Wool. A quantitative study of firewall configuration errors. IEEE Computer, 37(6):62-67, 2004.
    • (2004) IEEE Computer , vol.37 , Issue.6 , pp. 62-67
    • Wool, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.