Bounds on the performances of message routing heuristics.
Philip J. BernhardPublished in: SPDP (1991)
Keyphrases
- upper bound
- routing algorithm
- worst case analysis
- upper and lower bounds
- heuristic search
- routing problem
- lower and upper bounds
- network topology
- lower bound
- routing protocol
- worst case
- branch and bound search
- ad hoc networks
- average case
- network topologies
- inter domain
- confidence bounds
- traffic engineering
- tight bounds
- vc dimension