2026-07-26T21:51:16Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6269 2024-03-06T10:37:56Z ddc:004 open_access

On the Resiliency of Randomized Routing Against Multiple Edge Failures Chiesa, Marco Gurtov, Andrei Madry, Aleksander Mitrovic, Slobodan Nikolaevskiy, Ilya Shapira, Michael Shenker, Scott Randomized Routing Resilience Connectivity Arborescenses We study the Static-Routing-Resiliency problem, motivated by routing on the Internet: Given a graph G = (V,E), a unique destination vertex d, and an integer constant c > 0, does there exist a static and destination-based routing scheme such that the correct delivery of packets from any source s to the destination d is guaranteed so long as (1) no more than c edges fail and (2) there exists a physical path from s to d? We embark upon a study of this problem by relating the edge-connectivity of a graph, i.e., the minimum number of edges whose deletion partitions G, to its resiliency. Following the success of randomized routing algorithms in dealing with a variety of problems (e.g., Valiant load balancing in the network design problem), we embark upon a study of randomized routing algorithms for the Static-Routing-Resiliency problem. For any k-connected graph, we show a surprisingly simple randomized algorithm that has expected number of hops O(|V|k) if at most k-1 edges fail, which reduces to O(|V|) if only a fraction t of the links fail (where t < 1 is a constant). Furthermore, our algorithm is deterministic if the routing does not encounter any failed link. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Marco Chiesa and Andrei Gurtov and Aleksander Madry and Slobodan Mitrovic and Ilya Nikolaevskiy and Michael Shapira and Scott Shenker 2016 Is Part Of LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2016.134 urn:nbn:de:0030-drops-62692 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.134 eng https://creativecommons.org/licenses/by/3.0/legalcode