New Alternatives to Optimize Policy Classifiers

Growing expressiveness of services increases the size of a manageable state at the network data plane. A service policy is an ordered set of classification patterns (classes) with actions; the same class can appear in multiple policies. Previous studies mostly concentrated on efficient representations of a single policy instance. In this work, we study space efficiency of multiple policies, cutting down a classifier size by sharing instances of classes between policies that contain them. In this paper we identify conditions for such sharing, propose efficient algorithms and analyze them analytically. The proposed representations can be deployed transparently on existing packet processing engines. Our results are supported by extensive evaluations.

[1]  Haoyu Song,et al.  ABC: Adaptive Binary Cuttings for Multidimensional Packet Classification , 2013, IEEE/ACM Transactions on Networking.

[2]  Danny Hendler,et al.  Space-Efficient TCAM-Based Classification Using Gray Coding , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[3]  Patrick Th. Eugster,et al.  Towards efficient implementation of packet classifiers in SDN/OpenFlow , 2013, HotSDN '13.

[4]  Christopher Umans.  The minimum equivalent DNF problem and shortest implicants , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[5]  Patrick Th. Eugster,et al.  Strategies for Mitigating TCAM Space Bottlenecks , 2014, 2014 IEEE 22nd Annual Symposium on High-Performance Interconnects.

[6]  Michael R. Fellows,et al.  Analogs & duals of the MAST problem for sequences & trees , 2003, J. Algorithms.

[7]  Vadim G. Timkovsky.  Ten Etudes On Shortest Common Nonsubsequence And Supersequence Approximations , 1993 .

[8]  Kirill Kogan,et al.  General ternary bit strings on commodity longest-prefix-match infrastructures , 2017, 2017 IEEE 25th International Conference on Network Protocols (ICNP).

[9]  Haim Kaplan,et al.  On finding an optimal TCAM encoding scheme for packet classification , 2013, 2013 Proceedings IEEE INFOCOM.

[10]  Patrick Th. Eugster,et al.  SAX-PAC (Scalable And eXpressive PAcket Classification) , 2014, SIGCOMM.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Kirill Kogan,et al.  How to represent IPv6 forwarding tables on IPv4 or MPLS dataplanes , 2016, 2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[13]  Isaac Keslassy,et al.  Worst-Case TCAM Rule Expansion , 2010, 2010 Proceedings IEEE INFOCOM.

[14]  Hon Wai Leong,et al.  Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm , 2006, First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06).

[15]  Kirill Kogan,et al.  New Alternatives to Optimize Policy Classifiers , 2018, 2018 IEEE 26th International Conference on Network Protocols (ICNP).

[16]  Isaac Keslassy,et al.  Palette: Distributing tables in software-defined networks , 2013, 2013 Proceedings IEEE INFOCOM.

[17]  David Walker,et al.  Optimizing the "one big switch" abstraction in software-defined networks , 2013, CoNEXT.

[18]  Michael Segal,et al.  Space and Speed Tradeoffs in TCAM Hierarchical Packet Classification , 2008, 2008 IEEE Sarnoff Symposium.

[19]  Jonathan S. Turner,et al.  ClassBench: A Packet Classification Benchmark , 2005, IEEE/ACM Transactions on Networking.

[20]  T. N. Vijaykumar,et al.  EffiCuts: optimizing packet classification for memory and throughput , 2010, SIGCOMM '10.

[21]  Moshe Lewenstein,et al.  Improved Approximation Results on the Shortest Common Supersequence Problem , 2009, SPIRE.

[22]  V. G. Timkovskii.  Complexity of common subsequence and supersequence problems and related problems , 1989 .

[23]  Kirill Kogan,et al.  How to deal with range-based packet classifiers , 2019, SOSR.

[24]  Camil Demetrescu,et al.  Combinatorial algorithms for feedback problems in directed graphs , 2003, Inf. Process. Lett..

[25]  Paola Bonizzoni,et al.  An approximation algorithm for the shortest common supersequence problem: an experimental analysis , 2001, SAC.

[26]  Haoyu Song,et al.  Fast packet classification using bloom filters , 2006, 2006 Symposium on Architecture For Networking And Communications Systems.

[27]  Qiang Yang,et al.  Theory and Algorithms for Plan Merging , 1992, Artif. Intell..

[28]  Kirill Kogan,et al.  How to implement complex policies on existing network infrastructure , 2018, SOSR.

[29]  Z. Weng,et al.  A computational framework for optimal masking in the synthesis of oligonucleotide microarrays. , 2002, Nucleic acids research.

[30]  Joseph Naor,et al.  Approximating Minimum Feedback Sets and Multicuts in Directed Graphs , 1998, Algorithmica.

[31]  Patrick Th. Eugster,et al.  FIB efficiency in distributed platforms , 2016, 2016 IEEE 24th International Conference on Network Protocols (ICNP).

[32]  George Varghese,et al.  Fast and scalable layer four switching , 1998, SIGCOMM '98.

[33]  Kirill Kogan,et al.  Approximate Classifiers with Controlled Accuracy , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.