Lattice networks: capacity limits, optimal routing, and queueing behavior.
Guillermo BarrenetxeaBaltasar Beferull-LozanoMartin VetterliPublished in: IEEE/ACM Trans. Netw. (2006)
Keyphrases
- network topologies
- dynamic programming
- wireless ad hoc networks
- social networks
- state dependent
- steady state
- switched networks
- routing protocol
- service requirements
- distribution networks
- dynamic routing
- lattice structure
- queue length
- routing problem
- scheduling policies
- worst case
- path selection
- expected profit
- ad hoc networks
- complex networks
- capacity allocation
- node density
- priority scheduling