Power series approximations for generalized processor sharing systems

We develop power series approximations for a discrete-time queueing system with two parallel queues and one processor. If both queues are non-empty, a customer of queue 1 is served with probability β and a customer of queue 2 is served with probability 1 − β. If one of the queues is empty, a customer of the other queue is served with probability 1. We first describe the generating function U(z1, z2) of the stationary queue lengths in terms of a functional equation, and show how to solve this using the theory of boundary value problems. Then, we propose to use the same functional equation to obtain a power series for U(z1, z2) in β. The first coefficient of this power series corresponds to the priority case β = 0, which allows for an explicit solution. All higher coefficients are expressed in terms of the priority case. Accurate approximations for the mean stationary queue lengths are obtained from combining truncated power series and Pade approximation.

[1]  Ivan Atencia,et al.  A discrete-time Geo[X]/G/1 retrial queue with control of admission , 2005 .

[2]  J. W. Cohen,et al.  Boundary value problems in queueing theory , 1988, Queueing Syst. Theory Appl..

[3]  Herwig Bruneel,et al.  Performance analysis of a GI-Geo-1 buffer with a preemptive resume priority scheduling discipline , 2004, Eur. J. Oper. Res..

[4]  Onno Boxma,et al.  Boundary value problems in queueing system analysis , 1983 .

[5]  I. J. B. F. Adan,et al.  A compensation approach for two-dimensional Markov processes , 1993, Advances in Applied Probability.

[6]  J. Kingman.  Two Similar Queues in Parallel , 1961 .

[7]  I. N. Sneddon,et al.  Boundary value problems , 2007 .

[8]  J. Blanc.  On a numerical method for calculating state probabilities for queueing systems with more than one waiting line , 1987 .

[9]  A. Konheim,et al.  Processor-sharing of two parallel lines , 1981, Journal of Applied Probability.

[10]  Gerard Hooghiemstra,et al.  The M/G/1 processor sharing queue as the almost sure limit of feedback queues , 1990 .

[11]  Herwig Bruneel,et al.  Delay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing discipline , 2002, Perform. Evaluation.

[12]  J. P. C. Blanc,et al.  A Numerical Study of a Coupled Processor Model , 1987, Computer Performance and Reliability.

[13]  Johan van Leeuwaarden,et al.  On the application of Rouché's theorem in queueing theory , 2006, Oper. Res. Lett..

[14]  Gerard Hooghiemstra,et al.  Power series for stationary distributions of coupled processor models , 1988 .

[15]  Whm Henk Zijm,et al.  A compensation approach for two-dimensional Markov processes , 1993, Advances in Applied Probability.

[16]  G. Fayolle,et al.  Two coupled processors: The reduction to a Riemann-Hilbert problem , 1979 .

[17]  Alan Scheller-Wolf,et al.  Analysis of cycle stealing with switching times and thresholds , 2005, Perform. Evaluation.

[18]  Ivo J. B. F. Adan,et al.  Queueing Models with Multiple Waiting Lines , 2001, Queueing Syst. Theory Appl..