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...
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: | |
Online Access: | Get fulltext |
Similar Items
-
The quest for resilient (static) forwarding tables
by: Chiesa, Marco, et al.
Published: (2021) -
Secure lightweight protocols for medical device monitoring
by: Andrei Gurtov, et al. -
Resilience Evaluation of Multi-Path Routing against Network Attacks and Failures
by: Hyok An, et al.
Published: (2021-05-01) -
Faster generation of random spanning trees
by: Ma̧dry, Aleksander
Published: (2010) -
Communication Failure Resilient Distributed Neural Network for Edge Devices
by: Jonghun Jeong, et al.
Published: (2021-07-01)