This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Survey and Taxonomy of Packet Classification Techniques DAVID E. TAYLOR Applied Research Laboratory Washington University in Saint Louis Packet classification is an enabling function for a variety of Internet applications including quality of service, security, monitoring, and multimedia communications. In order to classify a packet as belonging to a particular flow or set of flows, network nodes must perform a search over a set of filters using multiple fields of the packet as the search key. In general, there have been two major threads of research addressing packet classification, algorithmic and architectural. A few pioneering groups of researchers posed the problem, provided complexity bounds, and offered a collection of algorithmic solutions. Subsequently, the design space has been vigorously explored by many offering new algorithms and improvements on existing algorithms. Given the inability of early algorithms to meet performance constraints imposed by high speed links, researchers in industry and academia devised architectural solutions to the problem. This thread of research produced the most widely-used packet classification device technology, Ternary Content Addressable Memory (TCAM). New architectural research combines intelligent algorithms and novel architectures to eliminate many of the unfavorable characteristics of current TCAMs. We observe that the community appears to be converging on a combined algorithmic and architectural approach to the problem. Using a taxonomy based on the high-level approach to the problem and a minimal set of running examples, we provide a survey of the seminal and recent solutions to the problem. It is our hope to foster a deeper understanding of the various packet classification techniques while providing a useful framework for discerning relationships and distinctions. Categories and Subject Descriptors: B.3.2 [ Memory Structures ]: Design Styles Associative memories ; Cache memories ; C.2.0 [ Computer-Communication Networks ]: General Data communications ; C.2.1 [ Computer-Communication Networks ]: Network Architecture and Design Packet-switching networks ; C.2.3 [ Computer-Communication Networks ]: Network Operations Network management ; E.1 [ Data ]: Data Structures Lists, stacks, and queues; Trees General Terms: Algorithms, Performance Additional Key Words and Phrases: Packet classification, flow identification 1. INTRODUCTION Packet classification is an enabling func- tion for a variety of Internet applications Authors address: D. E. Taylor, Applied Research Laboratory, Washington University in Saint Louis, and Exegy Inc., St. Louis, MO; e-mail: firstname.lastname@example.org. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation.that copies show this notice on the first page or initial screen of a display along with the full citation....
View Full Document
This note was uploaded on 07/30/2011 for the course COP 4810 taught by Professor Staff during the Spring '11 term at University of Central Florida.
- Spring '11
- Computer Science