Stationary flows in acyclic queuing networks
Dalʹnevostočnyj matematičeskij žurnal, Tome 16 (2016) no. 2, pp. 223-228
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
In this paper an open acyclic queuing network with exponentially distributed service times is considered. Using a transformation of this network to a network of multiphase type it is proved that its flows are Poisson and some of these flows are independent. Applications to systems with retrial queues are described.
[1] P. J. Burke, “The output of a queuing system”, Operations Research, 4 (1956), 699–704 | DOI | MR
[2] T. Kh. Kormen, Ch. I. Leizerson, R. L. Rivest, K. Shtain, Algoritmy: postroenie i analiz, Vilyams, Moskva, 2006
[3] J. R. Jackson, “Networks of Waiting Lines”, Oper. Res. Vol., 5:4 (1957), 518–521 | DOI | MR
[4] V. I. Tikhonov, M. A. Mironov, Markovskie protsessy, Sov. radio, Moskva, 1977 | MR