Dynamic Markov Decision Policies for Delay Constrained Wireless Scheduling

We consider a one-hop wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm that reacts to time varying channels and maximizes throughput utility (to within a desired proximity), stabilizes all queues,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on automatic control Ročník 58; číslo 8; s. 1948 - 1961
Hlavní autoři: Neely, Michael J., Supittayapornpong, Sucha
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.08.2013
Témata:
Delays
Heuristic algorithms
Markov processes
network analysis and control
Optimization
Queueing analysis
queueing systems
Vectors
Wireless communication
ISSN:0018-9286, 1558-2523
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider a one-hop wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm that reacts to time varying channels and maximizes throughput utility (to within a desired proximity), stabilizes all queues, and satisfies the delay constraints. The problem is solved by reducing the constrained optimization to a set of weighted stochastic shortest path problems, which act as natural generalizations of max-weight policies to Markov decision networks. We also present approximation results for the corresponding shortest path problems, and discuss the additional complexity and delay incurred as compared to systems without delay constraints. The solution technique is general and applies to other constrained stochastic decision problems.
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2013.2256682