Geodesic
Construction of queueing networks with stationary product distributions
Dalʹnevostočnyj matematičeskij žurnal, Tome 5 (2004) no. 1, pp. 82-88.

Voir la notice de l'article provenant de la source Math-Net.Ru

In this article some new product theorems for opened and closed queuing networks with finite number of states have been proved. Each network is characterized by a graph with states in its nodes and positive transition intensities in its edges. For different graphs and systems of motion equations stationary product distributions of Markov processes, which describe queuing networks with different prohibited transitions, have been obtained. An algorithm of route matrices calculations in accordance with modified systems of motion equations have been constructed. 
@article{DVMG_2004_5_1_a9,
     author = {G. Sh. Tsitsiashvili and M. A. Osipova},
     title = {Construction of queueing networks with stationary product distributions},
     journal = {Dalʹnevosto\v{c}nyj matemati\v{c}eskij \v{z}urnal},
     pages = {82--88},
     publisher = {mathdoc},
     volume = {5},
     number = {1},
     year = {2004},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DVMG_2004_5_1_a9/}
}
TY  - JOUR
AU  - G. Sh. Tsitsiashvili
AU  - M. A. Osipova
TI  - Construction of queueing networks with stationary product distributions
JO  - Dalʹnevostočnyj matematičeskij žurnal
PY  - 2004
SP  - 82
EP  - 88
VL  - 5
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DVMG_2004_5_1_a9/
LA  - ru
ID  - DVMG_2004_5_1_a9
ER  - 
%0 Journal Article
%A G. Sh. Tsitsiashvili
%A M. A. Osipova
%T Construction of queueing networks with stationary product distributions
%J Dalʹnevostočnyj matematičeskij žurnal
%D 2004
%P 82-88
%V 5
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DVMG_2004_5_1_a9/
%G ru
%F DVMG_2004_5_1_a9
G. Sh. Tsitsiashvili; M. A. Osipova. Construction of queueing networks with stationary product distributions. Dalʹnevostočnyj matematičeskij žurnal, Tome 5 (2004) no. 1, pp. 82-88. http://geodesic.mathdoc.fr/item/DVMG_2004_5_1_a9/

[1] J. R. Jackson, “Networks of Waiting Lines”, Oper. Res., 5:4 (1957), 518–521 | DOI | MR

[2] K. D. Gordon, G. F. Newell, “Closed Queuing Systems with Exponential Servers”, Oper. Research, 15:2 (1967), 254–265 | DOI | Zbl

[3] G. I. Ivchenko, V. A. Kashtanov, I. N. Kovalenko, Teoriya massovogo obsluzhivaniya, Vysshaya shkola, M., 1982, 256 pp. | Zbl

[4] R. Gabasov, F. M. Kirillova, Metody lineinogo programmirovaniya, v. 2, BGU, Minsk, 1978, 239 pp. | MR