Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T17:18:39.914Z Has data issue: false hasContentIssue false

A Recurrent Solution of PH/M/c/N-Like and PH/M/c-Like Queues

Published online by Cambridge University Press:  04 February 2016

Alexandre Brandwajn*
Affiliation:
University of California Santa Cruz
Thomas Begin*
Affiliation:
Université Lyon 1
*
∗ Postal address: Baskin School of Engineering, University of California Santa Cruz, 1156 High Street, Mail Stop SOE3, Santa Cruz, CA 95064, USA. Email address: alexb@soe.ucsc.edu
∗∗ Postal address: LIP UMR CNRS - ENS Lyon - UCB Lyon 1 - INRIA, Université Lyon 1, 46 allée d'Italie, 69364 Lyon Cedex 7, France. Email address: thomas.begin@ens-lyon.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We propose an efficient semi-numerical approach to compute the steady-state probability distribution for the number of requests at arbitrary and at arrival time instants in PH/M/c-like systems with homogeneous servers in which the inter-arrival time distribution is represented by an acyclic set of memoryless phases. Our method is based on conditional probabilities and results in a simple computationally stable recurrence. It avoids the explicit manipulation of potentially large matrices and involves no iteration. Owing to the use of conditional probabilities, it delays the onset of numerical issues related to floating-point underflow as the number of servers and/or phases increases. For generalized Coxian distributions, the computational complexity of the proposed approach grows linearly with the number of phases in the distribution.

Information

Type
Research Article
Copyright
© Applied Probability Trust