Bounds on the Performance of Message Routing Heuristics.
Philip J. BernhardPublished in: IEEE Trans. Computers (1993)
Keyphrases
- lower bound
- upper bound
- search algorithm
- routing protocol
- network topology
- worst case analysis
- lower and upper bounds
- routing problem
- ad hoc networks
- routing algorithm
- upper and lower bounds
- heuristic search
- error bounds
- neural network
- worst case
- branch and bound search
- scheduling problem
- tight bounds
- message transmission
- shortest path
- inter domain
- generalization bounds
- network topologies
- asymptotically optimal
- mobile ad hoc networks
- communication channels
- response time