메뉴 건너뛰기




Volumn 21, Issue 4, 2003, Pages 560-571

Fast and scalable packet classification

Author keywords

Associative memories; Communication system routing; Communication systems; Internet; Routing; Search methods; Table lookup; Tree data structures; Tree searching

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; DIGITAL STORAGE; INTERNET; ROUTERS; TELECOMMUNICATION SYSTEMS; TREES (MATHEMATICS);

EID: 0037947385     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2003.810527     Document Type: Review
Times cited : (164)

References (28)
  • 1
    • 0035278505 scopus 로고    scopus 로고
    • Survey and taxonomy of IP address lookup algorithms
    • Mar./Apr.
    • M. A. Ruiz-Sánchez, E. W. Biersack, and W. Dabbous, "Survey and taxonomy of IP address lookup algorithms," IEEE Network, vol. 15, no. 2, pp. 8-23, Mar./Apr. 2001.
    • (2001) IEEE Network , vol.15 , Issue.2 , pp. 8-23
    • Ruiz-Sánchez, M.A.1    Biersack, E.W.2    Dabbous, W.3
  • 3
    • 0038787603 scopus 로고    scopus 로고
    • [Online]
    • BGP Table. [Online]. Available: http://bgp.potaroo.net
    • BGP Table
  • 4
    • 0030609294 scopus 로고    scopus 로고
    • Small forwarding tables for fast routing lookups
    • Oct.
    • A. Brodnik, S. Carlsson, M. Degermark, and S. Pink, "Small forwarding tables for fast routing lookups," Comput. Commun. Rev., vol. 27, no. 4, pp. 3-14, Oct. 1997.
    • (1997) Comput. Commun. Rev. , vol.27 , Issue.4 , pp. 3-14
    • Brodnik, A.1    Carlsson, S.2    Degermark, M.3    Pink, S.4
  • 5
    • 0035681220 scopus 로고    scopus 로고
    • Searching very large routing tables in wide embedded memory
    • Nov.
    • J. van Lunteren, "Searching very large routing tables in wide embedded memory," in Proc. IEEE GLOBECOM, vol. 3, Nov. 2001, pp. 1615-1619.
    • (2001) Proc. IEEE GLOBECOM , vol.3 , pp. 1615-1619
    • Van Lunteren, J.1
  • 6
    • 0032069182 scopus 로고    scopus 로고
    • Beyond best effort: Router architectures for the differentiated services of tomorrow's internet
    • May
    • V. P. Kumar, T. V. Lakshman, and D. Stiliadis, "Beyond best effort: router architectures for the differentiated services of tomorrow's internet," IEEE Commun. Mag., vol. 36, pp. 152-164, May 1998.
    • (1998) IEEE Commun. Mag. , vol.36 , pp. 152-164
    • Kumar, V.P.1    Lakshman, T.V.2    Stiliadis, D.3
  • 7
    • 0035509988 scopus 로고    scopus 로고
    • An evaluation of the key design criteria to achieve high update rates in packet classifiers
    • Nov./Dec.
    • C. Macián and R. Finthammer, "An evaluation of the key design criteria to achieve high update rates in packet classifiers," IEEE Network, vol. 15, pp. 24-29, Nov./Dec. 2001.
    • (2001) IEEE Network , vol.15 , pp. 24-29
    • Macián, C.1    Finthammer, R.2
  • 8
    • 0033204142 scopus 로고    scopus 로고
    • Packet classification on multiple fields
    • Oct
    • P. Gupta and N. McKeown, "Packet classification on multiple fields," Comput. Commun. Rev., vol. 29, pp. 147-160, Oct. 1999.
    • (1999) Comput. Commun. Rev. , vol.29 , pp. 147-160
    • Gupta, P.1    McKeown, N.2
  • 9
    • 0033885344 scopus 로고    scopus 로고
    • Performance of hashing-based schemes for internet load balancing
    • Mar.
    • Z. Cao, Z. Wang, and E. Zegura, "Performance of hashing-based schemes for internet load balancing," in Proc. IEEE INFOCOM, vol. 1, Mar. 2000, pp. 332-341.
    • (2000) Proc. IEEE INFOCOM , vol.1 , pp. 332-341
    • Cao, Z.1    Wang, Z.2    Zegura, E.3
  • 10
    • 0038787121 scopus 로고    scopus 로고
    • [Online]
    • SiberCAM Application Note, SiberCore Technologies. [Online]. Available: http://www.sibercore.com/pdf/an_scan001_1.pdf
    • SiberCAM Application Note
  • 11
    • 0033204165 scopus 로고    scopus 로고
    • Packet classification using tuple space search
    • Oct.
    • V. Srinivasan, S. Suri, and G. Varghese, "Packet classification using tuple space search," Comput. Commun. Rev., vol. 29, no. 4, pp. 135-146, Oct. 1999.
    • (1999) Comput. Commun. Rev. , vol.29 , Issue.4 , pp. 135-146
    • Srinivasan, V.1    Suri, S.2    Varghese, G.3
  • 12
    • 0035001155 scopus 로고    scopus 로고
    • A packet classification and filter management system
    • Apr.
    • V. Srinivasan, "A packet classification and filter management system," in Proc. IEEE INFOCOM, vol. 3, Apr. 2001, pp. 1464-1473.
    • (2001) Proc. IEEE INFOCOM , vol.3 , pp. 1464-1473
    • Srinivasan, V.1
  • 13
    • 0033902127 scopus 로고    scopus 로고
    • A modular approach to packet classification: Algorithms and result
    • Mar.
    • T. Y. C. Woo, "A modular approach to packet classification: algorithms and result," in Proc. IEEE INFOCOM, vol. 3, Mar. 2000, pp. 1213-1222.
    • (2000) Proc. IEEE INFOCOM , vol.3 , pp. 1213-1222
    • Woo, T.Y.C.1
  • 14
    • 0033884565 scopus 로고    scopus 로고
    • A novel cache architecture to support layer four packet classification at memory access speeds
    • Mar.
    • J. Xu, M. Singhal, and J. Degroat, "A novel cache architecture to support layer four packet classification at memory access speeds," in Proc. IEEE INFOCOM, vol. 3, Mar. 2000, pp. 1445-1454.
    • (2000) Proc. IEEE INFOCOM , vol.3 , pp. 1445-1454
    • Xu, J.1    Singhal, M.2    Degroat, J.3
  • 15
    • 0035278163 scopus 로고    scopus 로고
    • Algorithms for packet classification
    • Man/Apr.
    • P. Gupta and N. McKeown, "Algorithms for packet classification," IEEE Network, vol. 15, no. 2, pp. 24-32, Man/Apr. 2001.
    • (2001) IEEE Network , vol.15 , Issue.2 , pp. 24-32
    • Gupta, P.1    McKeown, N.2
  • 17
    • 0003365604 scopus 로고    scopus 로고
    • Packet classification using hierarchical intelligent cuttings
    • Stanford University, Stanford, CA, Aug.
    • P. Gupta and N. McKeown, "Packet classification using hierarchical intelligent cuttings," in Proc. Hot Interconnects 7. Stanford University, Stanford, CA, Aug. 1999
    • (1999) Proc. Hot Interconnects , vol.7
    • Gupta, P.1    McKeown, N.2
  • 18
    • 0033876524 scopus 로고    scopus 로고
    • Tradeoffs for packet classification
    • Mar.
    • A. Feldmann and S. Muthukrishnan, "Tradeoffs for packet classification," in Proc. IEEE INFOCOM, vol. 3, Mar. 2000, pp. 1193-1202.
    • (2000) Proc. IEEE INFOCOM , vol.3 , pp. 1193-1202
    • Feldmann, A.1    Muthukrishnan, S.2
  • 19
    • 84947800567 scopus 로고    scopus 로고
    • Dynamic algorithms with worst-case performance for packet classification
    • Paris, France, May
    • P. Gupta and N. McKeown, "Dynamic algorithms with worst-case performance for packet classification," in Proc. IFIP Networking, Paris, France, May 2000, pp. 528-539.
    • (2000) Proc. IFIP Networking , pp. 528-539
    • Gupta, P.1    McKeown, N.2
  • 20
    • 0034479346 scopus 로고    scopus 로고
    • High speed packet classification using segment tree
    • Nov.
    • C.-F. Su, "High speed packet classification using segment tree," in Proc. IEEE GLOBECOM, vol. 1, Nov. 2000, pp. 582-586.
    • (2000) Proc. IEEE GLOBECOM , vol.1 , pp. 582-586
    • Su, C.-F.1
  • 21
    • 0032178150 scopus 로고    scopus 로고
    • High-speed policy-based packet forwarding using efficient multi-dimensional range matching
    • Oct.
    • T. Lakshman and D, Stiliadis, "High-speed policy-based packet forwarding using efficient multi-dimensional range matching," Comput. Commun. Rev., vol. 28, no. 4, pp. 203-214, Oct. 1998.
    • (1998) Comput. Commun. Rev. , vol.28 , Issue.4 , pp. 203-214
    • Lakshman, T.1    Stiliadis, D.2
  • 22
    • 0034777543 scopus 로고    scopus 로고
    • Scalable packet classification
    • Oct.
    • F. Baboescu and G. Varghese, "Scalable packet classification," Comput. Commun. Rev., vol. 31, no. 4, pp. 199-210, Oct. 2001.
    • (2001) Comput. Commun. Rev. , vol.31 , Issue.4 , pp. 199-210
    • Baboescu, F.1    Varghese, G.2
  • 24
    • 0001538994 scopus 로고    scopus 로고
    • Fast incremental updates on ternary-CAMs for routing lookups and packet classification
    • Aug.
    • D. Shah and P. Gupta, "Fast incremental updates on ternary-CAMs for routing lookups and packet classification," in Proc. Hot Interconnects 8, Aug. 2000, pp. 145-153.
    • (2000) Proc. Hot Interconnects , vol.8 , pp. 145-153
    • Shah, D.1    Gupta, P.2
  • 26
    • 78049476852 scopus 로고    scopus 로고
    • Routing lookups and packet classification; theory and practice
    • Stanford, CA, Online. Aug.
    • P. Gupta, "Routing lookups and packet classification; theory and practice," Tutorial at Hot Interconnects VIII, Stanford, CA, [Online]. Available: http://klamath.stanford.edu/̃pankaj/talks/, Aug. 2000.
    • (2000) Tutorial at Hot Interconnects , vol.8
    • Gupta, P.1
  • 27
    • 0038449447 scopus 로고    scopus 로고
    • [Online]
    • Network Processing Forum (NPF) [Online]. Available: http://www.npforum.org
  • 28
    • 0038787120 scopus 로고    scopus 로고
    • [Online]
    • Embedded Microprocessor Benchmark Consortium (EEMBC). [Online], Available: http://www.eembc.org


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