Opportunistic Scheduling Revisited Using Restless Bandits: Indexability and Index Policy.
IEEE Global Communications Conference(2017)
Wuhan Univ Technol | Univ Paris 11 | MIT
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.
MoreTranslated text
Key words
Restless bandit,indexability,stochastic scheduling,performance evaluation
PDF
View via Publisher
AI Read Science
Must-Reading Tree
Example

Generate MRT to find the research sequence of this paper
Related Papers
Opportunistic Scheduling Revisited Using Restless Bandits: Indexability and Index Policy.
IEEE Global Communications Conference 2017
被引用14
Indexability of an Opportunistic Scheduling Problem with Partial Channel Information
Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools 2019
被引用2
Whittle Index Approach to Opportunistic Scheduling with Partial Channel Information
Performance Evaluation 2019
被引用7
IEEE TRANSACTIONS ON CYBERNETICS 2023
被引用12
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper
GPU is busy, summary generation fails
Rerequest