A recurrent solution of Ph/M/c/N-like and Ph/M/c-like queues

Alexandre Brandwajn 1 Thomas Begin 2
2 RESO - Protocols and softwares for very high-performance network
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : 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 homogenous 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. Due 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.
Type de document :
Article dans une revue
Journal of Applied Probability, Applied Probability Trust, 2012, 49 (1), pp.84-99
Liste complète des métadonnées

Littérature citée [1 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00746840
Contributeur : Thomas Begin <>
Soumis le : lundi 29 octobre 2012 - 20:13:57
Dernière modification le : mardi 16 janvier 2018 - 16:20:38
Document(s) archivé(s) le : mercredi 30 janvier 2013 - 03:41:42

Fichier

13564_Final.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00746840, version 1

Collections

Citation

Alexandre Brandwajn, Thomas Begin. A recurrent solution of Ph/M/c/N-like and Ph/M/c-like queues. Journal of Applied Probability, Applied Probability Trust, 2012, 49 (1), pp.84-99. 〈hal-00746840〉

Partager

Métriques

Consultations de la notice

179

Téléchargements de fichiers

130