New Bounds for Oblivious Mesh Routing.
Kazuo IwamaYahiko KambayashiEiji MiyanoPublished in: J. Graph Algorithms Appl. (2001)
Keyphrases
- qos routing
- routing algorithm
- ad hoc networks
- lower bound
- d mesh
- upper bound
- network topology
- upper and lower bounds
- error bounds
- worst case
- routing protocol
- interconnection networks
- lower and upper bounds
- shortest path
- tight bounds
- volumetric data
- finite element method
- average case
- vc dimension
- sensor networks
- wireless ad hoc networks
- routing problem
- three dimensional