Matrix analytic solution to a quorum queueing system

Authors:
L Tadj;N.E Rikli
Affiliations:
Department of Statistics and Operations Research King Saud University P.O. Box 2455, Riyadh 11451, Saudi Arabia;Department of Computer Engineering King Saud University P.O. Box 51178, Riyadh 11453, Saudi Arabia
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2000

Citing 4
Cited 1

Distributed operating systems

ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Queueing systems with state dependent parameters

Frontiers in queueing
A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance

IEEE Journal on Selected Areas in Communications
Models for Analysis of Packet Voice Communications Systems

IEEE Journal on Selected Areas in Communications

Recursive solution to a quorum queueing system

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.98

Visualization

Abstract

A quorum queueing system is considered here. It is assumed that the server activation is triggered only if the queue size is larger than or equal to r. Furthermore, after a service completion, if the queue size is less than r the server is assumed to wait for the queue to be filled. Once the queue reaches r, a random sample of customers, drawn from the sample space {1,2,h.,r}, is taken for service. A Markov formulation of the system observed at service completions is presented. Then, the matrix analytic method developed by Neuts is used to solve for the steady state probabilities of the number of customers in the system. The performance of the system is then studied under various operational conditions, some illustrative examples are provided, and conclusions are presented.