Flow Entry Sharing in Protection Design for Software Defined Networks

In Software Defined Networks (SDN), though we can design protection mechanism to enable fast recovery against a single link failure, it requires proactively installing a large number of flow entries in switches on working paths and backup paths. However, these additional flow entries in a SDN switch may exhaust Ternary Content Addressable Memory (TCAM) which is limited in size since it is expensive and power hungry. Accordingly, it is emergent to design a new protection technology to minimize flow entry occupation. To this end, we leverage flow entry sharing in SDN protection to solve this problem. We first present the problem as an ILP (Integer Linear Programming) model, and then design a greedy based heuristic algorithm named Flow Entry Sharing Protection (FESP). Extensive simulation results show that compared with the previous SDN protection algorithms, FESP reduces 28.31% flow entries and 27.65% link bandwidth in average.

[1]  Tram Truong Huu,et al.  TCAM-Aware Local Rerouting for Fast and Efficient Failure Recovery in Software Defined Networks , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).

[2]  Piero Castoldi,et al.  OpenFlow-based segment protection in Ethernet networks , 2013, IEEE/OSA Journal of Optical Communications and Networking.

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

[4]  Yuan-Cheng Lai,et al.  Fast failover and switchover for link failures and congestion in software defined networks , 2016, 2016 IEEE International Conference on Communications (ICC).

[5]  Didier Colle,et al.  OpenFlow: Meeting carrier-grade recovery requirements , 2013, Comput. Commun..

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

[7]  Weifa Liang,et al.  Near-Optimal Routing Protection for In-Band Software-Defined Heterogeneous Networks , 2016, IEEE Journal on Selected Areas in Communications.

[8]  Song Guo,et al.  Joint Optimization of Rule Placement and Traffic Engineering for QoS Provisioning in Software Defined Network , 2015, IEEE Transactions on Computers.

[9]  Usman Ashraf.  Rule Minimization for Traffic Evolution in Software-Defined Networks , 2017, IEEE Communications Letters.

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

[11]  Shahram Shah-Heydari,et al.  Multi-failure restoration with minimal flow operations in software defined networks , 2015, 2015 11th International Conference on the Design of Reliable Communication Networks (DRCN).

[12]  H. Jonathan Chao,et al.  Congestion-aware single link failure recovery in hybrid SDN networks , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

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

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

[15]  Didier Colle,et al.  Enabling fast failure recovery in OpenFlow networks , 2011, 2011 8th International Workshop on the Design of Reliable Communication Networks (DRCN).