Towards efficient implementation of packet classifiers in SDN/OpenFlow

HotSDN 2013 - Proceedings of the 2013 ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking

Volumn , Issue , 2013, Pages 153-154

  Kogan, Kirill ^a   Nikolenko, Sergey ^b   Culhane, William ^a   Eugster, Patrick ^a   Ruan, Eddie ^c  

^a PURDUE UNIVERSITY   (United States)

^b NATIONAL RESEARCH UNIVERSITY HIGHER SCHOOL OF ECONOMICS   (Russian Federation)

^c CISCO SYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFIER DESIGN; COMMERCIAL SYSTEMS; DESIGN PATTERNS; EFFICIENT DESIGNS; EFFICIENT IMPLEMENTATION; NETWORK ELEMENT; NETWORK SERVICES; TRAFFIC CLASSIFICATION;

TELECOMMUNICATION TRAFFIC;

EID: 84883731481     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2491185.2491219     Document Type: Conference Paper

References (8)

1. d circuits given a truth table. In IEEE Conference on Computational Complexity, pages 237-251, 2006.
2. A. Kesselman, K. Kogan, S. Nemzer, and M. Segal. Space and speed tradeoffs in TCAM hierarchical packet classification. J. Comput. Syst. Sci., 79(1): 111-121, 2013.
3. S. Khot and R. Saket. Hardness of minimizing and learning DNF expressions. In FOCS, pages 231-240, 2008.
4. Alex X. Liu, Chad R. Meiners, and Eric Torng. TCAM razor: a systematic approach towards minimizing packet classifiers in TCAMs. IEEE/ACM Trans. Netw., 18(2): 490-500, 2010.
5. Netlogic Microsystems. Content addressable memory. http://www. netlogicmicro.com.
6. OpenFlow 1.3 specification, 2012. http://www.openflow.org/wk/index.php/ OpenFlow-1-3-proposal.
7. C. Umans. The minimum equivalent DNF problem and shortest implicants. J. Comput. Syst. Sci., 63(4): 597-611, 2001.
8. D. Hay Y. Kanizo and I. Keslassy. Palette: Distributing tables in software-defined networks. In INFOCOM, 2013.