DMCA
Algorithms for Packet Classification (2001)
Cached
Download Links
| Venue: | IEEE NETWORK |
| Citations: | 231 - 3 self |
BibTeX
@ARTICLE{Gupta01algorithmsfor,
author = {Pankaj Gupta and Nick McKeown},
title = {Algorithms for Packet Classification},
journal = {IEEE NETWORK},
year = {2001},
volume = {15},
pages = {24--32}
}
Share
 |
 |
 |
 |
||
OpenURL
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 pre-defined 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.
Keyphrases
packet classification internet router difficult problem different flow hardware-specific search algorithm heuristic algorithm basic search algorithm non best-effort service geometric algorithm different application destination ip similar manner suitable processing multiple field pre-defined rule
