On the Computational Complexity of Policy Routing.
Márton ZuborAttila KorösiAndrás GulyásGábor RétváriPublished in: EUNICE (2014)
Keyphrases
- computational complexity
- special case
- optimal policy
- routing protocol
- np complete
- low complexity
- action selection
- routing problem
- computationally efficient
- computational cost
- shortest path
- computational efficiency
- decision problems
- high computational complexity
- memory requirements
- network topology
- network topologies
- steady state
- ad hoc networks
- routing algorithm
- worst case
- infinite horizon
- inter domain
- qos routing