License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2016.134
URN: urn:nbn:de:0030-drops-62692
URL: http://drops.dagstuhl.de/opus/volltexte/2016/6269/
Go to the corresponding LIPIcs Volume Portal


Chiesa, Marco ; Gurtov, Andrei ; Madry, Aleksander ; Mitrovic, Slobodan ; Nikolaevskiy, Ilya ; Shapira, Michael ; Shenker, Scott

On the Resiliency of Randomized Routing Against Multiple Edge Failures

pdf-format:
LIPIcs-ICALP-2016-134.pdf (0.5 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{chiesa_et_al:LIPIcs:2016:6269,
  author =	{Marco Chiesa and Andrei Gurtov and Aleksander Madry and Slobodan Mitrovic and Ilya Nikolaevskiy and Michael Shapira and Scott Shenker},
  title =	{{On the Resiliency of Randomized Routing Against Multiple Edge Failures}},
  booktitle =	{43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
  pages =	{134:1--134:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-013-2},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{55},
  editor =	{Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6269},
  URN =		{urn:nbn:de:0030-drops-62692},
  doi =		{10.4230/LIPIcs.ICALP.2016.134},
  annote =	{Keywords: Randomized, Routing, Resilience, Connectivity, Arborescenses}
}

Keywords: Randomized, Routing, Resilience, Connectivity, Arborescenses
Seminar: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Issue Date: 2016
Date of publication: 17.08.2016


DROPS-Home | Imprint | Privacy Published by LZI