Impact of Size-Based Scheduling on Flow Level Performance in Wireless Downlink Data Channels

We analyze the impact of size-based scheduling on the flow level performance of elastic traffic in wireless downlink data channels. The impact is assessed by comparing the flow level delay of the simple RR scheduler to two optimized non-anticipating schedulers (FB and FB°) and SRPT. The optimized distance-aware scheduler FB° is derived by applying the Gittins index approach. Our results show that for Paretotype file size distributions, the size-based information is more important than the location information. Additionally, FB not only decreases the overall mean delay, but it can also decrease considerably the mean delay of all users independently of their location.

[1]  Robert B. Cooper,et al.  Queueing systems, volume II: computer applications : By Leonard Kleinrock. Wiley-Interscience, New York, 1976, xx + 549 pp. , 1977 .

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

[3]  F. Berggren,et al.  Asymptotically fair scheduling on fading channels , 2002, Proceedings IEEE 56th Vehicular Technology Conference.

[4]  A. W. Marshall,et al.  Properties of Probability Distributions with Monotone Hazard Rate , 1963 .

[5]  Junshan Zhang,et al.  Traffic aided opportunistic scheduling for downlink transmissions: algorithms and performance bounds , 2004, IEEE INFOCOM 2004.

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

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

[8]  J. M. Holtzman.  CDMA forward link waterfilling power control , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[9]  S. F. Yashkov.  Mathematical problems in the theory of shared-processor systems , 1992 .

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

[11]  Linus Schrage,et al.  The Queue M/G/1 with the Shortest Remaining Processing Time Discipline , 1966, Oper. Res..

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

[13]  Anja Feldmann,et al.  Fitting mixtures of exponentials to long-tail distributions to analyze network performance models , 1997, Proceedings of INFOCOM '97.

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

[15]  G. J. A. Stern,et al.  Queueing Systems, Volume 2: Computer Applications , 1976 .

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

[17]  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.