CASA: Congestion and Stretch Aware Static Fast Rerouting

To meet the stringent requirements on the maximally tolerable disruptions of traffic under link failures, many communication networks feature some sort of static failover mechanism for fast rerouting. However, configuring such static failover mechanisms to achieve a high degree of robustness is known to be challenging, in particular when packet tagging or dynamic node state cannot be used. This paper initiates the systematic study of such local fast failover mechanisms which not only provide connectivity guarantees, even under multiple link failures, but also account for the quality of the resulting failover routes, with respect to locality (i.e., route length) and congestion. Failover quality has received less attention in the literature so far, yet it is increasingly important to support emerging applications.We first show that there exists an inherent tradeoff in terms of achievable locality and congestion of failover routes. We then present CASA, an algorithm providing a high degree of robustness as well as a provable quality of fast rerouting. CASA combines two crucial static resilient routing techniques: combinatorial designs and arc-disjoint arborescences. We complement our formal analysis with a simulation study, in which we compare our algorithms with the state-of-the-art in different scenarios and show benefits in terms of stretch, load, and resilience.

[1]  A. Robert Calderbank,et al.  Network Pricing and Rate Allocation with Content Provider Participation , 2009, IEEE INFOCOM 2009.

[2]  Alexander Russell,et al.  Distributed scheduling for disconnected cooperation , 2005, Distributed Computing.

[3]  Junda Liu,et al.  Ensuring connectivity via data plane mechanisms , 2013, NSDI 2013.

[4]  Philip N. Klein,et al.  A subexponential parameterized algorithm for Subset TSP on planar graphs , 2014, SODA.

[5]  Lajos Rónyai,et al.  A Tractable Stochastic Model of Correlated Link Failures Caused by Disasters , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.

[6]  Albert G. Greenberg,et al.  A case study of OSPF behavior in a large enterprise network , 2002, IMW '02.

[7]  Debmalya Panigrahi,et al.  Fast edge splitting and Edmonds' arborescence construction for unweighted graphs , 2008, SODA '08.

[8]  Stefan Schmid,et al.  Walking Through Waypoints , 2017, Algorithmica.

[9]  Stefan Schmid,et al.  Local Fast Segment Rerouting on Hypercubes , 2018, OPODIS.

[10]  Marco Chiesa,et al.  On the Resiliency of Randomized Routing Against Multiple Edge Failures , 2016, ICALP.

[11]  Srihari Nelakuditi,et al.  IP fast reroute with failure inferencing , 2007, INM '07.

[12]  Joan Feigenbaum,et al.  On the Resilience of Routing Tables , 2012, ArXiv.

[13]  Marco Chiesa,et al.  Exploring the Limits of Static Failover Routing , 2014, ArXiv.

[14]  Stefan Schmid,et al.  Local Fast Failover Routing With Low Stretch , 2018, CCRV.

[15]  Alberto Dainotti,et al.  Blink: Fast Connectivity Recovery Entirely in the Data Plane , 2019, NSDI.

[16]  Srikanta Tirthapura,et al.  Analysis of link reversal routing algorithms for mobile ad hoc networks , 2003, SPAA '03.

[17]  Xie-Bin Chen,et al.  Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs , 2011, Inf. Process. Lett..

[18]  Eddie Cheng,et al.  Independent spanning trees on even networks , 2011, Inf. Sci..

[19]  Marco Chiesa,et al.  On the Resiliency of Static Forwarding Tables , 2017, IEEE/ACM Transactions on Networking.

[20]  Stefan Schmid,et al.  Load-Optimal Local Fast Rerouting for Dense Networks , 2018, IEEE/ACM Transactions on Networking.

[21]  Edith Cohen,et al.  Optimal oblivious routing in polynomial time , 2003, STOC '03.

[22]  Alan L. Cox,et al.  Scalable Multi-Failure Fast Failover via Forwarding Table Compression , 2016, SOSR.

[23]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[24]  Petr Kuznetsov,et al.  A distributed and robust SDN control plane for transactional network updates , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[25]  Stefan Schmid,et al.  How (Not) to Shoot in Your Foot with SDN Local Fast Failover - A Load-Connectivity Tradeoff , 2013, OPODIS.

[26]  Marco Chiesa,et al.  TI-MFA: Keep calm and reroute segments fast , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[27]  Stefan Schmid,et al.  Provable data plane connectivity with local fast failover: introducing openflow graph algorithms , 2014, HotSDN.

[28]  Athina Markopoulou,et al.  Characterization of failures in an IP backbone , 2004, IEEE INFOCOM 2004.

[29]  Eddie Cheng,et al.  Optimal Independent Spanning Trees on Odd Graphs , 2011, The Journal of Supercomputing.

[30]  Marco Chiesa,et al.  The quest for resilient (static) forwarding tables , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[31]  Jou-Ming Chang,et al.  Optimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs , 2014, Comput. J..

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

[33]  Jou-Ming Chang,et al.  Parallel construction of optimal independent spanning trees on hypercubes , 2007, Parallel Comput..

[34]  Yin Zhang,et al.  R3: resilient routing reconfiguration , 2010, SIGCOMM '10.

[35]  Abishek Gopalan,et al.  IP Fast Rerouting for Multi-Link Failures , 2016, IEEE/ACM Transactions on Networking.

[36]  Alan L. Cox,et al.  Plinko: building provably resilient forwarding tables , 2013, HotNets.

[37]  David Clark,et al.  A Purpose-built Global Network: Google’s Move to SDN , 2015, ACM Queue.

[38]  Navendu Jain,et al.  Understanding network failures in data centers: measurement, analysis, and implications , 2011, SIGCOMM.

[39]  Srikanth Kandula,et al.  Traffic engineering with forward fault correction , 2014, SIGCOMM.

[40]  D. R. Fulkerson,et al.  On edge-disjoint branchings , 1976, Networks.

[41]  Dimitri P. Bertsekas,et al.  Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology , 1981, IEEE Trans. Commun..