Skip to main content
Springer Nature Link
Log in

Analysis of queueing networks with batch movements of customers and control of flows among clusters

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

The paper proposes two methods for calculating the stationary distribution of the queueing networks with batch movements of customers and control of flows among clusters. The methods differ in their computing efficiency. The constraints related to practical use of the first method are determined mostly by the dependence of the required amount of computation on the cardinality of the set of states of networks under study. The second method is approximate and analyzes queueing networks lying in the subclass of almost completely decomposable networks. The second method is based on the decomposition of set of states of the queueing network under study into subsets and proves much more computationally efficient compared to the first method.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. Woodward, M.E., Towards the accurate modeling of high-speed communication networks with product-form discrete-time networks of queues, Compt. Commun., 1998, vol. 21, pp. 1530–1543.

    Article  Google Scholar 

  2. Henderson, W., Pearce, C.E.M., Taylor, P.G., and Dijk, N.M., Closed queueing networks with batch services, Queueing Systems, 1990, vol. 6, pp. 59–70.

    Article  MATH  Google Scholar 

  3. Henderson, W. and Taylor, P.G., Product form in networks of queues with batch arrivals and batch services, Queueing Systems, 1990, vol. 6, pp. 71–88.

    Article  MathSciNet  MATH  Google Scholar 

  4. Boucherie, R.J. and Dijk, N.M., Product forms for queueing networks with state-dependent multiple job tran-sitions, Adv. Appl. Probl., 1991, vol. 23, no. 1, pp. 152–187.

    Article  MATH  Google Scholar 

  5. Serfozo, R.F., Queueing networks with dependent nodes and concurrent movements, Queueing Systems, 1993, vol. 13, pp. 143–182.

    Article  MathSciNet  MATH  Google Scholar 

  6. Miyazawa, M., Structure-reversibility and departure functions of queueing networks with batch movements and state dependent routing, Queueing Systems, 1997, vol. 25, pp. 45–75.

    Article  MathSciNet  MATH  Google Scholar 

  7. Boucherie, R.J. and Dijk, N.M., Spatial birth-dearth processes with multiple changes and applications to batch service networks and clustering processes, Adv. Appl. Probl., 1991, vol. 22, pp. 433–455.

    Article  Google Scholar 

  8. Boucherie, R.J., Batch routing queueing networks with jump-over blocking, Probab. Eng. Inform. Sci., 1996, vol. 10, pp. 287–297.

    Article  MathSciNet  MATH  Google Scholar 

  9. Bause, F., Boucherie, R.J., and Buchholz, P., Norton’s theorem for batch routing queueing networks, Stochastic Models, 2001, vol. 17, pp. 39–60.

    Article  MathSciNet  MATH  Google Scholar 

  10. Coyle, A.J., Henderson, W., Pearce, C.E.M., and Taylor, P.G., A general formulation for mean-value analysis in product-form batch-movement queueing networks, Queueing Systems, 1994, vol. 16, pp. 363–372.

    Article  MathSciNet  MATH  Google Scholar 

  11. Boucherie, R.J. and Dijk, N.M., A generalization of Norton’s theorem for queueing networks, Queueing Sys-tems, 1993, vol. 13, pp. 251–289.

    Article  MATH  Google Scholar 

  12. Dijk, N.M. and Sluis, E., Simple product-form bounds for queueing networks with finite clusters, Ann. Oper. Res., 2002, vol. 113, pp. 175–195.

    Article  MathSciNet  MATH  Google Scholar 

  13. Boucherie, R.J. and Dijk, N.M., Queueing Networks: A Fundamental Approach. New York Springer Sci. + Busi-ness Media, 2011.

    Book  Google Scholar 

  14. Mitrofanov, Yu.I., Dolgov, V.I., Rogachko, E.S., and Stankevich, E.P., Queueing networks with batch move-ments of customers, blocking and clusters, Izv. Saratov. Univ., Nov, Ser. Ser. Matem. Mekhan. Inform., 2013, vol. 13, pp. 20–31.

    MATH  Google Scholar 

  15. Mitrofanov, Yu.I. and Rogachko, E.S., A method of dynamic control of load allocation among the subnetworks of a closed queueing network, Autom. Cont. Compt. Sci., 2006, vol. 40, no. 4, pp. 1–8.

    Google Scholar 

  16. Mitrofanov, Yu.I., Rogachko, E.S., and Stankevich, E.P., Analysis of inhomogeneous queueing networks with batch movements of customers, Izv. Saratov. Univ., Nov, Ser. Ser. Matem. Mekhan. Inform., 2011, vol. 11, pp. 41–46.

    Google Scholar 

  17. Simon, H.A. and Ando, A., Aggregation of variables in dynamic systems, Econometrica, 1961, vol. 29, pp. 111–138.

    Article  MATH  Google Scholar 

  18. Courtois, P.J., Error analysis in nearly-completely decomposable stochastic systems, Econometrica, 1975, vol. 43, pp. 691–709.

    Article  MathSciNet  MATH  Google Scholar 

  19. Mitrofanov, Yu.I., Belyakov, V.G., and Kurbangulov, V.Kh., Methods and Programming Means of Analytical Modeling of Network Systems, Preprint of Sci. Council of Russ. Acad. Sci. on Complex Problem “Kibernetics,” 1982.

    Google Scholar 

  20. Mitrofanov, Yu.I., Analiz setei massovogo obsluzhivaniya (Analysis of Queueing Networks), Saratov Nauch. Kniga, 2005.

    Google Scholar 

  21. Mitrofanov, Yu.I. and Belyakov, V.G., Method of decomposition at modeling computer structures, in Voprosy kibernetiki. Protsessy adaptatsii v informatsionno-vychislitel’nykh setyakh (Cybernetics Questions. Adaptation Processes in Information-Computational Networks), Moscow Nauchn. Sovet AN SSSR po Kompleksnoi Probleme “Kibernetika”, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Saratov State University, ul. Astrakhanskaya 83, Saratov, 410012, Russia

    Yu. I. Mitrofanov, E. S. Rogachko & E. P. Stankevich

Authors
  1. Yu. I. Mitrofanov
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. E. S. Rogachko
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. E. P. Stankevich
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Yu. I. Mitrofanov.

Additional information

Original Russian Text © Yu.I. Mitrofanov, E.S. Rogachko, E.P. Stankevich, 2015, published in Avtomatika i Vychislitel’naya Tekhnika, 2015, No. 4, pp. 45–57.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mitrofanov, Y.I., Rogachko, E.S. & Stankevich, E.P. Analysis of queueing networks with batch movements of customers and control of flows among clusters. Aut. Control Comp. Sci. 49, 221–230 (2015). https://doi.org/10.3103/S0146411615040094

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411615040094

Keywords