An opportunistic and non-anticipating size-aware scheduling proposal for mean holding cost minimization in time-varying channels

In this paper we study how to design a scheduling strategy aimed at minimizing the average holding cost for flows with general size distribution when the feasible transmission rate of each user varies randomly over time. We employ a Whittle-index-based approach in order to achieve an opportunistic and non-anticipating size-aware scheduling index rule proposal. When the flow size distribution belongs to the Decreasing Hazard Rate class, we propose the so-called Attained Service Potential Improvement index rule, which consists in giving priority to the flows with the highest ratio between the current attained-service-dependent completion probability and the expected potential improvement of this completion probability. We further analyze the performance of the proposed scheduler, concluding that it outperforms well-known opportunistic disciplines.

[1]  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).

[2]  Viswanathan Visweswaran Decomposition Techniques for MILP: Lagrangian Relaxation , 2009, Encyclopedia of Optimization.

[3]  Markus Rupp,et al.  System Level Simulation of LTE Networks , 2010, 2010 IEEE 71st Vehicular Technology Conference.

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

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

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

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

[8]  Peter Jacko,et al.  Scheduling of users with markovian time-varying transmission rates , 2013, SIGMETRICS '13.

[9]  Urtzi Ayesta,et al.  Resource-sharing in a single server with time-varying capacity , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  Stefania Sesia,et al.  LTE - The UMTS Long Term Evolution , 2009 .

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

[12]  Jose Oscar Fajardo,et al.  Size-based and channel-aware scheduling algorithm proposal for mean delay optimization in wireless networks , 2012, 2012 IEEE International Conference on Communications (ICC).

[13]  Kevin D. Glazebrook,et al.  Multi-Armed Bandit Allocation Indices: Gittins/Multi-Armed Bandit Allocation Indices , 2011 .

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

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

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

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

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

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

[20]  R. Wilder,et al.  Wide-area Internet traffic patterns and characteristics , 1997, IEEE Netw..