메뉴 건너뛰기




Volumn 11, Issue 8, 2007, Pages 689-691

Hierarchical binary search tree for packet classification

Author keywords

Binary search tree; Hierarchical binary search tree; Hierarchical trie; Packet classification

Indexed keywords

HIERARCHICAL SYSTEMS; INTERNET; ROUTERS;

EID: 34548357223     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2007.070389     Document Type: Article
Times cited : (14)

References (9)
  • 1
    • 0141524334 scopus 로고    scopus 로고
    • Next generation routers
    • Sept
    • H. J. Chao, "Next generation routers," Proc. of the IEEE, vol. 90, no. 9, pp. 1518-1558, Sept. 2002.
    • (2002) Proc. of the IEEE , vol.90 , Issue.9 , pp. 1518-1558
    • Chao, H.J.1
  • 2
    • 0032178150 scopus 로고    scopus 로고
    • High-speed policy-based packet forwarding using efficient multi-dimensional range matching
    • Oct
    • T. V. Lakshman and D. Stiliadis, "High-speed policy-based packet forwarding using efficient multi-dimensional range matching," ACM SIGCOMM, pp. 203-214, Oct. 1998.
    • (1998) ACM SIGCOMM , pp. 203-214
    • Lakshman, T.V.1    Stiliadis, D.2
  • 3
    • 15544382531 scopus 로고    scopus 로고
    • Scalable packet classification
    • Feb
    • F. Baboescu and G. Varghese, "Scalable packet classification," IEEE/ACM Trans. Netw., vol. 13, no. 1, pp. 2-14, Feb. 2005.
    • (2005) IEEE/ACM Trans. Netw , vol.13 , Issue.1 , pp. 2-14
    • Baboescu, F.1    Varghese, G.2
  • 4
    • 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
  • 5
    • 0042976157 scopus 로고    scopus 로고
    • Packet classification for core routers: Is there an alternative to CAMs?
    • F. Baboescu, S. Singh, and G. Varghese, "Packet classification for core routers: Is there an alternative to CAMs?," in Proc. IEEE INFOCOM vol. 1, pp. 53-63, 2003.
    • (2003) Proc. IEEE INFOCOM , vol.1 , pp. 53-63
    • Baboescu, F.1    Singh, S.2    Varghese, G.3
  • 7
    • 33947189903 scopus 로고    scopus 로고
    • Two-dimensional packet classification algorithm using a quad-tree
    • Mar
    • H. Lim, M. Kang, and C. Yim, "Two-dimensional packet classification algorithm using a quad-tree," Computer Commun., vol. 30, no. 6, pp.1396-1405, Mar. 2007.
    • (2007) Computer Commun , vol.30 , Issue.6 , pp. 1396-1405
    • Lim, H.1    Kang, M.2    Yim, C.3
  • 8
    • 25844521204 scopus 로고    scopus 로고
    • ClassBench: A packet classification benchmark
    • Mar
    • D. E. Taylor and J. S. Turner, "ClassBench: A packet classification benchmark," in Proc. IEEE INFOCOM, pp.2068-2079, Mar. 2005.
    • (2005) Proc. IEEE INFOCOM , pp. 2068-2079
    • Taylor, D.E.1    Turner, J.S.2
  • 9
    • 84905385128 scopus 로고    scopus 로고
    • Fast and scalable schemes for the IP address lookup problem
    • N. Yazdani and P. S. Min, "Fast and scalable schemes for the IP address lookup problem," in Proc. IEEE HPSR2000, pp. 83-92.
    • Proc. IEEE , vol.HPSR2000 , pp. 83-92
    • Yazdani, N.1    Min, P.S.2


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