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, Gurtov, Andrei, Madry, Aleksander, Mitrovic, Slobodan, Nikolaevskiy, Ilya, Shapira, Michael, Shenker, Scott
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik 2018
Online Access:http://hdl.handle.net/1721.1/113892
https://orcid.org/0000-0003-0536-0323

Internet

http://hdl.handle.net/1721.1/113892
https://orcid.org/0000-0003-0536-0323

Similar Items