Abstract
New product theorems for open and closed queueing networks are proved. The theorems give precise analytical formulas for the computation of stationary distributions of queueing networks with a certain structure and principle of operation. The subject touched upon in the paper is developed in three directions, each of them being closely connected with mobile phone network systems.
Similar content being viewed by others
REFERENCES
Ivchenko, G.I., Kashtanov, V.A., and Kovalenko, I.N., Teoriya massovogo obsluzhivaniya (Queueing Theory), Moscow: Vyssh. Shkola, 1982.
Kovalenko, I.N., Kuznetsov, N.Yu., and Shurenkov, V.M., Sluchainye protsessy: spravochnik (Stochastic Processes: A Handbook), Kiev: Nauk. Dumka, 1983.
Basharin, G.P. and Tolmachev, A.L., Queueing Network Theory and Its Applications to the Analysis of Information-Computing Networks, in Itogi Nauki Tekh. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., vol. 21, Moscow: VINITI, 1983, pp. 3–119.
Tsitsiashvili, G.Sh., Osipova, M.A., Koliev, N.V., and Baum, D., A Product Theorem for Markov Chains with Application to PF-Queueing Networks, Ann. Oper. Res., 2002, vol. 113, pp. 141–154.
Ivnitskii, V.A., Teoriya setei massovogo obsluzhivaniya (Queueing Network Theory), Moscow: Fizmatlit, 2004.
Krylenko, A.V., Queueing Networks with Several Demand Types, Immediate Service, and Node Bypassing by Demands, Probl. Peredachi Inf., 1997, vol. 33, no.3, pp. 91–101 [Probl. Inf. Trans. (Engl. Transl.), 1997, vol. 33, no. 3, pp. 268–276].
Malinkovskii, Yu.V. and Nikitenko, O.A., Networks with Bypasses and Negative Customers, Avtomat. Telemekh., 2000, vol. 61, no.8, pp. 79–85 [Automat. Remote Control (Engl. Transl.), 2000, vol. 61, no. 8, pp. 1310–1316].
Pittel, B., Closed Exponential Networks of Queues with Saturation: The Jackson-type Stationary Distribution and Its Asymptotic Analysis, Math. Oper. Res., 1979, vol. 4, no.4, pp. 357–378.
Gabasov, R. and Kirillova, F.M., Metody lineinogo programmirovaniya (Linear Programming Methods), vol. 2: Transportnye zadachi (Traffic Problems), Minsk: Belorus. Gos. Univ., 1978.
Author information
Authors and Affiliations
Additional information
__________
Translated from Problemy Peredachi Informatsii, No. 2, 2005, pp. 111–122.
Original Russian Text Copyright © 2005 by Tsitsiashvili, Osipova.
Rights and permissions
About this article
Cite this article
Tsitsiashvili, G.S., Osipova, M.A. New Product Theorems for Queueing Networks. Probl Inf Transm 41, 171–181 (2005). https://doi.org/10.1007/s11122-005-0021-7
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11122-005-0021-7