Nearly Tight Bounds for Wormhole Routing
Abhiram G. RanadeSaul SchleimerDaniel Shawcross WilkersonPublished in: FOCS (1994)
Keyphrases
- tight bounds
- upper bound
- mobile ad hoc networks
- routing algorithm
- ad hoc networks
- mobile wireless
- routing protocol
- routing problem
- network topology
- inter domain
- qos routing
- intermediate nodes
- wireless networks
- cooperative
- wireless ad hoc networks
- traffic engineering
- shortest path
- ant algorithm
- website
- information retrieval