메뉴 건너뛰기




Volumn , Issue , 2007, Pages 137-144

High-speed packet classification using binary search on length

Author keywords

area based quad trie; best matching rule; binary search on length; hashing; packet classification

Indexed keywords

AREA-BASED; AVERAGE NUMBERS; BINARY SEARCH; HIGH-SPEED; INCOMING PACKETS; MATCHING RULES; MEMORY ACCESS; MEMORY CONSUMPTION; OPTIMIZATION TECHNIQUES; PACKET CLASSIFICATION; PACKET CLASSIFICATION ALGORITHM; PERFORMANCE EVALUATION; PRE-COMPUTATION; RULE SET; SEARCH PERFORMANCE;

EID: 58049131273     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1323548.1323572     Document Type: Conference Paper
Times cited : (16)

References (12)
  • 1
    • 0141524334 scopus 로고    scopus 로고
    • Next generation routers
    • Sept
    • H. Jonathan Chao, "Next generation routers," Proceedings of the IEEE, vol. 90, no. 9, pp. 1518-1558, Sept. 2002.
    • (2002) Proceedings of the IEEE , vol.90 , Issue.9 , pp. 1518-1558
    • Jonathan Chao, H.1
  • 2
    • 0042976157 scopus 로고    scopus 로고
    • Packet classification for core router: Is there an alternative to CAMs?
    • Mar.
    • F. Baboescu, S. Singh, G. Varghese, "Packet classification for core router: is there an alternative to CAMs?," IEEE INFOCOM 2003, vol. 1, pp. 53-63, Mar. 2003.
    • (2003) IEEE INFOCOM 2003 , vol.1 , pp. 53-63
    • Baboescu, F.1    Singh, S.2    Varghese, G.3
  • 3
    • 0035278163 scopus 로고    scopus 로고
    • Algorithms for packet classification
    • Mar./Apr.
    • P. Gupta and N. Mckeown, "Algorithms for packet classification, " IEEE Network, vol.15, no. 2, pp.24-32, Mar./Apr. 2001.
    • (2001) IEEE Network , vol.15 , Issue.2 , pp. 24-32
    • Gupta, P.1    Mckeown, N.2
  • 4
    • 0033895614 scopus 로고    scopus 로고
    • Classification using hierarchical intelligent cuttings
    • Jan./Feb.
    • P. Gupta, N. Mckeown, "Classification using hierarchical intelligent cuttings," IEEE Micro, vol.20, no. 1, pp.34-41, Jan./Feb., 2000.
    • (2000) IEEE Micro , vol.20 , Issue.1 , pp. 34-41
    • Gupta, P.1    Mckeown, N.2
  • 5
    • 1242332555 scopus 로고    scopus 로고
    • Packet Classification Using Multidimensional Cutting
    • Aug.
    • S. Singh, F. Baboescu, G. Varghese, J. Wang, "Packet Classification Using Multidimensional Cutting," in Proc. ACM SIGCOMM, pp. 213-224, Aug. 2003.
    • (2003) Proc. ACM SIGCOMM , pp. 213-224
    • Singh, S.1    Baboescu, F.2    Varghese, G.3    Wang, J.4
  • 6
    • 0033204165 scopus 로고    scopus 로고
    • Packet classification using tuple space search
    • Aug.
    • V. Srinivasan, S. Suri, and G. Varghese, "Packet classification using tuple space search," in Proc. ACM SIGCOMM'99, pp. 135-146, Aug. 1999.
    • (1999) Proc. ACM SIGCOMM'99 , pp. 135-146
    • Srinivasan, V.1    Suri, S.2    Varghese, G.3
  • 7
    • 34548357223 scopus 로고    scopus 로고
    • Hierarchical Binary Search Tree for Packet Classification
    • Aug.
    • H. Lim, H. Chu, and C. Yim, "Hierarchical Binary Search Tree for Packet Classification," IEEE Communications Letters, vol. 11, no. 8, pp.689-691, Aug. 2007
    • (2007) IEEE Communications Letters , vol.11 , Issue.8 , pp. 689-691
    • Lim, H.1    Chu, H.2    Yim, C.3
  • 9
    • 33947189903 scopus 로고    scopus 로고
    • Two-dimensional packet classification algorithm using a quad-tree
    • Mar.
    • Hyesook Lim, Min Young Kang, and Changhoon Yim, "Two-dimensional packet classification algorithm using a quad-tree," Computer Communications, Elsevier Science, vol. 30, no.6 pp. 1396-1405, Mar. 2007.
    • (2007) Computer Communications, Elsevier Science , vol.30 , Issue.6 , pp. 1396-1405
    • Lim, H.1    Kang, M.Y.2    Yim, C.3
  • 11
    • 25844521204 scopus 로고    scopus 로고
    • ClassBench: A packet classification benchmark
    • 13-17 March
    • D.E. Taylor and J.S. Turner, "ClassBench: a packet classification benchmark," INFOCOM 2005, vol.3, pp. 2068-2079, 13-17 March 2005.
    • (2005) INFOCOM 2005 , vol.3 , pp. 2068-2079
    • Taylor, D.E.1    Turner, J.S.2
  • 12
    • 0002436227 scopus 로고    scopus 로고
    • High-speed policy-based packet forwarding using efficient multi-dimensional range matching
    • T.V. Lakshman and D. Stildialis, "High-speed policy-based packet forwarding using efficient multi-dimensional range matching," in Proc. ACM SIGCOMM1998, Sep. 1998.
    • Proc. ACM SIGCOMM1998, Sep. 1998
    • Lakshman, T.V.1    Stildialis, D.2


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