Towards efficient implementation of packet classifiers in SDN/OpenFlow

Authors:
Kirill Kogan;Sergey Nikolenko;William Culhane;Patrick Eugster;Eddie Ruan
Affiliations:
Purdue University, West lafayette, IN, USA;National Research University Higher School of Economics, Steklov Mathematical Institute, Saint Petersburg, Russian Fed.;Purdue University, West lafayette, IN, USA;Purdue university, West lafayette, IN, USA;Cisco Systems, San Jose, CA, USA
Venue:
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
Year:
2013

Citing 5
Cited 0

The minimum equivalent DNF problem and shortest implicants

Journal of Computer and System Sciences
Minimizing DNF Formulas and AC^0_d Circuits Given a Truth Table

CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Hardness of Minimizing and Learning DNF Expressions

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
TCAM Razor: a systematic approach towards minimizing packet classifiers in TCAMs

IEEE/ACM Transactions on Networking (TON)
Space and speed tradeoffs in TCAM hierarchical packet classification

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traffic classification is a core problem underlying efficient implementation of network services. In this work we draw from our experience in classifier design for commercial systems to address this problem in SDN and OpenFlow. We identify methods from other fields of computer science and show research directions that can be applied for efficient design of packet classifiers. Proposed abstractions and design patterns can significantly reduce requirements on network elements and enable deployment of functionality that would be infeasible in a traditional way.