Premium
A multiserver queue with markovian arrivals and group services with thresholds
Author(s) -
Chakravarthy S.,
Alfa Attahiru Sule
Publication year - 1993
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199310)40:6<811::aid-nav3220400606>3.0.co;2-r
Subject(s) - markovian arrival process , markov process , computer science , probabilistic logic , queueing theory , queue , computation , server , mathematics , exponential function , mathematical optimization , algorithm , statistics , computer network , mathematical analysis , artificial intelligence
We consider a multiserver queueing system in which arrivals are governed by a Markovian arrival process. The system is attended by K identical exponential servers. Under a dynamic probabilistic service rule which depends on two threshold parameters, this model is studied as a Markov process. The steady‐state probability vector is shown to be of (modified) matrix‐geometric type. Efficient algorithmic procedures for the computation of the steady‐state probability vector and some key performance measures of the system are developed. Some numerical examples are discussed. © 1993 John Wiley & Sons, Inc.