Tradeoffs for packet classification

@article{Feldmann2000TradeoffsFP,
  title={Tradeoffs for packet classification},
  author={Anja Feldmann and S. Muthukrishnan},
  journal={Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)},
  year={2000},
  volume={3},
  pages={1193-1202 vol.3}
}
  • A. Feldmann, S. Muthukrishnan
  • Published 26 March 2000
  • Computer Science
  • Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
We present an algorithmic framework for solving the packet classification problem that allows various access time versus memory tradeoffs. It reduces the multidimensional packet classification problem to solving a few instances of the one-dimensional IP lookup problem. It gives the best known lookup performance with moderately large memory space. Furthermore, it efficiently supports a reasonable number of additions and deletions to the rulesets without degrading the lookup performance. We… 

Figures and Tables from this paper

A Memory Efficient Algorithm for Packet Classification
TLDR
A new algorithm for packet classification that makes use of bits distribution features is described, which always takes the bits from every dimension into account, instead of constraining the search process in some of the dimensions at every stage.
Dynamic Algorithms with Worst-Case Performance for Packet Classification
TLDR
Two new simple dynamic classification algorithms are described, Heap-on-Trie or HoT and Binarysearchtree- on-trie or BoT for general classifiers, designed to perform well in each of the metrics simultaneously.
Scalable Packet Classification Using Condensate Bit Vector
TLDR
An improved bit-vector algorithm named Condensate Bit Vector which can be adapted to large policy databases in the backbone network is proposed and drastically improves in the storage requirements and search speed.
High-speed packet classification using segment tree
  • Ching-Fong Su
  • Computer Science
    Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137)
  • 2000
TLDR
A fast 2-dimensional packet classification algorithm with small memory requirement that draws on computational geometry techniques-segment tree and fractional cascading to achieve logarithmic classification time.
Fast and scalable packet classification
TLDR
A novel multifield classification scheme, called P/sup 2/C, is proposed, which exploits the strengths of state-of-the-art memory technologies to provide wire-speed classification performance for OC-192 and beyond, in combination with very high storage efficiency and the support of fast incremental updates.
Rule Caching for Packet Classification Support
TLDR
This paper proposes a caching technique to improve search performance of any classification algorithm using characteristics inherent to Internet traffic to achieve wire speed classification performance.
Packet classification consuming small amount of memory
TLDR
This paper describes a new algorithm for packet classification using the concept of independent sets that has very small memory requirements and also scales well from two-dimensional classifiers to high-dimensional ones.
A Novel Hash-based Packet Classification Algorithm
  • Zhen Xu, Jun Sun, Jun Zhang
  • Computer Science
    2005 5th International Conference on Information Communications & Signal Processing
  • 2005
TLDR
A new algorithm for packet classification that makes use of bits distribution features is described, which always takes the bits from every dimension into account, instead of constraining the search process in some of the dimensions at every stage.
High Performance Packet Classification
TLDR
This proposal seeks to develop methods for packet classification that can deliver high performance while being reasonably cost-effective (e.g. memory-efficient and having low hardware complexity).
Packet classification using diagonal-based tuple space search
...
...

References

SHOWING 1-10 OF 27 REFERENCES
Space Decomposition Techniques for Fast Layer-4 Switching
TLDR
A new scheme, based on space decomposition, whose search time is comparable to the best existing schemes, but which also offers fast worst-case filter update time and is amenable to fast software and hardware implementation.
High-speed policy-based packet forwarding using efficient multi-dimensional range matching
TLDR
New packet classification schemes are presented that, with a worst-case and traffic-independent performance metric, can classify packets, by checking amongst a few thousand filtering rules, at rates of a million packets per second using range matches on more than 4 packet header fields.
Packet filter management for layer 4 switching
TLDR
A geometric framework for studying lters is developed, and algorithms for detecting and resolving connicts are presented, including a scheme for connict resolution based on adding new lters.
Scalable high speed IP routing lookups
TLDR
This paper describes a new algorithm for best matching prefix using binary search on hash tables organized by prefix lengths that scales very well as address and routing table sizes increase and introduces Mutating Binary Search and other optimizations that considerably reduce the average number of hashes to less than 2.
Routing lookups in hardware at memory access speeds
  • Pankaj Gupta, Steven Lin, N. McKeown
  • Computer Science
    Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98
  • 1998
TLDR
This work presents a route lookup mechanism that when implemented in a pipelined fashion in hardware, can achieve one route lookup every memory access; much faster than current commercially available routing lookup schemes.
Small forwarding tables for fast routing lookups
TLDR
A forwarding table data structure designed for quick routing lookups, small enough to fit in the cache of a conventional general purpose processor and feasible to do a full routing lookup for each IP packet at gigabit speeds without special hardware.
Fast and scalable layer four switching
TLDR
Two new algorithms for solving the least cost matching filter problem at high speeds are described, based on a grid-of-tries construction and works optimally for processing filters consisting of two prefix fields using linear space.
Filtering search: A new approach to query-answering
  • B. Chazelle
  • Computer Science, Mathematics
    24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
We introduce a new technique for solving problems of the following form: preprocess a set of objects so that those satisfying a given property with respect to a query object can be listed very
Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N)
  • D. Willard
  • Computer Science, Mathematics
    Inf. Process. Lett.
  • 1983
Scalable high speed IP routing lookups
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP routing lookup req...
...
...