메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Tree-based minimization of TCAM entries for packet classification

Author keywords

[No Author keywords available]

Indexed keywords

EDGE ROUTERS; EQUIVALENT TRANSFORMATIONS; INTRUSION DETECTION SYSTEMS; NETWORK DEVICES; PACKET CLASSIFICATION; PARALLEL HARDWARE; PREPROCESSORS; PRIORITY ENCODER; REDUNDANCY REMOVAL; REDUNDANT RULES; RULE SET; TERNARY CONTENT ADDRESSABLE MEMORIES; TREE REPRESENTATION; TREE-BASED;

EID: 77951281172     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCNC.2010.5421589     Document Type: Conference Paper
Times cited : (23)

References (14)
  • 1
    • 33644661238 scopus 로고    scopus 로고
    • Content-addressable memory (CAM) circuits and architectures: A tutorial and survey
    • Mar.
    • K. Pagiamtzis and A. Sheikholeslami, "Content-addressable memory (CAM) circuits and architectures: A tutorial and survey," IEEE Journal of Solid-State Circuits, vol.41, no.3, pp. 712-727, Mar. 2006.
    • (2006) IEEE Journal of Solid-State Circuits , vol.41 , Issue.3 , pp. 712-727
    • Pagiamtzis, K.1    Sheikholeslami, A.2
  • 3
    • 2342479360 scopus 로고    scopus 로고
    • The Snort Project, Sep. available as
    • Snort User Manual 2.8.5, The Snort Project, Sep. 2009, available as http://www.snort.org/assets/120/snort-manual.pdf.
    • (2009) Snort User Manual 2.8.5
  • 13
    • 0035278163 scopus 로고    scopus 로고
    • Algorithms for packet classification
    • Mar.
    • P. Gupta and N. Mckeown, "Algorithms for packet classification, " IEEE Network, vol.15, no.2, pp. 24-32, Mar. 2001.
    • (2001) IEEE Network , vol.15 , Issue.2 , pp. 24-32
    • Gupta, P.1    Mckeown, N.2


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