Efficient Data Plane Protection for SDN

Software-defined networks (SDN) usually require intervention of a controller to restore connectivity in case of link or node failures. To avoid this dependence, a fast failover function enables switches to locally detect a failure and deviate affected traffic. In this paper, we develop fast reroute (FRR) methods leveraging that feature and the principle of loop-free alternates (LFAs) from IP networks for network-wide configuration. We explain how LFAs, remote LFAs, and novel explicit-path LFAs may be implemented with OpenFlow so that SDN with general destination-based routing can be protected. An advanced loop detection and termination function is suggested to prevent loops that may be caused by FRR in case of severe failures. We evaluate the FRR methods on a large set of representative network topologies and compare them with existing FRR methods. Classic rLFAs from IP networks generate many loops in case of node failures so that they are not appropriate for SDN. One developed protection method is particularly suitable for SDN as it can protect all flows in a network against any single link and node failure. The solution is efficient because it secures most traffic also in case of dual failures, leads to short backup paths, and requires in most networks only a few additional forwarding entries per node. The latter is important as OpenFlow switches can accommodate only a moderate number of forwarding entries in their flow tables.

[1]  Chen-Nee Chuah,et al.  Fast Local Rerouting for Handling Transient Link Failures , 2007, IEEE/ACM Transactions on Networking.

[2]  Shengru Li,et al.  Flexible Traffic Engineering: When OpenFlow Meets Multi-Protocol IP-Forwarding , 2014, IEEE Communications Letters.

[3]  Pontus Sköldström,et al.  Scalable fault management for OpenFlow , 2012, 2012 IEEE International Conference on Communications (ICC).

[4]  Olivier Bonaventure,et al.  An evaluation of IP-based fast reroute techniques , 2005, CoNEXT '05.

[5]  Fernando A. Kuipers,et al.  Fast Recovery in Software-Defined Networks , 2014, 2014 Third European Workshop on Software Defined Networks.

[6]  Biswanath Mukherjee,et al.  IP resilience within an autonomous system: current approaches, challenges, and future directions , 2005, IEEE Communications Magazine.

[7]  Davide Sanvito,et al.  SPIDER: Fault resilient SDN pipeline with recovery delay guarantees , 2015, 2016 IEEE NetSoft Conference and Workshops (NetSoft).

[8]  Stewart Bryant,et al.  Internet Engineering Task Force (ietf) a Framework for Ip and Mpls Fast Reroute Using Not-via Addresses , 2022 .

[9]  Clarence Filsfils,et al.  Topology Independent Fast Reroute using Segment Routing , 2018 .

[10]  Stewart Bryant,et al.  Remote Loop-Free Alternate (LFA) Fast Reroute (FRR) , 2015, RFC.

[11]  Hannes Gredler,et al.  Remote-LFA Node Protection and Manageability , 2017, RFC.

[12]  Sheng Wang,et al.  Discussion on the combination of Loop-Free Alternates and Maximally Redundant Trees for IP networks Fast Reroute , 2014, 2014 IEEE International Conference on Communications (ICC).

[13]  Mustafa Ulutas,et al.  Multi Topology Routing based IP Fast Re-Route for Software Defined Networks , 2016, 2016 IEEE Symposium on Computers and Communication (ISCC).

[14]  Michael Menth,et al.  Loop-free alternates and not-via addresses: A proper combination for IP fast reroute? , 2010, Comput. Networks.

[15]  Gábor Rétvári,et al.  On providing fast protection with remote loop-free alternates , 2015, Telecommun. Syst..

[16]  Chris Bowers,et al.  An Architecture for IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR) , 2016, RFC.

[17]  Didier Colle,et al.  Self-configuring loop-free alternates with high link failure coverage , 2014, Telecommun. Syst..

[18]  Alia Atlas,et al.  Basic Specification for IP Fast Reroute: Loop-Free Alternates , 2008, RFC.

[19]  Niels L. M. van Adrichem,et al.  Backup rules in Software-Defined Networks , 2016, 2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN).

[20]  Oliver C. Ibe,et al.  A survey of IP and multiprotocol label switching fast reroute schemes , 2007, Comput. Networks.

[21]  Christian Esteve Rothenberg,et al.  SlickFlow: Resilient source routing in Data Center Networks unlocked by OpenFlow , 2013, 38th Annual IEEE Conference on Local Computer Networks.

[22]  Gábor Rétvári,et al.  IP fast ReRoute: Loop Free Alternates revisited , 2011, 2011 Proceedings IEEE INFOCOM.

[23]  Matthew Roughan,et al.  The Internet Topology Zoo , 2011, IEEE Journal on Selected Areas in Communications.

[24]  Alia Atlas,et al.  Fast Reroute Extensions to RSVP-TE for LSP Tunnels , 2005, RFC.

[25]  Yustus Eko Oktian,et al.  Distributed SDN controller system: A survey on design choice , 2017, Comput. Networks.

[26]  Michael Menth,et al.  Loop-Free Alternates with Loop Detection for Fast Reroute in Software-Defined Carrier and Data Center Networks , 2016, Journal of Network and Systems Management.

[27]  Srinivasan Ramasubramanian,et al.  Independent Directed Acyclic Graphs for Resilient Multipath Routing , 2012, IEEE/ACM Transactions on Networking.

[28]  Clarence Filsfils,et al.  Loop avoidance using Segment Routing , 2020 .

[29]  Zhi-Li Zhang,et al.  On the Feasibility and Efficacy of Protection Routing in IP Networks , 2010, IEEE/ACM Transactions on Networking.

[30]  Gábor Rétvári,et al.  Optimizing IGP link costs for improving IP-level resilience with Loop-Free Alternates , 2013, Comput. Commun..

[31]  Stein Gjessing,et al.  Fast IP Network Recovery Using Multiple Routing Configurations , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[32]  Michael Menth,et al.  Performance comparison of not-via addresses and maximally redundant trees (MRTs) , 2013, 2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013).

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