Breaking the dimensionality curse in multi-server queues - Archive ouverte HAL Access content directly
Journal Articles Computers and Operations Research Year : 2016

Breaking the dimensionality curse in multi-server queues

(1) , (2)
1
2

Abstract

Ph/Ph/c and and Ph/Ph/c/N queues can be viewed as a common model of multi-server facilities. We propose a simple approximate solution for the equilibrium probabilities in such queues based on a reduced state description in order to circumvent the well-known and dreaded combinatorial growth of the number of states inherent in the classical state description. The number of equations to solve in our approach increases linearly with the number of servers and phases in the service time distribution. A simple fixed-point iteration is used to solve these equations. Our approach applies both to open models with unrestricted buffer size and to queues with finite-size buffers. The results of a large number of empirical studies indicate that the overall accuracy of the proposed approximation appears very good. For instance, the median relative error for the mean number in the queue over thousands of examples is below 0.1% and the relative error exceeds 5% in less than 1.5% of cases explored. The accuracy of the proposed approximation becomes particularly good for systems with more than 8 servers, and tends to become excellent as the number of servers increases.
Fichier principal
Vignette du fichier
Revision.pdf (3.91 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01322249 , version 1 (26-05-2016)

Identifiers

Cite

Alexandre Brandwajn, Thomas Begin. Breaking the dimensionality curse in multi-server queues. Computers and Operations Research, 2016, pp.141-149. ⟨10.1016/j.cor.2016.04.011⟩. ⟨hal-01322249⟩
119 View
107 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More