An approximation method for a non-preemptive multiserver queue with quasi-Poisson arrivals - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Modeling and Performance Evaluation of Computing Systems Année : 2023

An approximation method for a non-preemptive multiserver queue with quasi-Poisson arrivals

Résumé

We consider a non-preemptive multiserver queue with multiple priority classes. We assume distinct exponentially distributed service times and separate quasi-Poisson arrival processes with a predefined maximum number of requests that can be present in the system for each class. We present an approximation method to obtain the steady-state probabilities for the number of requests of each class in our system. In our method, the priority levels (classes) are solved "nearly separately", linked only by certain conditional probabilities determined approximately from the solution of other priority levels. Several numerical examples illustrate the accuracy of our approximate solution. The proposed approach significantly reduces the complexity of the problem while featuring generally good accuracy.
Fichier principal
Vignette du fichier
50333511_File000002_1264253172.pdf (1.4 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04363384 , version 1 (24-12-2023)

Identifiants

  • HAL Id : hal-04363384 , version 1

Citer

Alexandre Brandwajn, Thomas Begin. An approximation method for a non-preemptive multiserver queue with quasi-Poisson arrivals. ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2023. ⟨hal-04363384⟩
13 Consultations
7 Téléchargements

Partager

Gmail Facebook X LinkedIn More