Oblivious routing in directed graphs with random demands.
Mohammad Taghi HajiaghayiJeong Han KimTom LeightonHarald RäckePublished in: STOC (2005)
Keyphrases
- directed graph
- random walk
- service requirements
- routing problem
- network topology
- undirected graph
- ad hoc networks
- maximum flow
- routing algorithm
- disjoint paths
- directed acyclic graph
- graph structure
- routing protocol
- special case
- mobile ad hoc networks
- network topologies
- learning algorithm
- strongly connected
- neural network
- database