메뉴 건너뛰기




Volumn , Issue , 2007, Pages

Distributed data parallel techniques for content-matching intrusion detection systems

Author keywords

Aho Corasick; Data parallel; Intrusion detection; Packet; Parallel; Signature matching; Snort; Wu Manber

Indexed keywords

CONTENT MATCHING; DISTRIBUTED DATA; FALSE NEGATIVES; INTRUSION DETECTION SYSTEMS (IDSS); OPEN SOURCES; OVER CURRENTS; PARALLEL TECHNIQUES; PROCESSING TIME; SECURITY POLICIES; SIGNATURE BASED NETWORK INTRUSION DETECTION SYSTEM (NIDS); SPEED UPS; TRAFFIC TRACES;

EID: 47949112917     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MILCOM.2007.4454922     Document Type: Conference Paper
Times cited : (16)

References (14)
  • 1
    • 0016518897 scopus 로고
    • Efficient string matching: An aid to bibliographic search
    • June
    • Alfred V. Aho and Margaret J. Corasick. Efficient string matching: An aid to bibliographic search. Communications of the ACM, 18(6), June 1975.
    • (1975) Communications of the ACM , vol.18 , Issue.6
    • Aho, A.V.1    Corasick, M.J.2
  • 4
    • 0017547820 scopus 로고    scopus 로고
    • Robert S. Boyer and J. Strother Moore. A fast string searching algorithm. Commun. ACM, 20(10):762-772, 1977.
    • Robert S. Boyer and J. Strother Moore. A fast string searching algorithm. Commun. ACM, 20(10):762-772, 1977.
  • 5
    • 47949119513 scopus 로고    scopus 로고
    • Cert. Cert/cc statistics 1988-2006. http://www.cert.org/stats.
    • Cert. Cert/cc statistics 1988-2006. http://www.cert.org/stats.
  • 6
    • 85029624285 scopus 로고
    • Tight bounds on the complexity of the boyermoore string matching algorithm
    • Richard Cole. Tight bounds on the complexity of the boyermoore string matching algorithm. Symposium on Discrete Algorithms, pages 224-233, 1991.
    • (1991) Symposium on Discrete Algorithms , pp. 224-233
    • Cole, R.1
  • 7
    • 1542350966 scopus 로고    scopus 로고
    • Fast content-based packet handling for intrusion detection
    • Technical report, University of California at San Diego
    • Mike Fisk and George Varghese. Fast content-based packet handling for intrusion detection. Technical report, University of California at San Diego, 2001.
    • (2001)
    • Fisk, M.1    Varghese, G.2
  • 11
    • 47949109527 scopus 로고    scopus 로고
    • A taxonomy of parallel techniques for intrusion detection
    • Patrick Wheeler and Errin W. Fulp. A taxonomy of parallel techniques for intrusion detection. ACMSE 2007, 2007.
    • (2007) ACMSE 2007
    • Wheeler, P.1    Fulp, E.W.2
  • 13
    • 0012405865 scopus 로고
    • A fast algorithm for multi-pattern searching
    • Technical report, University of Arizona, May
    • Sun Wu and Udi Manber. A fast algorithm for multi-pattern searching. Technical report, University of Arizona, May 1994.
    • (1994)
    • Wu, S.1    Manber, U.2


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