Power series approximations for two-class generalized processor sharing systems

Authors:
Joris Walraevens;J. S. Leeuwaarden;Onno J. Boxma
Affiliations:
Department of Telecommunications and Information Processing, Ghent University --- UGent, Gent, Belgium 9000;Eindhoven University of Technology and EURANDOM, Eindhoven, The Netherlands 5600 MB;Eindhoven University of Technology and EURANDOM, Eindhoven, The Netherlands 5600 MB
Venue:
Queueing Systems: Theory and Applications
Year:
2010

Citing 8
Cited 1

On a numerical method for calculating state probabilities for queueing systems with more than one waiting line

Journal of Computational and Applied Mathematics
Power series for stationary distributions of coupled processor models

SIAM Journal on Applied Mathematics
Boundary value problems in queueing theory

Queueing Systems: Theory and Applications
Delay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing discipline

Performance Evaluation
Queueing Models with Multiple Waiting Lines

Queueing Systems: Theory and Applications
A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers

Queueing Systems: Theory and Applications
Analysis of cycle stealing with switching times and thresholds

Performance Evaluation
On the application of Rouché's theorem in queueing theory

Operations Research Letters

Analysis of a two-class FCFS queueing system with interclass correlation

ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop power series approximations for a discrete-time queueing system with two parallel queues and one processor. If both queues are nonempty, 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(z 1,z 2) 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(z 1,z 2) 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 Padé approximation.