User-level performance of channel-aware scheduling algorithms in wireless data networks
IEEE/ACM Transactions on Networking (TON)
A modeling framework for optimizing the flow-level scheduling with time-varying channels
Performance Evaluation
On the optimal trade-off between SRPT and opportunistic scheduling
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Convergence of proportional-fair sharing algorithms under general conditions
IEEE Transactions on Wireless Communications
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Stability of flow-level scheduling with Markovian time-varying channels
Performance Evaluation
| Hi-index | 0.00 |
We address the problem of developing a well-performing and implementable scheduler of users with wireless connection to the base station. The main feature of such real-life systems is that the quality conditions of the user channels are time-varying, which turn into the time-varying transmission rate due to different modulation and coding schemes. We assume that this phenomenon follows a Markovian law and most of the discussion is dedicated to the case of three quality conditions of each user, for which we characterize an optimal index policy and show that threshold policies (of giving higher priority to users with higher transmission rate) are not necessarily optimal. For the general case of arbitrary number of quality conditions we design a scheduler and propose its two practical approximations, and illustrate the performance of the proposed index-based schedulers and existing alternatives in a variety of simulation scenarios.