Load-Optimal Local Fast Rerouting for Dense Networks

• Published in: IEEE/ACM transactions on networking Vol. 26; no. 6; pp. 2583 - 2597
• Main Authors: Borokhovich, Michael, Pignolet, Yvonne-Anne, Schmid, Stefan, Tredan, Gilles
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.12.2018; The Institute of Electrical and Electronics Engineers, Inc. (IEEE); IEEE/ACM
• Subjects: Algorithms; Allocations; Combinatorial analysis; Computer network reliability; Computer networks; Computer Science; Control systems; Data Structures and Algorithms; Design; Distributed algorithms; Failure; Load; Load modeling; Lower bounds; Network control; Networking and Internet Architecture; Networks; Resource management; Route selection; Routing; Run time (computers); Runtime; Tagging
• ISSN: 1063-6692; 1558-2566
• DOI: 10.1109/TNET.2018.2871089

Reliable and highly available computer networks must implement resilient fast rerouting mechanisms: upon a link or node failure, an alternative route is determined quickly, without involving the network control plane. Designing such fast failover mechanisms capable of dealing with multiple concurrent failures, however, is challenging, as failover rules need to be installed proactively , i.e., ahead of time, without knowledge of the actual failures happening at runtime. Indeed, only little is known today about the design of resilient routing algorithms. This paper introduces a general framework to reason about and design local failover algorithms that minimize the resulting load after failover on dense networks, beyond destination-based routing. We show that due to the inherent locality of the failover decisions at runtime, the problem is fundamentally related to the field of distributed algorithms without coordination . We derive an intriguing lower bound on the inherent network load overhead any local fast failover scheme that will introduce in the worst case, even though globally seen, much more balanced traffic allocations exist. We then present different randomized and deterministic failover algorithms and analyze their overhead load. In particular, we build upon the theory of combinatorial designs and develop a novel deterministic failover mechanism based on symmetric block design theory , which tolerates a maximal number of link failures while ensuring low loads.