On the Resiliency of Randomized Routing Against Multiple Edge Failures
Author(s)
Chiesa, Marco; Gurtov, Andrei; Madry, Aleksander; Mitrovic, Slobodan; Nikolaevskiy, Ilya; Shapira, Michael; Shenker, Scott; ... Show more Show less
DownloadMadry_On the resiliency.pdf (534.7Kb)
PUBLISHER_CC
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordAbstract
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. Keywords: Randomized, Routing, Resilience, Connectivity, Arborescenses
Date issued
2016Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Leibniz International Proceedings in Informatics (LIPIcs)
Publisher
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Citation
Chiesa, Marco et al. "On the Resiliency of Randomized Routing Against Multiple Edge Failures." Leibniz International Proceedings in Informatics (LIPIcs), 55 (2016). pp. 134:1--134:15.
Version: Final published version
ISSN
1868-8969