An oblivious shortest-path routing algorithm for fully connected cubic networks.
Xiaofan YangGraham M. MegsonDavid J. EvansPublished in: J. Parallel Distributed Comput. (2006)
Keyphrases
- routing algorithm
- shortest path
- fully connected
- path selection
- network coding
- network resources
- shortest path problem
- scale free
- conditional random fields
- dijkstra algorithm
- path length
- road network
- network routing
- complex networks
- end to end delay
- travel time
- optimal path
- source node
- network model
- wireless sensor networks
- routing protocol