zbMATH — the first resource for mathematics

Strong stability of queues with multiple vacation of the server. (English) Zbl 1139.60341
Summary: The main purpose of this article is to use the strong stability method to approximate the characteristics of the \(M/G/1//N\) queue with server vacation by those of the classical \(M/G/1//N\) queue, when the rate of the vacations is sufficiently small. This last queue is simpler and more exploitable in practice. For this, we proof the stability conditions and next obtain quantitative stability estimates with an exact computation of constants. From these theoretical results, we can develop an algorithm in order to check the conditions of approximation. These results of approximation have a great practical and economic interest in reliability systems and maintenance optimization policy, when we consider elements with constant failure rate.

60K25 Queueing theory (aspects of probability theory)
60J25 Continuous-time Markov processes on general state spaces
Full Text: DOI
[1] Aïssani D., Dokl. Akad. Nauk Ukr. SSR 12 pp 1– (1983)
[2] Borovkov A.A., Ergodicity and Stability of Stochastic Processes (1998)
[3] DOI: 10.1007/BF01149327 · Zbl 0655.60089
[4] DOI: 10.1137/S0895479892237562 · Zbl 0809.65144
[5] Kalashnikov V.V., Queueing Theory and Reliability pp 211– (1971)
[6] Kartashov , N.V. 1996 .Strong Stable Markov Chains. VSP, Utrecht; Brill, Leiden , p. 138 . · Zbl 0874.60082
[7] Stoyan D., Comparaison Methods for Queueing Models and Others Stochastic Models (1983)
[8] DOI: 10.1287/opre.42.5.926 · Zbl 0829.90063
[9] DOI: 10.1016/0166-5316(90)90003-2
[10] DOI: 10.1137/1120088 · Zbl 0351.60086
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.