A hysteretic queueing system with random server capacity

A hysteretic queueing system with random server capacity

0.00 Avg rating0 Votes
Article ID: iaor20003095
Country: United Kingdom
Volume: 38
Issue: 1
Start Page Number: 51
End Page Number: 61
Publication Date: Jul 1999
Journal: Computers & Mathematics with Applications
Authors: , ,
Abstract:

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 probabilites 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.

Reviews

Required fields are marked *. Your email address will not be published.