Izvestiya of Saratov University.

Mathematics. Mechanics. Informatics

ISSN 1816-9791 (Print)
ISSN 2541-9005 (Online)


For citation:

Mitrophanov Y. I., Dolgov V. I., Rogachko E. S., Stankevich E. P. Method for Analysis of Closed Queueing Networks with Discrete Time, Batch Movements of Customers and Dynamic Control of Service Rates. Izv. Sarat. Univ. Math. Mech. Inform., 2017, vol. 17, iss. 1, pp. 96-108. DOI: 10.18500/1816-9791-2017-17-1-96-108

This is an open access article distributed under the terms of Creative Commons Attribution 4.0 International License (CC-BY 4.0).
Published online: 
22.02.2017
Full text:
(downloads: 54)
Language: 
Russian
Heading: 
UDC: 
519.872

Method for Analysis of Closed Queueing Networks with Discrete Time, Batch Movements of Customers and Dynamic Control of Service Rates

Autors: 
Mitrophanov Yurii Ivanovich, Saratov State University
Dolgov Vitalii Igorevich, Saratov State University
Rogachko Ekaterina Sergeevna, Saratov State University
Stankevich Elena Petrovna, Saratov State University
Abstract: 

The closed queueing networks with single class of customers, discrete time and batch movements of customers are considered. Queues include multiple identical servers with geometric distribution of service times. A method for dynamic control of service rates in queues is proposed. The control is realized by use of different service rates during fixed time intervals in process of networks operation. When this method is used in queueing networks of considered type, close to given customer allocation among queueing systems is provided. Models for evolution and methods for analysis of closed queueing networks with single class of customers, discrete time and batch movements of customers without control and with dynamic control of service rates are proposed. These methods provide possibility of computing basic steady-state characteristics of considered classes queueing networks. An example of queueing network with control of service rates is presented. Results of analysis of this network have shown efficiency of method for control of service rates and acceptable for practical applications accuracy of method for analysis. 

References: 
  1. Alfa A. S. Queueing theory for telecommunications: discrete time modelling of a single node system. New York, Heidelberg, London, Springer Science + Business Media, LLC, 2010. 248 p. DOI: https://doi.org/10.1007/978-1-4419-7314-6.
  2. Daduna H. Queueing networks with discrete time scale: explicit expressions for the steady state behavior of discrete time stochastic networks. Berlin, Heidelberg, Springer-Verlag, 2001. 143 p. DOI: https://doi.org/10.1007/3-540-44592-7.
  3. Malchin C., Daduna H. Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model. Queueing Systems, 2010, vol. 65, no. 4, pp. 385–421. DOI: https://doi.org/10.1007/s11134-010-9181-2.
  4. Woodward M. E. Towards the accurate modelling of high-speed communication networks with product-form discrete-time networks of queues. Computer Communications, 1998, vol. 21, pp. 1530–1543. DOI: https://doi.org/10.1016/S0140-3664(98)00220-5.
  5. Mitra D., McKenna J. Asymptotic expansions for closed Markovian networks with statedependent service rates. Journal of ACM, 1986, vol. 33, no. 3, pp. 568–592. DOI: https://doi.org/10.1145/5925.5935.
  6. Weber R. R., Stidham S. Optimal control of service rates in networks of queues. Advances in Applied Probability, 1987, vol. 19, pp. 202–218. DOI: https://doi.org/10.1017/S0001867800016451.
  7. Mitrophanov Yu. I. Analysis of queueing networks with controlled service rate. Automatic Control and Computer Sciences, 2005, vol. 39, no. 6, pp. 18–26.
  8. Mitrophanov Yu. I., Dolgov V. I. Dynamic control of service rates in queuing networks. Automatic Control and Computer Sciences, 2008, vol. 42, no. 6, pp. 311–319. DOI: https://doi.org/10.3103/S0146411608060060.
  9. Azaron A., Ghomi S. M. Optimal control of the service rates and arrivals in Jackson networks. European Journal of Operational Research, 2003, vol. 147, no. 1, pp. 17–31. DOI: https://doi.org/10.1016/S0377-2217(02)00177-7.
  10. Xia L. Service rate control of closed Jackson networks from game theoretic perspective. European Journal of Operational Research, 2014, vol. 237, no. 2, pp. 546–554. DOI: https://doi.org/10.1016/j.ejor.2014.01.038.
  11. Mitrofanov Yu. I., Rogachko E. S., Stankevich E. P. Analysis of queueing networks with batch movements of customers and control of flows among clusters. Automatic Control and Computer Sciences, 2015, vol. 49, no. 4, pp. 221–230. DOI: https://doi.org/10.3103/S0146411615040094.
  12. Tananko I. E., Fokina N. P. Analysis of closed unreliable queueing networks with batch movements of customers. Izv. Saratov Univ. (N. S.), Ser. Math. Mech. Inform., 2013, vol. 13, iss. 2, pt. 1, pp. 111–117 (in Russian).
  13. Henderson W., Taylor P. G. Product form in networks of queues with batch arrivals and batch services. Queueing Systems, 1990, vol. 6, pp. 71–88. DOI: https://doi.org/10.1007/BF02411466.
  14. Serfozo R. F. Queueing networks with dependent nodes and concurrent movements. Queueing Systems, 1993, vol. 13, pp. 143–182. DOI: https://doi.org/10.1007/BF01158932.
  15. Miyazawa M. On the characterization of departure rules for discrete-time queueing networks with batch movements and its applications. Queueing Systems, 1994, vol. 18, pp. 149–166. DOI: https://doi.org/10.1007/BF01158779.
  16. Mitrophanov Yu. I., Rogachko E. S., Stankevich E. P. Analysis of heterogeneous queueing networks with batch movements of customers. Izv. Saratov Univ. (N. S.), Ser. Math. Mech. Inform., 2011, vol. 11, iss. 3, pt. 1, pp. 41–46 (in Russian).
  17. Dolgov V. I. Issledovanie zamknutykh setei massovogo obsluzhivaniia s diskretnym vremenem, gruppovymi perekhodami trebovanii i upravleniem intensivnostiami obsluzhivaniia metodom imitatsionnogo modelirovaniia [Investigation by simulation of closed queueing networks with discrete time, batch movements of customers and control of service rates]. Komp’iuternye nauki i informatsionnye tekhnologii : materialy Mezhdunar. nauch. konf. [Computer Science and Information Technologies : Proc. Intern. Sci. Conf.]. Saratov, Publ. Center “Nauka”, 2016, pp. 145–148 (in Russian).