Skip to main content
Log in

New Product Theorems for Queueing Networks

  • Communication Network Theory
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Ivchenko, G.I., Kashtanov, V.A., and Kovalenko, I.N., Teoriya massovogo obsluzhivaniya (Queueing Theory), Moscow: Vyssh. Shkola, 1982.

    Google Scholar 

  2. Kovalenko, I.N., Kuznetsov, N.Yu., and Shurenkov, V.M., Sluchainye protsessy: spravochnik (Stochastic Processes: A Handbook), Kiev: Nauk. Dumka, 1983.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. Ivnitskii, V.A., Teoriya setei massovogo obsluzhivaniya (Queueing Network Theory), Moscow: Fizmatlit, 2004.

    Google Scholar 

  6. 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].

    Google Scholar 

  7. 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].

    Google Scholar 

  8. 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.

    Google Scholar 

  9. Gabasov, R. and Kirillova, F.M., Metody lineinogo programmirovaniya (Linear Programming Methods), vol. 2: Transportnye zadachi (Traffic Problems), Minsk: Belorus. Gos. Univ., 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

__________

Translated from Problemy Peredachi Informatsii, No. 2, 2005, pp. 111–122.

Original Russian Text Copyright © 2005 by Tsitsiashvili, Osipova.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11122-005-0021-7

Keywords

Navigation