On the Resiliency of Randomized Routing Against Multiple Edge Failures

DOI10.4230/LIPIcs.ICALP.2016.134zbMath1388.68215OpenAlexW2547294615MaRDI QIDQ4598277

Andrei V. Gurtov, Michael Shapira, Aleksander Mądry, Slobodan Mitrović, Marco Chiesa, Ilya Nikolaevskiy, Scott J. Shenker

Publication date: 19 December 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.ICALP.2016.134

zbMATH Keywords

connectivityresiliencerandomized routingarborescenses

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Related Items (3)

Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults ⋮ Identity-Based Hierarchical Key-Insulated Encryption Without Random Oracles ⋮ Local Fast Segment Rerouting on Hypercubes

This page was built for publication: On the Resiliency of Randomized Routing Against Multiple Edge Failures