Problems of Information Transmission

, Volume 47, Issue 1, pp 57–63 | Cite as

A zero-or-one law in aggregated closed queueing networks

  • G. Sh. TsitsiashviliEmail author
  • M. A. Osipova
Communication Network Theory


For a closed queueing network with single-server nodes, we prove that if the total number of requests, the number of servers in one of the nodes, and service rates in all other nodes are made n times as large, then the stationary number of requests in the multiserver node divided by n converges in probability as n → ∞ to a positive constant, determined by parameters of the original network, with geometric convergence rate. Single-server nodes in the constructed network can be interpreted as repair nodes, the multiserver node as a set of workplaces, and requests as elements in a redundancy-with-repair model.


Information Transmission Service Rate Transportation Problem Queueing System Original Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Basharin, G.P. and Tolmachev, A.L., Queueing Network Theory and Its Applications to the Analysis of Data Processing Networks, in Itogi Nauki Tekh. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., vol. 21, Moscow: VINITI, 1983, pp. 3–119.Google Scholar
  2. 2.
    Serfozo, R., Introduction to Stochastic Networks, New York: Springer, 1999.zbMATHGoogle Scholar
  3. 3.
    Vishnevskii, V.M., Teoreticheskie osnovy proektirovaniya komp’yuternykh setei, (Theoretical Principles of Computer Network Design), Moscow: Tekhnosfera, 2003.Google Scholar
  4. 4.
    Kakubava, R.V. and Khurodze, R.A., Probabilistic Analysis of the Downtime of a Duplicated System with Recovery and Switching, Avtomat. Telemekh., 2000, vol. 61, Part 1, no. 9, pp. 84–89 [Automat. Remote Control (Engl. Transl.), 2000, vol. 61, Part 1, no. 9, pp. 1489–1494].Google Scholar
  5. 5.
    Basharin, G.P., Lektsii po matematicheskoi teorii teletrafika (Lections on Mathematical Teletraffic Theory), Moscow: Ros. Univ. Druzhby Narodov, 2007, 2nd ed.Google Scholar
  6. 6.
    Gordon, W.J. and Newell, G.F., Closed Queueing Systems with Exponential Servers, Oper. Res., 1967, vol. 15, no. 2, pp. 254–265.CrossRefzbMATHGoogle Scholar
  7. 7.
    Kaminskii, V.N., Asymptotic Properties of Closed Network Models of Computing Systems, in Vychislitel’nye sistemy i kompleksy (Computing Systems and Complexes), Leningrad: Leningrad Inst. of Precision Mechanics and Optics, 1980, pp. 7–12.Google Scholar
  8. 8.
    Gnedenko, B.V., Belyaev, Yu.K., and Solov’ev, A.D., Matematicheskie metody v teorii nadezhnosti, Moscow: Nauka, 1965. Translated under the title Mathematical Methods of Reliability Theory, New York: Academic, 1969.Google Scholar
  9. 9.
    Tsitsiashvili, G.Sh., Cooperative Effects in Multi-Server Queueing Systems, Math. Sci., 2005, vol. 30, no. 1, pp. 17–24.zbMATHMathSciNetGoogle Scholar
  10. 10.
    Tsitsiashvili, G.Sh. and Markova, N.V., Cooperative Effects in Renewal Systems with Common Reserve and Competition of Repair Places, Commun. Dependability Qual. Manag., 2005, vol. 8, no. 3, pp. 71–75.Google Scholar
  11. 11.
    Ivchenko, G.I., Kashtanov, V.A., and Kovalenko, I.N., Teoriya massovogo obsluzhivaniya (Queueing Theory), Moscow: Vyssh. Shkola, 1982.zbMATHGoogle Scholar
  12. 12.
    Tsitsiashvili, G.Sh., Parametric and Structural Optimization of the Queuing Network Throughput, Avtomat. Telemekh., 2007, no. 7, pp. 64–73 [Automat. Remote Control (Engl. Transl.), 2007, vol. 68, no. 7, pp. 1177–1185].Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2011

Authors and Affiliations

  1. 1.Institute of Applied MathematicsFar East Branch of the Russian Academy of SciencesVladivostokRussia

Personalised recommendations