Improving the Resilience of Fast Failover Routing: TREE (Tree Routing to Extend Edge disjoint paths).
Oliver SchweigerKlaus-Tycho FoersterStefan SchmidPublished in: CoRR (2021)
Keyphrases
- disjoint paths
- tree structure
- fault tolerance
- routing protocol
- routing algorithm
- binary tree
- tree structures
- mobile ad hoc networks
- social networks
- shortest path
- approximation algorithms
- special case
- tree nodes
- routing problem
- spanning tree
- graph structure
- ad hoc networks
- b tree
- end to end
- edge detection
- missing data
- index structure