Sökning: onr:"swepub:oai:DiVA.org:kth-222324" >
On the resiliency o...
On the resiliency of randomized routing against multiple edge failures
-
- Chiesa, Marco, 1987- (författare)
- Université catholique du Louvain, Belgium
-
Gurtov, A. (författare)
-
Madry, A. (författare)
-
visa fler...
-
Mitrovic, S. (författare)
-
Nikolaevskiy, I. (författare)
-
Schapira, M. (författare)
-
Shenker, S. (författare)
-
visa färre...
-
(creator_code:org_t)
- Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016
- 2016
- Engelska.
-
Ingår i: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. - : Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. - 9783959770132
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.4...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas