A memory efficient algorithm for packet classification

Zhen Xu*, Jun Sun, Jun Zhang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationWireless Algorithms, Systems, and Applications - First International Conference, WASA 2006, Proceedings
PublisherSpringer Verlag
Pages115-126
Number of pages12
ISBN (Print)3540371893, 9783540371892
DOIs
Publication statusPublished - 2006
Externally publishedYes
EventFirst International Conference on Wireless Algorithms, Systems, and Applications, WASA 2006 - Xi'an, China
Duration: 15 Aug 200617 Aug 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4138 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceFirst International Conference on Wireless Algorithms, Systems, and Applications, WASA 2006
Country/TerritoryChina
CityXi'an
Period15/08/0617/08/06

Keywords

  • Hash table
  • Packet Classification
  • Routing

Fingerprint

Dive into the research topics of 'A memory efficient algorithm for packet classification'. Together they form a unique fingerprint.

Cite this