A modeling framework for optimizing the flow-level scheduling with time-varying channels

We introduce a comprehensive modeling framework for the problem of scheduling a finite number of finite-length jobs where the available service rate is time-varying. The main motivation comes from wireless data networks where the service rate of each user varies randomly due to fading. We employ recent advances on the restless bandit problem that allow us to obtain an opportunistic scheduling rule for the system without arrivals. When the objective is to minimize the mean number of users in the system or to minimize the mean waiting time, we obtain a priority-based policy which we call the ''Potential Improvement'' (PI) rule, since the priority index equals the ratio between the current available service rate and the expected potential improvement of the service rate. We also show that for certain objective functions, the index rule takes the form of known opportunistic scheduling rules like ''Relatively Best'' (RB) or ''Proportionally Best'' (PB). Thus our model provides a formal justification for the deployment of opportunistic scheduling rules in order to improve the flow-level performance in the presence of time-varying capacities. We further analyze the performance of the PI rule in the presence of randomly arriving users. When the service rates are constant, PI is equivalent to the [email protected], which is known to be optimal with any distribution of arrivals. Using a recent characterization for the stability region of flow-level scheduling rules under random arrivals, we show that PI achieves the maximum stability region. We perform numerical experiments in a wide range of scenarios and compare the performance of PI with other popular disciplines like RB, PB, Score-Based (SB) and the [email protected] Our results show that RB, PB, SB or the [email protected] might outperform the others depending on the scenario, but regardless of this, the performance of PI is always superior or equivalent to the best of these opportunistic rules.

[1]  Byeong Gi Lee,et al.  Wireless packet scheduling based on the cumulative distribution function of user transmission rates , 2005, IEEE Transactions on Communications.

[2]  Urtzi Ayesta,et al.  Stability and asymptotic optimality of opportunistic schedulers in wireless systems , 2011, VALUETOOLS.

[3]  A. Stolyar.  MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic , 2004 .

[4]  P. Whittle.  Arm-Acquiring Bandits , 1981 .

[5]  J. Gani,et al.  Progress in statistics , 1975 .

[6]  José Niño Mora.  Restless Bandits, Partial Conservation Laws and Indexability , 2000 .

[7]  Christian M. Ernst,et al.  Multi-armed Bandit Allocation Indices , 1989 .

[8]  M. Andrews,et al.  Instability of the proportional fair scheduling algorithm for HDR , 2004, IEEE Transactions on Wireless Communications.

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

[10]  John N. Tsitsiklis,et al.  The Complexity of Optimal Queuing Network Control , 1999, Math. Oper. Res..

[11]  J. Bather,et al.  Multi‐Armed Bandit Allocation Indices , 1990 .

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

[13]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[14]  Gustavo de Veciana,et al.  Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule , 2011, IEEE/ACM Transactions on Networking.

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

[16]  Isaac Meilijson.  Multiple feedback at a single server station , 1975 .

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

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

[19]  Seung Jun Baek,et al.  Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule , 2009, INFOCOM 2009.

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

[21]  José Niño-Mora.  Characterization and computation of restless bandit marginal productivity indices , 2007, VALUETOOLS.

[22]  Peter Jacko.  Adaptive Greedy Rules for Dynamic and Stochastic Resource Capacity Allocation Problems , 2010 .

[23]  Kenneth C. Sevcik,et al.  Scheduling for Minimum Total Loss Using Service Time Distributions , 1974, JACM.

[24]  Dennis W. Fife.  Scheduling with Random Arrivals and Linear Loss Functions , 1965 .

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

[26]  John N. Tsitsiklis,et al.  The complexity of optimal queueing network control , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[27]  Samuli Aalto,et al.  Combining opportunistic and size-based scheduling in wireless systems , 2008, MSWiM '08.

[28]  M.J. Neely,et al.  Order Optimal Delay for Opportunistic Scheduling in Multi-User Wireless Uplinks and Downlinks , 2008, IEEE/ACM Transactions on Networking.

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

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

[31]  Philip A. Whiting,et al.  SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004, Probability in the Engineering and Informational Sciences.

[32]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[33]  Junshan Zhang,et al.  Traffic aided opportunistic scheduling for wireless networks: algorithms and performance bounds , 2004, Comput. Networks.

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

[35]  W. Whitt,et al.  On averages seen by arrivals in discrete time , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[36]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

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

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

[39]  Riku Jäntti,et al.  Asymptotically fair transmission scheduling over fading channels , 2004, IEEE Transactions on Wireless Communications.

[40]  N.B. Shroff,et al.  Optimal opportunistic scheduling in wireless networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

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