A Taylor Series Approach for Service-Coupled Queueing Systems with Intermediate Load

This paper investigates the performance of a queueing model with multiple finite queues and a single server. Departures from the queues are synchronised or coupled which means that a service completion leads to a departure in every queue and that service is temporarily interrupted whenever any of the queues is empty. We focus on the numerical analysis of this queueing model in a Markovian setting: the arrivals in the different queues constitute Poisson processes and the service times are exponentially distributed. Taking into account the state space explosion problem associated with multidimensional Markov processes, we calculate the terms in the series expansion in the service rate of the stationary distribution of the Markov chain as well as various performance measures when the system is (i) overloaded and (ii) under intermediate load. Our numerical results reveal that, by calculating the series expansions of performance measures around a few service rates, we get accurate estimates of various performance measures once the load is above 40% to 50%.

[1]  G. M. Koole On the power series algorithm , 1994 .

[2]  Dieter Fiems,et al.  A Maclaurin-series expansion approach to multiple paired queues , 2014, Oper. Res. Lett..

[3]  Beatrice Meini,et al.  Numerical methods for structured Markov chains , 2005 .

[4]  Yu. V. Malinkovskii Jackson networks with single-line nodes and limited sojourn or waiting times , 2015, Autom. Remote. Control..

[5]  Peter G. Taylor,et al.  Product form in networks of queues with batch arrivals and batch services , 1990, Queueing Syst. Theory Appl..

[6]  R. Stephenson A and V , 1962, The British journal of ophthalmology.

[7]  Jean B. Lasserre A formula for singular perturbations of Markov chains , 1994 .

[8]  Konstantin Avrachenkov,et al.  Finite-buffer polling systems with threshold-based switching policy , 2016 .

[9]  Dieter Fiems,et al.  Algorithmic approach to series expansions around transient Markov chains with applications to paired queuing systems , 2012, 6th International ICST Conference on Performance Evaluation Methodologies and Tools.

[10]  E. Altman,et al.  Perturbation analysis for denumerable Markov chains with application to queueing models , 2004, Advances in Applied Probability.

[11]  Alexander Thomasian,et al.  Analysis of Fork/Join and Related Queueing Systems , 2014, ACM Comput. Surv..

[12]  Igor N. Kovalenko,et al.  Rare events in queueing systems—A survey , 1994, Queueing Syst. Theory Appl..

[13]  Konstantin Avrachenkov,et al.  Analytic Perturbation Theory and Its Applications , 2013 .

[14]  Herwig Bruneel,et al.  Priority queueing systems: from probability generating functions to tail probabilities , 2007, Queueing Syst. Theory Appl..

[15]  J. P. C. Blanc,et al.  Performance Analysis and Optimization with the Power-Series Algorithm , 1993, Performance/SIGMETRICS Tutorials.

[16]  G. Latouche QUEUES WITH PAIRED CUSTOMERS , 1981 .

[17]  W. B. van den Hout,et al.  The power-series algorithm. A numerical approach to Markov processes , 1996 .

[18]  Robert D. van der Mei,et al.  Optimization of Polling Systems with Bernoulli Schedules , 1995, Perform. Evaluation.

[19]  W. J. Hopp,et al.  Bounds and heuristics for assembly-like queues , 1989, Queueing Syst. Theory Appl..