A Memory Efficient Algorithm for Packet Classification

  • Zhen Xu
  • Jun Sun
  • Jun Zhang
Conference paper

DOI: 10.1007/11814856_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4138)
Cite this paper as:
Xu Z., Sun J., Zhang J. (2006) A Memory Efficient Algorithm for Packet Classification. In: Cheng X., Li W., Znati T. (eds) Wireless Algorithms, Systems, and Applications. WASA 2006. Lecture Notes in Computer Science, vol 4138. Springer, Berlin, Heidelberg

Abstract

In order to provide more value added services, the Internet needs to classify packets into flows for different treatment. High performance packet classification algorithms for large classifiers and edge classifiers are highly demanded.

In this paper, we will describe a new algorithm for packet classification that makes use of bits distribution features. It is a high level classification method. It always takes the bits from every dimension into account, instead of constraining the search process in some of the dimensions at every stage. The experiments provide the evidence that it has outstanding performance even for large edge classifiers. It is also scalable to IPv6.

Keywords

Packet Classification Routing Hash table 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Zhen Xu
    • 1
  • Jun Sun
    • 2
  • Jun Zhang
    • 1
  1. 1.School of Electronic and Information EngineeringBeihang Univeristy 
  2. 2.Chinese Academy of Space Technology 

Personalised recommendations