A hysteretic queueing system with random server capacity

We consider in this paper, an r-quorum queueing system with random server capacity under N-policy discipline (hysteretic system). We find a necessary and sufficient condition for ergodicity, the probability generating function of the steady state vector of probabilities for the embedded process and...

Full description

Saved in:
Bibliographic Details
Published in:Computers & mathematics with applications (1987) 1999-07, Vol.38 (1), p.51-61
Main Authors: Tadj, L., Benkherouf, L., Aggoun, L.
Format: Article
Language:English
Subjects:
Embedded Markov chain
Hysteresis
N-policy
q-discipline
r-quorum models
Semi-regenerative process
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider in this paper, an r-quorum queueing system with random server capacity under N-policy discipline (hysteretic system). We find a necessary and sufficient condition for ergodicity, the probability generating function of the steady state vector of probabilities for the embedded process and the continuous time parameter, and some system characteristics. The decomposition property is checked for both discrete and continuous time parameter processes. Special cases are considered and examples are provided.
ISSN:0898-1221
1873-7668
DOI:10.1016/S0898-1221(99)00168-6