Opportunistic schedulers for optimal scheduling of flows in wireless systems with ARQ feedback

In this paper we study three opportunistic schedulers for the problem of optimal multi-class flow-level scheduling in wireless downlink and uplink systems. For user channels we employ the Gilbert-Elliot model of good and bad channel condition with flow-level interpretation, and assume an automatic repeat query (ARQ) feedback, so that channel state information is available at the end of the slot only if the user was scheduled. The problem is essentially a Partially-Observable Markov Decision Process with a sample-path resource constraint. Given its complexity, we study two naïve schedulers: the myopic rule and the belief-state rule. Further, realizing that the problem fits the multi-armed restless bandit framework, we consider the relaxation of the problem which instead of serving a given number of flows on sample-path allows for serving that number of flows only in expectation, and derive an optimal Whittle index policy in closed form. We further discuss the interpretation of the resulting novel Whittle-index-based heuristic scheduler and evaluate its performance against the two naïve schedulers in simulations under the time-average criterion. According to the Whittle-index-based scheduler, the users whose last channel feedback gave good condition and those not served yet receive an absolute priority over those whose last channel feedback gave bad condition, which extends to this setting the property of channel-aware schedulers that are known to be maximally stable. In addition, we obtain tie-breaking index values for setting priorities among users in each of the two groups. In case of a single user class, the scheduler becomes independent of the problem parameters and equivalent to both the myopic and belief-state scheduler, and has a simple universal structure which can be represented by three first-in-first-out priority lists.

[1]  Atilla Eryilmaz,et al.  Asymptotically optimal downlink scheduling over Markovian fading channels , 2012, 2012 Proceedings IEEE INFOCOM.

[2]  José Niño-Mora,et al.  Marginal productivity index policies for problems of admission control and routing to parallel queues with delay , 2008 .

[3]  Quan Liu,et al.  On Optimality of Myopic Sensing Policy with Imperfect Sensing in Multi-Channel Opportunistic Access , 2013, IEEE Transactions on Communications.

[4]  Qing Zhao,et al.  Indexability and whittle index for restless bandit problems involving reset processes , 2011, IEEE Conference on Decision and Control and European Control Conference.

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

[6]  AyestaUrtzi,et al.  Scheduling in a random environment , 2013 .

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

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

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

[10]  P. Whittle.  Restless bandits: activity allocation in a changing world , 1988, Journal of Applied Probability.

[11]  E. Gilbert.  Capacity of a burst-noise channel , 1960 .

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

[13]  José Niño-Mora,et al.  Sensor scheduling for hunting elusive hiding targets via whittle's restless bandit index policy , 2011, International Conference on NETwork Games, Control and Optimization (NetGCooP 2011).

[14]  Sem C. Borst,et al.  Flow-level performance and capacity of wireless networks with user mobility , 2009, Queueing Syst. Theory Appl..

[15]  Mingyan Liu,et al.  Optimality of Myopic Sensing in Multi-Channel Opportunistic Access , 2008, 2008 IEEE International Conference on Communications.

[16]  Gustavo de Veciana,et al.  Balancing SRPT prioritization vs opportunistic gain in wireless systems with flow dynamics , 2010, 2010 22nd International Teletraffic Congress (lTC 22).

[17]  Bhaskar Krishnamachari,et al.  On myopic sensing for multi-channel opportunistic access: structure, optimality, and performance , 2007, IEEE Transactions on Wireless Communications.

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

[19]  R. Weber,et al.  On an index policy for restless bandits , 1990, Journal of Applied Probability.

[20]  J. Nio-Mora.  An Index Policy for Dynamic Fading-Channel Allocation to Heterogeneous Mobile Users with Partial Observations , 2008, 2008 Next Generation Internet Networks.

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

[22]  J. Niño-Mora.  RESTLESS BANDITS, PARTIAL CONSERVATION LAWS AND INDEXABILITY , 2001 .

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

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

[25]  Peter Jacko,et al.  Dynamic Priority Allocation in Restless Bandit Models: Designing simple and well-performing rules for dynamic and stochastic resource allocation problems , 2010 .

[26]  P. Jacko.  Marginal productivity index policies for dynamic priority allocation in restless bandit models , 2011 .