Achieving Fast and Lightweight SDN Updates with Segment Routing

In SDN, forwarding rules are frequently updated to adapt to network dynamics. During the procedure, path consistency needs to be preserved; otherwise, in-flight packets might meet with forwarding errors such as loops and black holes. Despite a large number of suggestions have been proposed, they take either a long duration or have high rule-space overheads, thus fail to be practical for large-scale high dynamic networks. In this paper, we propose FLUS, a Segment Routing (SR) based mechanism, to achieve fast and lightweight path updates. Basically, when a route needs a change, FLUS instantly employs SR to construct its desired new path by concatenating some fragments of the already existing paths. After the actual paths are established, FLUS then shifts incoming packets to them and disables the transitional ones. Such a design helps packets enjoy their new paths immediately without introducing rule-space overheads. This paper presents FLUS's segment allocation, path construction, and the corresponding optimal algorithms in detail. Our evaluation based on real and synthesized networks shows: FLUS can handle up to 92-100% updates using SR in real-time and save 72-88% rule overhead compared to prior methods.

[1]  Tal Mizrahi,et al.  TimeFlip: Scheduling network updates with timestamp-based TCAM ranges , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

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

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

[4]  Yves Deville,et al.  SCMon: Leveraging segment routing to improve network monitoring , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[5]  Maciej Kuźniar,et al.  What You Need to Know About SDN Flow Tables , 2015, PAM.

[6]  Mingui Zhang,et al.  Fast lossless traffic migration for SDN updates , 2015, 2015 IEEE International Conference on Communications (ICC).

[7]  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.

[8]  Lemin Li,et al.  Arrange your network updates as you wish , 2016, 2016 IFIP Networking Conference (IFIP Networking) and Workshops.

[9]  T. V. Lakshman,et al.  Optimized network traffic engineering using segment routing , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[10]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[11]  Yixin Chen,et al.  Cupid: Congestion-free consistent data plane update in software defined networks , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

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

[13]  Olivier Bonaventure,et al.  A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks , 2015, SIGCOMM.

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

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