Routing on Shortest Pair of Disjoint Paths with Bandwidth Guaranteed.
Hongze LengMeilian LiangJunqiang SongZheng XieJun ZhangPublished in: DASC (2009)
Keyphrases
- disjoint paths
- shortest path
- message overhead
- approximation algorithms
- routing scheme
- routing algorithm
- bandwidth allocation
- undirected graph
- directed graph
- routing protocol
- qos routing
- traffic load
- ad hoc networks
- division multiple access
- routing problem
- video streaming
- quality of service
- differentiated services
- internet protocol
- wavelength division multiplexing
- multicast tree
- network topology
- wireless ad hoc networks
- link failure
- multicast routing
- network resources
- path length
- mobile ad hoc networks
- complex networks
- image segmentation