Abstract
We consider the flow-level scheduling in wireless networks. The time is slotted and in each time slot the base station selects flows/users to serve. There are multi-class users and channel conditions vary over time. The channel state for each class user is assumed to be modeled as a finite state Markov chain. Using the fluid limit approach, we find the necessary and sufficient conditions for the stability of best rate (BR) scheduling policies. As a result, we show that any BR policy is maximally stable. Our result generalizes the result of Ayesta et al. (in press) [13] and solves the conjecture of Jacko (2011) [16]. We introduce a correlated channel state model and investigate the stability condition for BR policy in this model.
Original language | English |
---|---|
Pages (from-to) | 148-159 |
Number of pages | 12 |
Journal | Performance Evaluation |
Volume | 70 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2013 |
Bibliographical note
Funding Information:The authors are grateful for the Editor’s and referee’s comments and suggestions which improved this article. The first author’s research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology ( 2012-0004219 ). The second author’s research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology ( 2011-0004133 ).
Keywords
- Best rate policy
- Flow-level scheduling
- Fluid limits
- Markovian channel
- Stability
ASJC Scopus subject areas
- Software
- Modelling and Simulation
- Hardware and Architecture
- Computer Networks and Communications