Scheduling of users with markovian time-varying transmission rates

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.

[1]  Pao-Chi Chang,et al.  On verifying the first-order Markovian assumption for a Rayleigh fading channel model , 1996 .

[2]  Jean Walrand,et al.  The c# rule revisited , 1985 .

[3]  Aleksi Penttinen,et al.  On the optimal trade-off between SRPT and opportunistic scheduling , 2011, SIGMETRICS '11.

[4]  Thomas Bonald.  A Score-Based Opportunistic Scheduler for Fading Radio Channels , 2004 .

[5]  Hong Shen Wang,et al.  Finite-state Markov channel-a useful model for radio communication channels , 1995 .

[6]  Bara Kim,et al.  Stability of flow-level scheduling with Markovian time-varying channels , 2013, Perform. Evaluation.

[7]  Urtzi Ayesta,et al.  A modeling framework for optimizing the flow-level scheduling with time-varying channels , 2010, Perform. Evaluation.

[8]  Urtzi Ayesta,et al.  Scheduling in a Random Environment: Stability and Asymptotic Optimality , 2011, IEEE/ACM Transactions on Networking.

[9]  Matthew S. Grob,et al.  CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users , 2000, IEEE Commun. Mag..

[10]  F. Richard Yu,et al.  Distributed Optimal Relay Selection in Wireless Cooperative Networks With Finite-State Markov Channels , 2010, IEEE Transactions on Vehicular Technology.

[11]  José Niño-Mora,et al.  Dynamic priority allocation via restless bandit marginal productivity indices , 2007, 2304.06115.

[12]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[13]  Peter Jacko,et al.  Value of information in optimal flow-level scheduling of users with Markovian time-varying channels , 2011, Perform. Evaluation.

[14]  Chuang Lin,et al.  Stochastic Performance Analysis of a Wireless Finite-State Markov Channel , 2013, IEEE Transactions on Wireless Communications.

[15]  Sem C. Borst.  User-level performance of channel-aware scheduling algorithms in wireless data networks , 2005, IEEE/ACM Transactions on Networking.

[16]  Gustavo de Veciana,et al.  A Markov Decision Model for Adaptive Scheduling of Stored Scalable Videos , 2012, IEEE Transactions on Circuits and Systems for Video Technology.

[17]  Samuli Aalto,et al.  Flow-level stability and performance of channel-aware priority-based schedulers , 2010, 6th EURO-NGI Conference on Next Generation Internet.

[18]  Laurent Ros,et al.  On the use of first-order autoregressive modeling for Rayleigh flat fading channel estimation with Kalman filter , 2012, Signal Process..

[19]  Stefania Sesia,et al.  LTE - The UMTS Long Term Evolution, Second Edition , 2011 .

[20]  J. Gittins.  Bandit processes and dynamic allocation indices , 1979 .

[21]  Mohammed Atiquzzaman,et al.  Error modeling schemes for fading channels in wireless communications: A survey , 2003, IEEE Communications Surveys & Tutorials.

[22]  P. Sadeghi,et al.  Finite-state Markov modeling of fading channels - a survey of principles and applications , 2008, IEEE Signal Processing Magazine.

[23]  L. B. Milstein,et al.  On the accuracy of a first-order Markov model for data transmission on fading channels , 1995, Proceedings of ICUPC '95 - 4th IEEE International Conference on Universal Personal Communications.

[24]  Raymond Knopp,et al.  Information capacity and power control in single-cell multiuser communications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[25]  J. Walrand,et al.  The cμ rule revisited , 1985, Advances in Applied Probability.

[26]  P. Whittle.  Restless Bandits: Activity Allocation in a Changing World , 1988 .

[27]  Philip A. Whiting,et al.  Convergence of proportional-fair sharing algorithms under general conditions , 2004, IEEE Transactions on Wireless Communications.