OFFICER: A general optimization framework for OpenFlow rule allocation and endpoint policy enforcement

The Software-Defined Networking approach permits to realize new policies. In OpenFlow in particular, a controller decides on behalf of the switches which forwarding rules must be installed and where. However with this flexibility comes the challenge of the computation of a rule allocation matrix meeting both high-level policies and the network constraints such as memory or link capacity limitations. Nevertheless, in many situations (e.g., data-center networks), the exact path followed by packets does not severely impact performances as long as packets are delivered according to the endpoint policy. It is thus possible to deviate part of the traffic to alternative paths so to better use network resources without violating the endpoint policy. In this paper, we propose a linear optimization model of the rule allocation problem in resource constrained OpenFlow networks with relaxing routing policy. We show that the general problem is NP-hard and propose a polynomial time heuristic, called OFFICER, which aims to maximize the amount of carried traffic in under-provisioned networks. Our numerical evaluation on four different topologies shows that exploiting various paths allows to increase the amount of traffic supported by the network without significantly increasing the path length.

[1]  Mikkel Thorup,et al.  Compact routing schemes , 2001, SPAA '01.

[2]  Martin Dräxler,et al.  MaxiNet: Distributed emulation of software-defined networks , 2014, 2014 IFIP Networking Conference.

[3]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

[4]  2015 IEEE Conference on Computer Communications, INFOCOM 2015, Kowloon, Hong Kong, April 26 - May 1, 2015 , 2015, IEEE Conference on Computer Communications.

[5]  Jia Wang,et al.  Making Routers Last Longer with ViAggre , 2009, NSDI.

[6]  Minlan Yu,et al.  Scalable flow-based networking with DIFANE , 2010, SIGCOMM 2010.

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

[8]  Devavrat Shah,et al.  Fastpass: a centralized "zero-queue" datacenter network , 2015, SIGCOMM 2015.

[9]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[10]  Thierry Turletti,et al.  Optimizing rules placement in OpenFlow networks: trading routing for better efficiency , 2014, HotSDN.

[11]  Sujata Banerjee,et al.  DevoFlow: scaling flow management for high-performance networks , 2011, SIGCOMM 2011.

[12]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[13]  David A. Maltz,et al.  Network traffic characteristics of data centers in the wild , 2010, IMC '10.

[14]  Min Zhu,et al.  B4: experience with a globally-deployed software defined wan , 2013, SIGCOMM.

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

[16]  Ramesh Govindan,et al.  vCRIB: Virtualized Rule Management in the Cloud , 2012, HotCloud.

[17]  George Pavlou,et al.  A toolchain for simplifying network simulation setup , 2013, SimuTools.

[18]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[19]  Vijay Mann,et al.  SwitchReduce: Reducing switch state and controller involvement in OpenFlow networks , 2013, 2013 IFIP Networking Conference.

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

[21]  Xin Jin,et al.  Dynamic scheduling of network updates , 2014, SIGCOMM.

[22]  Shinji Kobayashi,et al.  DomainFlow: practical flow management method using multiple flow tables in commodity switches , 2013, CoNEXT.

[23]  Rob Sherwood,et al.  The controller placement problem , 2012, HotSDN@SIGCOMM.