Packet classification consuming small amount of memory

Authors:
Xuehong Sun;Sartaj K. Sahni;Yiqiang Q. Zhao
Affiliations:
Canadian Space Agency, Carleton University, Saint-Hubert, QC, Canada;Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL;School of Mathematics and Statistics, Carleton University, Ottawa, ON, Canada
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2005

Citing 10
Cited 4

Computational geometry: an introduction

Computational geometry: an introduction
Fast and scalable layer four switching

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
High-speed policy-based packet forwarding using efficient multi-dimensional range matching

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification using tuple space search

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification on multiple fields

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Scalable packet classification

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Classifying Packets with Hierarchical Intelligent Cuttings

IEEE Micro
Interdomain Access Control with Policy Routing

FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
Billing users and pricing for TCP

IEEE Journal on Selected Areas in Communications
Algorithms for packet classification

IEEE Network: The Magazine of Global Internetworking

Prefix and Interval-Partitioned Dynamic IP Router-Tables

IEEE Transactions on Computers
Two-dimensional packet classification algorithm using a quad-tree

Computer Communications
Scalable packet classification with controlled cross-producting

Computer Networks: The International Journal of Computer and Telecommunications Networking
An ultra high throughput and memory efficient pipeline architecture for multi-match packet classification without TCAMs

Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to provide more value-added services, the Internet needs to classify packets into flows for different treatment. This function becomes a bottleneck in the router. High performance packet classification algorithms are therefore in high demand.This paper describes a new algorithm for packet classification using the concept of independent sets. The algorithm has very small memory requirements. The search speed is not sensitive to the size of the rule table or to the percentage of wildcards in the fields. It also scales well from two-dimensional classifiers to high-dimensional ones. In particular, the algorithm is inherently parallel. Hardware tailored to this algorithm can achieve very fast search speed. The update algorithm proposed is also very fast in general.