On the Resiliency of Randomized Routing Against Multiple Edge Failures
From MaRDI portal
Recommendations
- Resilience of routing in parallel link networks
- Designing networks with resiliency to edge failures using two-stage robust optimization
- Parametric multiroute flow and its application to robust network with k edge failures
- On multi-path routing for reliable communications in failure interdependent complex networks
- On fault tolerant routings in general networks
- Building edge-failure resilient networks
- scientific article; zbMATH DE number 2086939
- Probability-based fault-tolerant routing in hypercubes
Cited in
(11)- Resilient capacity-aware routing
- Internet resiliency to attacks and failures under BGP policy routing
- Identity-Based Hierarchical Key-Insulated Encryption Without Random Oracles
- Computing scores of forwarding schemes in switched networks with probabilistic faults
- ON THE LONGEST RNG EDGE OF WIRELESS AD HOC NETWORKS
- scientific article; zbMATH DE number 2086939 (Why is no real title available?)
- Robust routing made easy
- How to Secure Matchings Against Edge Failures
- Local Fast Segment Rerouting on Hypercubes
- Maximally resilient replacement paths for a family of product graphs
- On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms
This page was built for publication: On the Resiliency of Randomized Routing Against Multiple Edge Failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598277)
