Consistent SDN Rule Update with Reduced Number of Scheduling Rounds

Consistent operation of software-defined network (SDN) switches during the transient periods of forwarding rule updates is a critical issue. This paper studies the problem of updating SDN rules, while preserving two essential security and performance consistency properties: (1) Waypoint Enforcement which mandates that all packets traverse a specific checkpoint (e.g., firewall), and (2) Loop-Freedom that prevents forwarding packets along a loop. To guarantee these properties, we schedule rule updates in multiple rounds. To reduce the time that the network stays in the transient period of updating the switches, we have to solve the NP-hard problem of minimizing the number of update rounds. To this end, we design a fast algorithm called RRS which can be applied to very large networks. Our experiments on a large dataset of 28K scenarios show that RRS achieves a 323x improvement in the median of execution time compared to solving the exact Mixed Integer Program (MIP) formulation.

[1]  John Moy,et al.  Graceful OSPF Restart , 2003, RFC.

[2]  Arne Ludwig,et al.  Transiently Secure Network Updates , 2016, SIGMETRICS.

[3]  Edmundo Roberto Mauro Madeira,et al.  An adaptive mechanism for LTE P-GW virtualization using SDN and NFV , 2017, 2017 13th International Conference on Network and Service Management (CNSM).

[4]  Nate Foster,et al.  Efficient synthesis of network updates , 2014, PLDI.

[5]  Srikanth Kandula,et al.  Achieving high utilization with software-driven WAN , 2013, SIGCOMM.

[6]  Vyas Sekar,et al.  Making middleboxes someone else's problem: network processing as a cloud service , 2012, SIGCOMM '12.

[7]  Raouf Boutaba,et al.  On orchestrating virtual network functions , 2015, 2015 11th International Conference on Network and Service Management (CNSM).

[8]  Guihai Chen,et al.  Minimizing Transient Congestion during Network Update in Data Centers , 2015, ICNP.

[9]  Ratul Mahajan,et al.  Consistent updates in software defined networks: On dependencies, loop freedom, and blackholes , 2016, 2016 IFIP Networking Conference (IFIP Networking) and Workshops.

[10]  Guihai Chen,et al.  Congestion-Minimizing Network Update in Data Centers , 2019, IEEE Transactions on Services Computing.

[11]  Xiang-Yang Li,et al.  Joint Route Selection and Update Scheduling for Low-Latency Update in SDNs , 2017, IEEE/ACM Transactions on Networking.

[12]  Arne Ludwig,et al.  Efficient Loop-Free Rerouting of Multiple SDN Flows , 2018, IEEE/ACM Transactions on Networking.

[13]  David Walker,et al.  Abstractions for network update , 2012, SIGCOMM '12.

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

[15]  Arne Ludwig,et al.  Good Network Updates for Bad Packets: Waypoint Enforcement Beyond Destination-Based Routing Policies , 2014, HotNets.

[16]  A. Shaikh,et al.  Avoiding instability during graceful shutdown of multiple OSPF routers , 2006, IEEE/ACM Transactions on Networking.

[17]  Stefano Vissicchio,et al.  FLIP the (Flow) table: Fast lightweight policy-preserving SDN updates , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[18]  Roger Wattenhofer,et al.  On consistent migration of flows in SDNs , 2016 .

[19]  Arne Ludwig,et al.  Scheduling Loop-free Network Updates: It's Good to Relax! , 2015, PODC.

[20]  A. Neeraja,et al.  Licensed under Creative Commons Attribution Cc by Improving Network Management with Software Defined Networking , 2022 .

[21]  Arne Ludwig,et al.  Transiently Consistent SDN Updates: Being Greedy is Hard , 2016, SIROCCO.

[22]  Ratul Mahajan,et al.  On consistent updates in software defined networks , 2013, HotNets.

[23]  Chadi Assi,et al.  A Reliability-Aware Network Service Chain Provisioning With Delay Guarantees in NFV-Enabled Enterprise Datacenter Networks , 2017, IEEE Transactions on Network and Service Management.

[24]  David Walker,et al.  Incremental consistent updates , 2013, HotSDN '13.