Performance Evaluation of Interactive Data Services Under Sharing and Preemptive Scheduling Disciplines

As specified by the third-generation (3G) wireless networks such as the universal mobile telecommunication system (UMTS), interactive data services, such as Web browsing, voice messaging, and file transfer, represent a major service class in operation nowadays. In this paper, we develop an analytical approach to evaluate the performance of interactive data services under sharing and preemptive scheduling. Specifically, we take into account user interactions in data sessions and the heavy-tailed data file size. Both the mean and the standard deviation of data transfer delay are investigated for the two representative scheduling disciplines. Numerical results are given to show the validity of the evaluation approach and the impact of the on-off user behavior under the scheduling disciplines.

[1]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[2]  Yutaka Takahashi,et al.  Queueing analysis: A foundation of performance evaluation, volume 1: Vacation and priority systems, Part 1: by H. Takagi. Elsevier Science Publishers, Amsterdam, The Netherlands, April 1991. ISBN: 0-444-88910-8 , 1993 .

[3]  Weihua Zhuang,et al.  Improving Voice and Data Services in Cellular/WLAN Integrated Networks by Admission Control , 2007, IEEE Transactions on Wireless Communications.

[4]  DARIS.  SOME INDICES FOR HEAVY-TAILED DISTRIBUTIONS , 2002 .

[5]  George S. Fishman,et al.  How heavy-tailed distributions affect simulation-generated time averages , 2006, TOMC.

[6]  Karim Mohammed Rezaul,et al.  Web Traffic Analysis Based on EDF Statistics , 2006 .

[7]  Jian Ni,et al.  Optimal and Structured Call Admission Control Policies for Resource-Sharing Systems , 2007, IEEE Transactions on Communications.

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

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

[10]  Laurent Massoulié,et al.  Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

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

[12]  Sara Oueslati,et al.  Integrated Admission Control for Streaming and Elastic Traffic , 2001, QofIS.

[13]  Debasis Mitra,et al.  Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes , 1983, Advances in Applied Probability.

[14]  Mor Harchol-Balter,et al.  Analysis of SRPT scheduling: investigating unfairness , 2001, SIGMETRICS '01.

[15]  Hideaki Takagi.  Queueing analysis A foundation of Performance Evaluation Volume 1: Vacation and priority systems , 1991 .

[16]  M. Thomas.  Queueing Systems. Volume 1: Theory (Leonard Kleinrock) , 1976 .

[17]  Wei Song,et al.  Multi-service load sharing for resource management in the cellular/WLAN integrated network , 2009, IEEE Transactions on Wireless Communications.

[18]  Mor Harchol-Balter,et al.  Implementation of SRPT Scheduling in Web Servers , 2000 .

[19]  Wei Song,et al.  Multi-Class Resource Management in a Cellular/WLAN Integrated Network , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[20]  P. Moran,et al.  Reversibility and Stochastic Networks , 1980 .