Probabilistic decomposition method on the serverindices of an \(\mathrm{M}^\xi/\mathrm{G}/1\) vacation queue. (English) Zbl 1406.60124

Liu, Renbin

J. Appl. Math. 2014, Article ID 241636, 9 p. (2014).

Summary: This paper develops a probabilistic decomposition method for an \(\mathrm{M}^\xi/\mathrm{G}/1\) repairable queueing system with multiple vacations, in which the customers who arrive during server vacations enter the system with probability \(p\). Such a novel method is used to analyze the main performance indices of the server, such as the unavailability and the mean failure number during \((0,t]\). It is derived that the structures of server indices are two convolution equations. Further, comparisons with existing methods indicate that our method is effective and applicable for studying server performances in single-server \(\mathrm{M}^\xi/\mathrm{G}/1\) vacation queues and their complex variants. Finally, a stochastic order and production system with a multipurpose production facility is numerically presented for illustrative purpose.

MSC:

60K25	Queueing theory (aspects of probability theory)
68M20	Performance evaluation, queueing, and scheduling in the context of computer systems