메뉴 건너뛰기




Volumn 23, Issue 1, 2009, Pages 30-35

Counting bloom filters for pattern matching and anti-evasion at the wire speed

Author keywords

Engines; Finite impulse response filter; Layout; Matched filters; Memory management; Pattern matching; Radiation detectors

Indexed keywords

BLOOM FILTERS; DATA PATHS; DEEP PACKET INSPECTIONS; EFFICIENT SYSTEMS; FINITE IMPULSE RESPONSE FILTER; HIGH-SPEED; INTRUSION DETECTION SYSTEMS; LAYOUT; MATCHED FILTERS; MATCHING ALGORITHMS; MEMORY MANAGEMENT; REASSEMBLY; STANDARD PATTERNS; TRAFFIC PROCESSING;

EID: 65249112685     PISSN: 08908044     EISSN: None     Source Type: Journal    
DOI: 10.1109/MNET.2009.4804321     Document Type: Article
Times cited : (16)

References (12)
  • 1
    • 1842478680 scopus 로고    scopus 로고
    • Deep Packet Inspection Using Parallel Bloom Filters
    • S. Dharmapurikar et al., "Deep Packet Inspection Using Parallel Bloom Filters," IEEE Micro, vol. 24, no. 1, 2004, pp. 52-61.
    • (2004) IEEE Micro , vol.24 , Issue.1 , pp. 52-61
    • Dharmapurikar, S.1
  • 2
    • 85089793646 scopus 로고    scopus 로고
    • Bloom Filter Accelerator for String Matching
    • M. Nourani and P. Katta, "Bloom Filter Accelerator for String Matching," Proc. 16th Int'l. Conf. Comp. Commun. Net., pp. 185-90.
    • Proc. 16th Int , vol.50 , pp. 185-190
    • Nourani, M.1    Katta, P.2
  • 3
    • 0032178083 scopus 로고    scopus 로고
    • Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol
    • L. Fan et al., "Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol," SIGCOMM Comp. Commun. Rev., vol. 28, no. 4, 1998, pp. 254-65.
    • (1998) SIGCOMM Comp. Commun. Rev , vol.28 , Issue.4 , pp. 254-265
    • Fan, L.1
  • 4
    • 0004145058 scopus 로고    scopus 로고
    • Insertion, Evasion, and Denial of Service: Eluding Network Intrusion Detection
    • Alberta, Canada
    • T. H. Ptacek and T. N. Newsham, "Insertion, Evasion, and Denial of Service: Eluding Network Intrusion Detection," Secure Networks, Inc., T2R-0Y6, Tech. Rep., Alberta, Canada, 1998; http:// citeseer.ist.psu.edu/ptacek98insertion.html
    • (1998) Secure Networks, Inc., T2R-0Y6, Tech. Rep
    • Ptacek, T.H.1    Newsham, T.N.2
  • 5
    • 85084160972 scopus 로고    scopus 로고
    • Network Intrusion Detection: Evasion, Traffic Normalization, and End-to-End Protocol Semantics
    • M. Handley, V. Paxson, and C. Kreibich, "Network Intrusion Detection: Evasion, Traffic Normalization, and End-to-End Protocol Semantics," Proc. 10th Conf. USENIX Sec. Symp., 2001, p. 9.
    • (2001) Proc. 10th Conf. USENIX Sec. Symp , pp. 9
    • Handley, M.1    Paxson, V.2    Kreibich, C.3
  • 6
    • 33846612446 scopus 로고    scopus 로고
    • Multi-Packet Signature Detection Using Prefix Bloom Filters
    • N. S. Artan and H. J. Chao, "Multi-Packet Signature Detection Using Prefix Bloom Filters," Proc. IEEE GLOBECOM, vol. 3, 2005, pp. 1811-16.
    • (2005) Proc. IEEE GLOBECOM , vol.3 , pp. 1811-1816
    • Artan, N.S.1    Chao, H.J.2
  • 7
    • 33750316215 scopus 로고    scopus 로고
    • Detecting Evasion Attacks at High Speeds without Reassembly
    • G. Varghese, J. A. Fingerhut, and F. Bonomi, "Detecting Evasion Attacks at High Speeds without Reassembly," SIGCOMM Comp. Commun. Rev., vol. 36, no. 4, 2006, pp. 327-38.
    • (2006) SIGCOMM Comp. Commun. Rev , vol.36 , Issue.4 , pp. 327-338
    • Varghese, G.1    Fingerhut, J.A.2    Bonomi, F.3
  • 9
    • 51349107047 scopus 로고    scopus 로고
    • Multilayer Compressed Counting Bloom Filters
    • Apr
    • D. Ficara et al., "Multilayer Compressed Counting Bloom Filters," Proc. INFOCOM '08, Apr. 2008.
    • (2008) Proc. INFOCOM '08
    • Ficara, D.1
  • 10
    • 33847305617 scopus 로고    scopus 로고
    • Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing
    • New York, NY
    • H. Song et al., "Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing," Proc. 2005 Conf. Apps., Tech., Architectures, Protocols Comp. Commun., New York, NY, 2005, pp. 181-92.
    • (2005) Proc. 2005 Conf. Apps., Tech., Architectures, Protocols Comp. Commun , pp. 181-192
    • Song, H.1
  • 11
    • 51249085905 scopus 로고    scopus 로고
    • Blooming Trees: Space-Efficient Structures for Data Representation
    • May
    • D. Ficara et al., "Blooming Trees: Space-Efficient Structures for Data Representation," Proc. IEEE ICC '08, May 2008.
    • (2008) Proc. IEEE ICC '08
    • Ficara, D.1
  • 12
    • 33750733595 scopus 로고    scopus 로고
    • An Improved Construction for Counting Bloom Filters, LNCS 4168, 14th Annual Euro.Symp
    • F. Bonomi et al., "An Improved Construction for Counting Bloom Filters," LNCS 4168, 14th Annual Euro.Symp. Algorithms, 2006, pp. 684-95.
    • (2006) Algorithms , pp. 684-695
    • Bonomi, F.1


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