Skip to main content
Log in

Dynamic control of service rates in queuing networks

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

Abstract

A method for dynamic control of service rates in closed exponential queuing networks is proposed. The performance of queuing networks with the service-rate control is analyzed, and the main steady-state network characteristics are computed using an analytic approximation. A simple example of a queuing network with controlled service rates is considered as an illustration. The efficiency of the service-rate control is confirmed by Monte Carlo simulations, which, as a by-product, also show acceptable accuracy of our analytical approximations.

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

Access this article

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. Alidrisi, M., Linear programming model for the optimal control of a queuing network, Int. J. Syst. Sci., 1997, vol. 18, pp. 1079–1089.

    Article  MathSciNet  Google Scholar 

  2. Kyung, Y.Jo., A Lagrangian algorithm for computing the optimal service rates in Jackson queuing networks, Computer Opns Res., 1989, vol. 16, no. 5, pp. 431–440.

    Article  MATH  Google Scholar 

  3. Alidrisi, M.M., Optimal control of the service rate of an exponential queuing network using Markov decision theory, Int. J. Syst. Sci., 1990, vol. 21, no. 2, pp. 2553–2563.

    Article  MATH  MathSciNet  Google Scholar 

  4. Weber, R. and Stidham, S., Optimal control of service rates in networks of queues. Adv. Appl. Prob., 1987, vol. 19, pp. 202–218.

    Article  MATH  MathSciNet  Google Scholar 

  5. Veatch, M.H. and Wein, L.M., Monotone control of queuing networks, Queuing Systems, 1992, v. 12, pp. 391–408.

    Article  MATH  MathSciNet  Google Scholar 

  6. Tassiulas L. and Ephremides A., Throughput properties of a queuing network with distributed dynamic routing and flow control, Adv. Appl. Probab., 1996, vol. 28, no.1, pp. 285–307.

    Article  MATH  MathSciNet  Google Scholar 

  7. Azaron, A. and Ghomi, S.M., Optimal control of service rates and arrival in Jacksom networks. Eur. J. Oper. Res., 2003, vol. 147, no. 1, pp. 17–31.

    Article  MATH  Google Scholar 

  8. Mitrophanov, Yu.I., Analysis of queuing networks. Saratov: Nauchnaya kniga, 2005.

    Google Scholar 

  9. Whitt, W., Open and closed models for networks of queues, AT&T Bell. Lab. Techn. J. 1984, vol. 63, no. 9, pp. 1911–1979.

    MATH  MathSciNet  Google Scholar 

  10. Mitrophanov, Yu.I., Queuing network synthesis, Saratov: Saratov University press, 1995.

    Google Scholar 

  11. Kofman, A. and Kruon, P., Queuing networks. Theory and applications. M: Mir, 1965.

    Google Scholar 

  12. Mitrophanov, Yu.I. and Ivanov, A.N., CPSGDM-a complex of procedures for simulation of generalized discrete models, Programmirovaniye, 1978, no. 5, pp. 74–83.

  13. Mitrophanov, Yu.I., A simulation methodology for a collective computational centre of Siberian Branch of USSR Academy of Sciences, Avtomatika i vychislitel’naya tekhnika, 1981, no. 1, pp. 3–14.

  14. Dolgov, V.I., Investigations of characteristics of queuing networks with service-rate control, Dep. v VINITI 25.05.05, no. 744-B2005, Saratov, 2005.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yu. I. Mitrophanov.

Additional information

Original Russian Text © Yu.I. Mitrophanov, V.I. Dolgov, 2008, published in Avtomatika i Vychislitel’naya Tekhnika, 2008, No. 6, pp. 44–56.

About this article

Cite this article

Mitrophanov, Y.I., Dolgov, V.I. Dynamic control of service rates in queuing networks. Aut. Conrol Comp. Sci. 42, 311–319 (2008). https://doi.org/10.3103/S0146411608060060

Download citation

  • Published:

  • Issue Date:

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

Key words

Navigation