Combining opportunistic and size-based scheduling in wireless systems

HSDPA/HDR systems allow the use of sophisticated opportunistic schedulers that can utilize information on instantaneous channel conditions. On the other hand, for elastic data traffic the size of the files can be used in size-dependent scheduling methods, e.g., the well known SRPT scheduler, to minimize the flow delays. In this paper, we consider the optimal use of both size and channel information for minimizing the flow delay. We derive several heuristics which utilize both types of information. In a static setting with two flows and two rates, the optimal policy can be constructed via dynamic programming and can be compared against the policies using exact size knowledge. In the dynamic setting (stochastically arriving flows with random sizes), extensive simulations have been performed to evaluate the performance of the schedulers under heavy traffic. In the symmetric setting, the differences between the schedulers are clearly visible, while in the asymmetric setting the dynamics are more complex. The results still show that significant gains can be achieved with additionally using size information.

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

[2]  R. Butterworth,et al.  Queueing Systems, Vol. II: Computer Applications. , 1977 .

[3]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

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

[5]  Gustavo de Veciana,et al.  Measurement-based opportunistic scheduling for heterogenous wireless systems , 2009, IEEE Transactions on Communications.

[6]  Thomas Bonald,et al.  Flow-level performance analysis of some opportunistic scheduling algorithms , 2005, Eur. Trans. Telecommun..

[7]  W. D. Ray Queueing Systems. Vol. II—Computer Applications , 1977 .

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

[9]  J. George Shanthikumar,et al.  Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures , 1989, Probability in the Engineering and Informational Sciences.

[10]  Jack M. Holtzman,et al.  Asymptotic analysis of proportional fair algorithm , 2001, 12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598).

[11]  Hans van den Berg,et al.  HSDPA flow level performance: the impact of key system and traffic aspects , 2004, MSWiM '04.

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

[13]  S. F. Yashkov,et al.  Processor-sharing queues: Some progress in analysis , 1987, Queueing Syst. Theory Appl..

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

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

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

[17]  Alexandre Proutière,et al.  Wireless downlink data channels: user performance and cell dimensioning , 2003, MobiCom '03.

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