SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING

We study sojourn times of customers in a processor sharing queue with a service rate that varies over time, depending on the number of customers and on the state of a random environment. An explicit expression is derived for the Laplace–Stieltjes transform of the sojourn time conditional on the state upon arrival and the amount of work brought into the system. Particular attention is paid to the conditional mean sojourn time of a customer as a function of his required amount of work, and we establish the existence of an asymptote as the amount of work tends to infinity. The method of random time change is then extended to include the possibility of a varying service rate. By means of this method, we explain the well-established proportionality between the conditional mean sojourn time and required amount of work in processor sharing queues without random environment. Based on numerical experiments, we propose an approximation for the conditional mean sojourn time. Although first presented for exponentially distributed service requirements, the analysis is shown to extend to phase-type services. The service discipline of discriminatory processor sharing is also shown to fall within the framework.

[1]  Ronald A. Howard,et al.  Dynamic Programming and Markov Processes , 1960 .

[2]  Leonard Kleinrock,et al.  Analysis of A time‐shared processor , 1964 .

[3]  Leonard Kleinrock,et al.  Time-shared Systems: a theoretical treatment , 1967, JACM.

[4]  R. Wolff.  Time Sharing with Priorities , 1970 .

[5]  Edward G. Coffman,et al.  Waiting Time Distributions for Processor-Sharing Systems , 1970, JACM.

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

[7]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[8]  Philip Heidelberger,et al.  Analysis of Performability for Stochastic Models of Fault-Tolerant Systems , 1986, IEEE Transactions on Computers.

[9]  W. H. M. Zijm,et al.  Exponential Convergence in Undiscounted Continuous-Time Markov Decision Chains , 1987, Math. Oper. Res..

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

[11]  Kishor S. Trivedi,et al.  Performability Analysis: Measures, an Algorithm, and a Case Study , 1988, IEEE Trans. Computers.

[12]  Onno Boxma,et al.  Sojourn times in feedback and processor sharing queues , 1988 .

[13]  Kishor S. Trivedi,et al.  Markov and Markov reward model transient analysis: An overview of numerical approaches , 1989 .

[14]  Georgia-Ann Klutke,et al.  STATIONARY INCREMENTS IN THE ACCUMULATED WORK PROCESS IN PROCESSOR-SHARING QUEUES , 1989 .

[15]  L. Donatiello,et al.  On Evaluating the Cumulative Performance Distribution of Fault-Tolerant Computer Systems , 1991, IEEE Trans. Computers.

[16]  Linn I. Sennott,et al.  Value iteration in countable state average cost Markov decision processes with unbounded costs , 1991 .

[17]  Hans van den Berg,et al.  TheM/G/1 queue with processor sharing and its relation to a feedback queue , 1991, Queueing Syst. Theory Appl..

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

[19]  S. Grishechkin.  On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes , 1992, Advances in Applied Probability.

[20]  S. Grishechkin.  Crump–Mode–Jagers Branching Processes As a Method of Investigating ${\rm M}/{\rm G}/1$ Systems with Processor Sharing , 1992 .

[21]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[22]  W. D. Ray,et al.  Stochastic Models: An Algorithmic Approach , 1995 .

[23]  Bruno Sericola,et al.  Performability Analysis: A New Algorithm , 1996, IEEE Trans. Computers.

[24]  L. San-qi,et al.  Generalized Folding-algorithm for sojourn time analysis of finite QBD processes and its queueing applications , 1996 .

[25]  Vincenzo Grassi,et al.  Solution of finite QBD processes , 1996, Journal of Applied Probability.

[26]  Michel Mandjes,et al.  Delay performance analysis of the new Internet services with guaranteed QoS , 1997, Proc. IEEE.

[27]  J. Crowcroft,et al.  The integrated services in the Internet: state of the art , 1997, Proc. IEEE.

[28]  Udo R. Krieger,et al.  Analysis of a versatile multi-class delay-loss system with a superimposed Markovian arrival process , 1998, Eur. J. Oper. Res..

[29]  R. Núñez-Queija,et al.  Sojourn times in a processor sharing queue with service interruptions , 1999 .

[30]  E. D. S. E. Silva,et al.  An algorithm to calculate transient distributions of cumulative rate and impulse based reward , 1998 .

[31]  Michel Mandjes,et al.  Performance evaluation of strategies for integration of elastic and stream traffic , 1999 .

[32]  R. Núñez Queija,et al.  Centrum Voor Wiskunde En Informatica Reportrapport Sojourn times in a Processor Sharing Queue with Service Interruptions Sojourn times in a Processor Sharing Queue with Service Interruptions , 2022 .

[33]  R. Núñez Queija,et al.  Processor-Sharing Models for Integrated-Services Networks , 2000 .