DETERMINING THE STEADY-STATE PROBABILITIES OF AN EMBEDDED MARKOV CHAIN IN A RETRIAL QUEUING SYSTEM WITH A FLOW OF DEMANDS OF DIFFERENT TYPES

被引：0

作者：

Dyshliuk, O. N. ^{[1
]}

Koba, E. V. ^{[2
]}

机构：

[1] Nat Aviat Univ, Kiev, Ukraine

[2] Natl Acad Sci Ukraine, V M Glushkov Inst Cybernet, Kiev, Ukraine

来源：

CYBERNETICS AND SYSTEMS ANALYSIS | 2012年 / 48卷 / 04期

关键词：

retrial queuing system; flow of demands of different types; orbit; embedded Markov chain; states of a chain; transition probabilities;

D O I：

10.1007/s10559-012-9440-9

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

A single-channel retrial queuing system with the input flow of demands of different types is considered. The sojourn time in the orbit of a demand of any type is exponentially distributed. An embedded Markov chain is set up. The explicit and approximate formulas for the transition probabilities of the chain are derived and are used to determine the steady-state probabilities.

引用

页码：601 / 604

页数：4

共 9 条

[1] Some markovian queuing retrial systems under light-traffic conditions
Anisimov V.V.
Kurtulush M.
[J]. Cybernetics and Systems Analysis, 2001, 37 (6) : 876 - 887
[2] A retrial BMAP/SM/1 system with linear repeated requests
Dudin, A
Klimenok, V
[J]. QUEUEING SYSTEMS, 2000, 34 (1-4) : 47 - 66
[3] Falin G., 1990, Queueing Systems Theory and Applications, V7, P127, DOI 10.1007/BF01158472
[4] Falin G. I., 1997, RETRIAL QUEUES
[5] Koba E. V., 2002, THEORY STOCHASTIC PR, V24, P201
[6] Kulkarni V. G., 1985, J APPL PROBAB, V20, P380
[7] Kuznetsov D. Yu, 2003, ADAPTIVE NETWORKS RA
[8] Cyclic-waiting systems
Lakatos L.
[J]. Cybernetics and Systems Analysis, 2010, 46 (3) : 477 - 484
[9] Yang T., 1987, Queueing Systems Theory and Applications, V2, P201, DOI 10.1007/BF01158899

← 1 →