Joint Optimization of Rule Placement and Traffic Engineering for QoS Provisioning in Software Defined Network

Software-Defined Network (SDN) is a promising network paradigm that separates the control plane and data plane in the network. It has shown great advantages in simplifying network management such that new functions can be easily supported without physical access to the network switches. However, Ternary Content Addressable Memory (TCAM), as a critical hardware storing rules for high-speed packet processing in SDN-enabled devices, can be supplied to each device with very limited quantity because it is expensive and energy-consuming. To efficiently use TCAM resources, we propose a rule multiplexing scheme, in which the same set of rules deployed on each node apply to the whole flow of a session going through but towards different paths. Based on this scheme, we study the rule placement problem with the objective of minimizing rule space occupation for multiple unicast sessions under QoS constraints. We formulate the optimization problem jointly considering routing engineering and rule placement under both existing and our rule multiplexing schemes. Via an extensive review of the state-of-the-art work, to the best of our knowledge, we are the first to study the non-routing-rule placement problem. Finally, extensive simulations are conducted to show that our proposals significantly outperform existing solutions.

[1]  Murali S. Kodialam,et al.  Traffic engineering in software defined networks , 2013, 2013 Proceedings IEEE INFOCOM.

[2]  Donald F. Towsley,et al.  Path Selection and Multipath Congestion Control , 2007, INFOCOM.

[3]  Martín Casado,et al.  NOX: towards an operating system for networks , 2008, CCRV.

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

[5]  Miroslav Popovic,et al.  MPTCP Is Not Pareto-Optimal: Performance Issues and a Possible Solution , 2013, IEEE/ACM Transactions on Networking.

[6]  Mark Crovella,et al.  Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies , 2011 .

[7]  Jonathan S. Turner,et al.  Packet classification using extended TCAMs , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

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

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

[10]  Donald F. Towsley,et al.  On optimal routing with multiple traffic matrices , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Min Sik Kim,et al.  Tree-Based Minimization of TCAM Entries for Packet Classification , 2010, 2010 7th IEEE Consumer Communications and Networking Conference.

[12]  K. Pagiamtzis,et al.  Content-addressable memory (CAM) circuits and architectures: a tutorial and survey , 2006, IEEE Journal of Solid-State Circuits.

[13]  Arvind Krishnamurthy,et al.  Proceedings of the 2014 ACM conference on SIGCOMM , 2014, SIGCOMM 2014.

[14]  Marimuthu Palaniswami,et al.  Optimal flow control and routing in multi-path networks , 2003, Perform. Evaluation.

[15]  Alan L. Cox,et al.  Maestro: A System for Scalable OpenFlow Control , 2010 .

[16]  Alan L. Cox,et al.  PAST: scalable ethernet for data centers , 2012, CoNEXT '12.

[17]  Rob Sherwood,et al.  Can the Production Network Be the Testbed? , 2010, OSDI.

[18]  R. Srikant,et al.  Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet , 2006, IEEE/ACM Transactions on Networking.

[19]  Thierry Turletti,et al.  A Survey of Software-Defined Networking: Past, Present, and Future of Programmable Networks , 2014, IEEE Communications Surveys & Tutorials.

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

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

[22]  Song Guo,et al.  Joint optimization of task mapping and routing for service provisioning in distributed datacenters , 2014, 2014 IEEE International Conference on Communications (ICC).

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

[24]  Xiaojun Shen,et al.  Achieving maximum throughput with a minimum number of label switched paths in MPLS networks , 2005, Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005..

[25]  Jia Wang,et al.  Scalable flow-based networking with DIFANE , 2010, SIGCOMM '10.

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

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

[28]  Lemin Li,et al.  Optimal provisioning for elastic service oriented virtual network request in cloud computing , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

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

[30]  Alex C. Snoeren,et al.  High-fidelity switch models for software-defined network emulation , 2013, HotSDN '13.

[31]  Ming Zhang,et al.  MicroTE: fine grained traffic engineering for data centers , 2011, CoNEXT '11.

[32]  Reuven Cohen,et al.  Optimizing Data Plane Resources for Multipath Flows , 2015, IEEE/ACM Transactions on Networking.