Title :
Algorithms for packet classification
Author :
Gupta, Pankaj ; McKeown, Nick
Author_Institution :
Dept. of Comput. Sci., Stanford Univ., CA, USA
Abstract :
The process of categorizing packets into “flows” in an Internet router is called packet 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
Keywords :
Internet; packet switching; quality of service; search problems; telecommunication network routing; telecommunication traffic; Internet router; destination IP address; firewalls; geometric algorithms; hardware-specific search algorithms; heuristic algorithms; nonbest-effort services; packet classification algorithms; packets flows; quality of service; search algorithms; source IP address; traffic flows; Classification algorithms; Customer service; Data structures; Heuristic algorithms; Internet; Quality of service; Random access memory; Routing; Software algorithms; Telecommunication traffic;
Journal_Title :
Network, IEEE