Too Many SDN Rules? Compress Them with MINNIE

Software Defined Networking (SDN) is gaining momentum with the support of major manufacturers. While it brings flexibility in the management of flows within the data center fabric, this flexibility comes at the cost of smaller routing table capacities. In this paper, we investigate compression techniques to reduce the forwarding information base (FIB) of SDN switches. We validate our algorithm, called MINNIE, on a real testbed able to emulate a 20 switches fat tree architecture. We demonstrate that even with a small number of clients, the limit in terms of number of rules is reached if no compression is performed, increasing the delay of all new incoming flows. MINNIE, on the other hand, reduces drastically the number of rules that need to be stored with a limited impact on the packet loss rate. We also evaluate the actual switching and reconfiguration times and the delay introduced by the communications with the controller.

[1]  Subhasis Banerjee,et al.  Tag-In-Tag: Efficient flow table management in SDN switches , 2014, 10th International Conference on Network and Service Management (CNSM) and Workshop.

[2]  Martín Casado,et al.  Rethinking enterprise network control , 2009, TNET.

[3]  Fernando M. V. Ramos,et al.  Software-Defined Networking: A Comprehensive Survey , 2014, Proceedings of the IEEE.

[4]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[5]  Eric Torng,et al.  TCAM Razor: a systematic approach towards minimizing packet classifiers in TCAMs , 2010, TNET.

[6]  Frédéric Giroire,et al.  Compressing Two-dimensional Routing Tables with Order , 2016, Electron. Notes Discret. Math..

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

[8]  Subhasis Banerjee,et al.  Compact TCAM: Flow Entry Compaction in TCAM for Power Aware SDN , 2013, ICDCN.

[9]  Thierry Turletti,et al.  OFFICER: A general optimization framework for OpenFlow rule allocation and endpoint policy enforcement , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

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

[11]  Haitao Wu,et al.  Explicit Path Control in Commodity Data Centers: Design and Applications , 2016, IEEE/ACM Transactions on Networking.

[12]  Frédéric Giroire,et al.  Optimizing rule placement in software-defined networks for energy-aware routing , 2014, 2014 IEEE Global Communications Conference.

[13]  David Erickson,et al.  The beacon openflow controller , 2013, HotSDN '13.

[14]  Eric Torng,et al.  Bit Weaving: A Non-Prefix Approach to Compressing Packet Classifiers in TCAMs , 2012, IEEE/ACM Transactions on Networking.

[15]  David S. Johnson,et al.  Compressing rectilinear pictures and minimizing access control lists , 2007, SODA '07.

[16]  Richard Wang,et al.  OpenFlow-Based Server Load Balancing Gone Wild , 2011, Hot-ICE.

[17]  George Varghese,et al.  Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN , 2013, SIGCOMM.

[18]  Alexander Shalimov,et al.  Advanced study of SDN/OpenFlow controllers , 2013 .

[19]  Joseph Naor,et al.  On the effect of forwarding table size on SDN network utilization , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.