Fractional routing using pairs of failure-disjoint paths.
Walid Ben-AmeurMichal PióroMateusz ZotkiewiczPublished in: Discret. Appl. Math. (2014)
Keyphrases
- disjoint paths
- approximation algorithms
- link failure
- directed graph
- pairwise
- failure prediction
- routing algorithm
- network topology
- undirected graph
- mobile ad hoc networks
- ad hoc networks
- hurst exponent
- routing problem
- routing protocol
- shortest path
- failure rate
- upper bound
- inter domain
- special case
- image processing
- neural network