On the Resiliency of Randomized Routing Against Multiple Edge Failures

On the Resiliency of Randomized Routing Against Multiple Edge Failures

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 t...

Full description

Bibliographic Details
Main Authors: Chiesa, Marco (Author), Gurtov, Andrei (Author), Madry, Aleksander (Contributor), Mitrovic, Slobodan (Author), Nikolaevskiy, Ilya (Author), Shapira, Michael (Author), Shenker, Scott (Author)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018-02-26T21:36:27Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items