Skip to main content
Log in

Parameter estimation for product-form distributions of queueing networks

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

Abstract

Basic parameters of a queueing network are its routing matrix, arrival flow rate, and service rates at network nodes. To estimate these parameters, one has to solve a system of balance equations. In turn, a product-form limiting distribution of the number of customers at the network nodes is defined through loading factors. Therefore, in the paper we propose to estimate loading factors through estimates of the limiting distribution based on observations of the number of customers at the nodes. This makes it possible to avoid solving a system of balance equations. This algorithm is realized for Jackson networks: classical, in a random environment, with blocked transitions.

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

  2. Serfozo, R., Introduction to Stochastic Networks, New York: Springer, 1999.

    MATH  Google Scholar 

  3. Vishnevskii, V.M., Teoreticheskie osnovy proektirovaniya komp’yuternykh setei, (Theoretical Principles of Computer Network Design), Moscow: Tekhnosila, 2003.

    Google Scholar 

  4. Basharin, G.P., Lektsii po matematicheskoi teorii teletrafika (Lections on Mathematical Teletraffic Theory), Moscow: Ros. Univ. Druzhby Narodov, 2007, 2nd ed.

    Google Scholar 

  5. Gortsev, A.M. and Klimov, I.S., Estimation of Intensity of a Poisson Flow of Events under the Conditions of Its Partial Observability, Radiotekhnika, 1991, no. 12, pp. 3–7.

  6. Gortsev, A.M. and Shmyrin, I.S., Optimal Estimation of States of a Double Stochastic Flow of Events in the Presence of Measurement Errors of Time Instants, Avtom. Telemekh., 1999, no. 1, pp. 52–66 [Autom. Remote Control (Engl. Transl.), 1999, vol. 60, no. 1, Part 1, pp. 41–51].

  7. Shirokov, V.L., Throughput Evaluation Models for Multifunction Traffic Exchange Systems by Examples of Wireless Access NetworksWi-Fi, Wireless MAN, andWiMAX, Vychisl. Seti. Teor. Prakt., 2004, no. 2, Section 6, Article 1 (electronic; see http://network-journal.mpei.ac.ru).

  8. Shirokov, V.L., Metodika otsenki i vybora parametrov mul’tiservisnykh sistem obmena informatsiei (Methods of Parameter Estimation and Selection for Multiservice Data Exchange Systems). Available from VINITI, 2006, Moscow, no. 1102-B2006.

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

    MATH  Google Scholar 

  10. Chang, C.S., Thomas, J.A., and Kiang, S.H., On the Stability of Open Networks. A Unified Approach by Stochastic Dominance, Queueing Systems Theory Appl., 1994, vol. 15, no. 1–4, pp. 239–260.

    Article  MATH  MathSciNet  Google Scholar 

  11. Baccelli, F. and Foss, S.G., Ergodicity of Jackson-type Queueing Networks, Queueing Systems Theory Appl., 1994, vol. 17, no. 1–2, pp. 5–72.

    Article  MATH  MathSciNet  Google Scholar 

  12. Kendall, D.G., Unitary Dilations of One-Parameter Semigroups of Markov Transition Operators, and the Corresponding Integral Representations for Markov Processes with a Countable Infinity of States, Proc. London Math. Soc., Ser. 3, 1959, vol. 9, no. 3, pp. 417–431.

    Article  MATH  MathSciNet  Google Scholar 

  13. Shur, M.G., On the Law of Large Numbers for Markov Processes, Teor. Veroyatnost. i Primenen., 1963, vol. 8, no. 2, pp. 224–228 [Theor. Probab. Appl. (Engl. Transl.), 1963, vol. 8, pp. 208–212].

    MathSciNet  Google Scholar 

  14. Tsitsiashvili, G.Sh. and Osipova, M.A., Limiting Distributions in Queueing Networks with Unreliable Elements, Probl. Peredachi Inf., 2008, vol. 44, no. 4, pp. 109–119 [Probl. Inf. Trans. (Engl. Transl.), 2008, vol. 44, no. 4, pp. 385–394].

    MathSciNet  Google Scholar 

  15. Tsitsiashvili, G.Sh. and Osipova, M.A., New Product Theorems for Queueing Networks, Probl. Peredachi Inf., 2005, vol. 41, no. 2, pp. 111–122 [Probl. Inf. Trans. (Engl. Transl.), 2005, vol. 41, no. 2, pp. 171–181].

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to G. Sh. Tsitsiashvili.

Additional information

Original Russian Text © G.Sh. Tsitsiashvili, M.A. Osipova, 2009, published in Problemy Peredachi Informatsii, 2009, Vol. 45, No. 4, pp. 115–120.

Supported in part by the Far East Branch of the Russian Academy of Sciences, project nos. 09-1-P2-07 and 09-III-A-01-010.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tsitsiashvili, G.S., Osipova, M.A. Parameter estimation for product-form distributions of queueing networks. Probl Inf Transm 45, 400–405 (2009). https://doi.org/10.1134/S0032946009040097

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946009040097

Keywords

Navigation