Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks.
Daeho SeoAkif AliWon-Taek LimNauman RafiqueMithuna ThottethodiPublished in: ISCA (2005)
Keyphrases
- worst case
- three dimensional
- traffic load
- upper bound
- average case
- response time
- error bounds
- lower bound
- np hard
- division multiple access
- network topology
- greedy algorithm
- transmission delay
- routing problem
- message overhead
- routing decisions
- routing algorithm
- approximation algorithms
- multi dimensional
- data transmission
- wireless ad hoc networks
- qos routing
- medium access control
- packing problem
- space complexity
- network resources
- network layer
- ad hoc networks
- shortest path
- routing overhead