Balancing SRPT prioritization vs opportunistic gain in wireless systems with flow dynamics

The problem of scheduling best effort flows from a dynamic population sharing a time varying wireless channel, with the objective of minimizing mean sojourn time is considered. The key tradeoff involved is between prioritizing flows with short residual sizes and maximizing opportunistic capacity gain by selecting flows that currently see good channels. This tradeoff is explicitly characterized by introducing a new queueing model that involves servers with state-dependent capacity regions. In the transient case and for (bounding) polymatroid capacity regions, the optimal scheduler is given and used to obtain sub-optimality bounds for various heuristics. Using a mix of analysis and simulation two regimes are described: one where fully exploiting opportunistic gain is sufficient and further using residual flow sizes for scheduling will result in only minimal reduction in mean sojourn time, and the other, where the use of this information can indeed offer significant reduction. A new scheduler is proposed which performs well in both regimes.

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

[2]  R. Srikant,et al.  Throughput-Optimal Opportunistic Scheduling in the Presence of Flow-Level Dynamics , 2011, IEEE/ACM Transactions on Networking.

[3]  B. Sadiq,et al.  Throughput optimality of delay-driven MaxWeight scheduler for a wireless system with flow dynamics , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[4]  David Tse,et al.  Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.

[5]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[6]  Sem C. Borst,et al.  Instability of MaxWeight Scheduling Algorithms , 2009, IEEE INFOCOM 2009.

[7]  Samuli Aalto,et al.  Impact of Size-Based Scheduling on Flow Level Performance in Wireless Downlink Data Channels , 2007, ITC.

[8]  Lachlan L. H. Andrew,et al.  Optimal speed scaling under arbitrary power functions , 2009, SIGMETRICS Perform. Evaluation Rev..

[9]  Byeong Gi Lee,et al.  A new wireless packet scheduling algorithm based on the CDF of user transmission rates , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[10]  N. Bansal,et al.  Speed scaling with an arbitrary power function , 2009, SODA 2009.

[11]  Gustavo de Veciana,et al.  Throughput optimality of delay-driven MaxWeight scheduler for a wireless system with flow dynamics , 2009 .

[12]  Sem C. Borst,et al.  How mobility impacts the flow-level performance of wireless data systems , 2004, IEEE INFOCOM 2004.

[13]  Gustavo de Veciana,et al.  Managing Resources and Quality of Service in Heterogeneous Wireless Systems Exploiting Opportunism , 2007, IEEE/ACM Transactions on Networking.

[14]  Mor Harchol-Balter,et al.  Self-adaptive admission control policies for resource-sharing systems , 2009, SIGMETRICS '09.

[15]  Boris Tsybakov,et al.  File transmission over wireless fast fading downlink , 2002, IEEE Trans. Inf. Theory.

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

[17]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

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

[19]  Ness B. Shroff,et al.  A framework for opportunistic scheduling in wireless networks , 2003, Comput. Networks.