Skip to main content
Article thumbnail
Location of Repository

IPv6-Oriented 4×OC-768 Packet Classification with Deriving-Merging Partition and Field-Variable Encoding Algorithm i

By Xin Zhang, Bin Liu, Wei Li, Ying Xi, David Bermingham and Xiaojun Wang

Abstract

Abstract—Packet Classification serves as a plinth for many newly emerging network applications. Most of the previous packet classification schemes are IPv4-oriented, and some of them have achieved high throughput with chip-level parallelism of Ternary Content Addressable Memories (TCAM). However, due to their inefficient utilization of TCAM resources, further upgrade incurs prohibitive hardware costs. As IPv6 will dominate the Next Generation Internet, IPv6-oriented packet classification is of increasing importance. In this paper, we propose a packet classification scheme geared towards IPv6. This scheme incorporates efficient and flexible algorithms for parallelism and distributed storing, which provides an unprecedentedly high throughput with relatively low storage costs. Our scheme also integrates delicate parallel encoding algorithms to maximize the TCAM utilization and increase its throughput. Using commercially available TCAM, the scheme is able to classify 266 million IPv6 packets per second (Mpps), matching 4 × OC-768 (160 Gbps) line rate. Key words—Packet Classification, Encoding, IPv6, TCAM I

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.6954
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.cmu.edu/~xzhang1... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.