Algorithms for packet classification

被引:336
作者
Gupta, P [1 ]
McKeown, N
机构
[1] Stanford Univ, Stanford, CA 94305 USA
[2] Cisco Syst Inc, San Jose, CA 95134 USA
[3] Hewlett Packard Labs, Palo Alto, CA USA
来源
IEEE NETWORK | 2001年 / 15卷 / 02期
关键词
D O I
10.1109/65.912717
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The process of categorizing packets into "flows" in an Internet router is called pocket classification. All packets belonging to the same flow obey a predefined rule and are processed in a similar manner by the router. For example, all packets with the same source and destination IP addresses may be defined to form a flow. Packet classification is needed for non-best-effort services, such as firewalls and quality of service; services that require the capability to distinguish and isolate traffic in different flows for suitable processing. In general, packet classification on multiple fields is a difficult problem. Hence, researchers have proposed a variety of algorithms which, broadly speaking, can be categorized as basic search algorithms, geometric algorithms, heuristic algorithms, or hardware-specific search algorithms. In this tutorial we describe algorithms that are representative of each category, and discuss which type of algorithm might be suitable for different applications.
引用
收藏
页码:24 / 32
页数:9
相关论文
共 13 条
  • [1] [Anonymous], 2000, Geometry, Spinors and Applications
  • [2] BUDDHIKOT MM, 1999, P C PROT HIGH SPEED, P25
  • [3] Feldman A., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P1193, DOI 10.1109/INFCOM.2000.832493
  • [4] Gupta P, 1999, COMP COMM R, V29, P147, DOI 10.1145/316194.316217
  • [5] Classifying packets with hierarchical intelligent cuttings
    Gupta, P
    McKeown, N
    [J]. IEEE MICRO, 2000, 20 (01) : 34 - 41
  • [6] GUPTA P, 1999, P HOT INT AUG STANF, V7
  • [7] LAKSHMAN TV, 1998, P ACM SIGCOMM SEPT, P191
  • [8] Range searching and point location among fat objects
    Overmars, MH
    vanderStappen, AF
    [J]. JOURNAL OF ALGORITHMS, 1996, 21 (03) : 629 - 656
  • [9] Preparata F., 2012, Computational geometry: an introduction
  • [10] SHAFAI F, 1998, IEEE J SOLID STATE C, V33