Let me rephrase that: Transparent optimization in SDNs

Enterprise networks today have highly diverse correctness requirements and relatively common performance objectives. As a result, preferred abstractions for enterprise networks are those which allow matching correctness specification, while transparently managing performance. Existing SDN network management architectures, however, bundle correctness and performance as a single abstraction. We argue that this creates an SDN ecosystem that is unnecessarily hard to build, maintain and evolve. We advocate a separation of the diverse correctness abstractions from generic performance optimization, to enable easier evolution of SDN controllers and platforms. We propose Oreo, a first step towards a common and relatively transparent performance optimization layer for SDN. Oreo performs the optimization by first building a model that describes every flow in the network, and then performing network-wide, multi-objective optimization based on this model without disrupting higher level correctness.

[1]  Eric Torng,et al.  A difference resolution approach to compressing Access Control Lists , 2013, 2013 Proceedings IEEE INFOCOM.

[2]  David Walker,et al.  Compiling Path Queries , 2016, NSDI.

[3]  Vyas Sekar,et al.  Simplifying Software-Defined Network Optimization Using SOL , 2016, NSDI.

[4]  Minlan Yu,et al.  SIMPLE-fying middlebox policy enforcement using SDN , 2013, SIGCOMM.

[5]  Marco Canini,et al.  FatTire: declarative fault tolerance for software-defined networks , 2013, HotSDN '13.

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

[7]  David Walker,et al.  Infinite CacheFlow in software-defined networks , 2014, HotSDN.

[8]  Nate Foster,et al.  NetKAT: semantic foundations for networks , 2014, POPL.

[9]  Eric Torng,et al.  Firewall Compressor: An Algorithm for Minimizing Firewall Policies , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[10]  Brian Zill,et al.  Constructing optimal IP routing tables , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[11]  Emin Gün Sirer,et al.  Managing the network with Merlin , 2013, HotNets.

[12]  George Varghese,et al.  Real Time Network Policy Checking Using Header Space Analysis , 2013, NSDI.

[13]  Brighten Godfrey,et al.  VeriFlow: verifying network-wide invariants in real time , 2012, HotSDN '12.

[14]  J. Y. Yen An algorithm for finding shortest routes from all source nodes to a given destination in general networks , 1970 .

[15]  Martín Casado,et al.  Fabric: a retrospective on evolving SDN , 2012, HotSDN '12.