Data Structures For One-Dimensional Packet Classification Using Most-Specific-Rule Matching

Authors:
Affiliations:
Venue:
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
Year:
2002

Citing 0
Cited 7

O(\log n) Dynamic Router-Tables for Prefixes and Ranges

IEEE Transactions on Computers
Enhanced Interval Trees for Dynamic IP Router-Tables

IEEE Transactions on Computers
Prefix and Interval-Partitioned Dynamic IP Router-Tables

IEEE Transactions on Computers
An optimal dynamic interval stabbing-max data structure?

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Build shape-shifting tries for fast IP lookup in O(n) time

Computer Communications
A dynamic stabbing-max data structure with sub-logarithmic query time

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries

SIAM Journal on Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We review the data structures that have been proposed for one-dimensional packet classification. Our review is limited to data structures for the case when ties among the rules that match an incoming packet are broken by selecting the matching rule that is most specific. For the case when the rule filters are destination-address prefixes or are nonintersecting ranges, this tie breaker corresponds to longest-prefix or shortest-range matching, respectively. When the rule filters are arbitrary ranges, this tie breaker resolves the tie only when the rule set is conflict free. Data structures for both static and dynamic rule tables are discussed.