메뉴 건너뛰기




Volumn , Issue , 2009, Pages

Discrete bit selection: Towards a bit-level heuristic framework for multi-dimensional packet classification

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION RULES; LEVEL ALGORITHMS; LEVEL CHARACTERISTIC; MEMORY REQUIREMENTS; MULTI-DIMENSIONAL PACKETS; PACKET CLASSIFICATION; PERFORMANCE REQUIREMENTS; RULE SET; SEARCH TIME;

EID: 70349681085     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOMW.2009.5072130     Document Type: Conference Paper
Times cited : (2)

References (9)
  • 1
    • 0001700602 scopus 로고    scopus 로고
    • Range searching and point location among fat objects
    • M. H. Overmars and A. F. van der Stappen "Range Searching and Point Location among Fat Objects," Journal of Algorithms, 21(3), 1996.
    • Journal of Algorithms , vol.21 , Issue.3 , pp. 1996
    • Overmars, M.H.1    Van Der Stappen, A.F.2
  • 6
    • 0003365604 scopus 로고    scopus 로고
    • Packet classification using hierarchical intelligent cuttings
    • P. Gupta and N. McKeown, "Packet Classification Using Hierarchical Intelligent Cuttings," Proc. of Hot Interconnects, 1999.
    • (1999) Proc. of Hot Interconnects
    • Gupta, P.1    McKeown, N.2
  • 8
    • 84869616196 scopus 로고    scopus 로고
    • [Online.] Available:
    • [Online.] Available: http://www.caviumnetworks.com/Table.html
  • 9
    • 84869616197 scopus 로고    scopus 로고
    • [Online.] Available
    • [Online.] Available: http://www.arl.wustl.edu/~hs1/PClassEval.htm


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