Proceedings ArticleDOI
Tradeoffs for packet classification
A. Feldman,S. Muthukrishnan +1 more
- Vol. 3, pp 1193-1202
Reads0
Chats0
TLDR
An algorithmic framework for solving the packet classification problem that allows various access time versus memory tradeoffs is presented and gives the best known lookup performance with moderately large memory space.Abstract:
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 perform a thorough experimental study of the tradeoffs for the two-dimensional packet classification problem on rulesets derived from datasets collected from AT&T WorldNet, an Internet service provider.read more
Citations
More filters
Proceedings Article
The design and implementation of open vSwitch
Ben Pfaff,Justin Pettit,Teemu Koponen,Ethan J. Jackson,Andy Zhou,Jarno Rajahalme,Jesse E. Gross,Alex Wang,Jonathan Stringer,Pravin Shelar,Keith E. Amidon,Martin Casado +11 more
TL;DR: The design and implementation of Open vSwitch is described, a multi-layer, open source virtual switch for all major hypervisor platforms, and the advanced flow classification and caching techniques that Open v switch uses to optimize its operations and conserve hypervisor resources are detailed.
Journal ArticleDOI
Algorithms for packet classification
Pankaj Gupta,Nick McKeown +1 more
TL;DR: This tutorial describes algorithms that are representative of each category of basic search algorithms, and discusses which type of algorithm might be suitable for different applications.
Journal ArticleDOI
Survey and taxonomy of IP address lookup algorithms
TL;DR: A survey of state-of-the-art IP address lookup algorithms is presented and their performance in terms of lookup speed, scalability, and update overhead is compared.
Proceedings ArticleDOI
Packet classification using multidimensional cutting
TL;DR: This paper introduces a classification algorithm called phHyperCuts, which can provide an order of magnitude improvement over existing classification algorithms and can be fully pipelined to provide one classification result every packet arrival time, and also allows fast updates.
Journal ArticleDOI
Survey and taxonomy of packet classification techniques
TL;DR: A survey of the seminal and recent solutions to the packet classification problem is provided, using a taxonomy based on the high-level approach to the problem and a minimal set of running examples to foster a deeper understanding of the various packet classification techniques.
References
More filters
Proceedings ArticleDOI
Scalable high speed IP routing lookups
TL;DR: 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.
Proceedings ArticleDOI
Packet classification on multiple fields
Pankaj Gupta,Nick McKeown +1 more
TL;DR: It is found that a simple multi-stage classification algorithm, called RFC (recursive flow classification), can classify 30 million packets per second in pipelined hardware, or one million packetsper second in software.
Proceedings ArticleDOI
Small forwarding tables for fast routing lookups
TL;DR: 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.
Proceedings ArticleDOI
High-speed policy-based packet forwarding using efficient multi-dimensional range matching
TL;DR: 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.
Proceedings ArticleDOI
Fast and scalable layer four switching
TL;DR: 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.