Robustly disjoint paths with segment routing.
François AubryStefano VissicchioOlivier BonaventureYves DevillePublished in: CoNEXT (2018)
Keyphrases
- disjoint paths
- approximation algorithms
- directed graph
- network topology
- routing algorithm
- routing problem
- undirected graph
- mobile ad hoc networks
- network topologies
- routing protocol
- shortest path
- random walk
- worst case
- qos routing
- social network analysis
- ad hoc networks
- objective function
- multi dimensional
- fully unsupervised
- traffic load
- multicast routing
- special case