Name
Title | ||
|---|---|---|
Opportunistic Scheduling Revisited Using Restless Bandits: Indexability and Index Policy. |
Abstract | ||
|---|---|---|
We investigate the opportunistic scheduling problem where a server opportunistically serves multiple classes of users under time varying multi-state Markovian channels. The aim of the server is to find an optimal policy minimizing the average waiting cost of users. Mathematically, the problem can be cast to a restless bandit one, and a pivot to solve restless bandit by index policy is to establish indexability. We mathematically propose a set of sufficient conditions on channel state transition matrix, and consequently, the index policy is feasible. Our work consists of a small step toward solving the opportunistic scheduling problem in its generic form involving multi-state Markovian channels and multi-class users. |
Year | Venue | Keywords |
|---|---|---|
2017 | IEEE Global Communications Conference | Restless bandit,indexability,stochastic scheduling,performance evaluation |
Field | DocType | ISSN |
Mathematical optimization,Markov process,Job shop scheduling,Computer science,Scheduling (computing),Server,Computer network,Communication channel,Schedule,State-transition matrix,Throughput | Conference | 2334-0983 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaohu Ge | 1 | 1480 | 114.44 |
| Jihong Yu | 2 | 29 | 8.88 |
| Lin Chen | 3 | 312 | 31.64 |
| Moe Z. Win | 4 | 2225 | 196.12 |