Cite this article as:

Mitrophanov Y. I., Fokina N. P. An Analysis of Queueing Networks with Dynamic Routing Control. Izv. Saratov Univ. (N. S.), Ser. Math. Mech. Inform., 2007, vol. 7, iss. 1, pp. 27-33. DOI: https://doi.org/10.18500/1816-9791-2007-7-1-27-33

Language: 
Russian
Heading: 
Mathematics
UDC: 
519.872

An Analysis of Queueing Networks with Dynamic Routing Control

Authors: 
Mitrophanov Yurii Ivanovich, Saratov State University 1, Saratov State University, Russia, 410012, Saratov, Astrahanskaya st., 83 , MitrophanovYuI@info.sgu.ru
Fokina Nadezhda Petrovna, Saratov State University 1, Saratov State University, Russia, 410012, Saratov, Astrahanskaya st., 83 , FokinaNP.sgu@gmail.com
Abstract: 

A method for analysis of closed exponential queueing networks with one class of customers and central dynamic routing control is proposed. The method of control is based on a use of different routing matrices during fixed time intervals in the network operation process. The method for analysis is based on a description of the network operation process with model Markov chains. An example of analysis of this type network is given.

Key words: 
analysis of queueing networks.
DOI: 
https://doi.org/10.18500/1816-9791-2007-7-1-27-33
References

1. Митрофанов Ю.И., Решетникова Н.П. Методы анализа сетей массового обслуживания с управлением маршрутизацией. Саратов, 2002. Деп. в ВИНИТИ, № 973–B2002. 55 с.

2. Serfozo R.F. Markovian network processes: congestion-dependent routing and processing // Queueing Systems. 1989. № 5. P. 5–36.

3. Митрофанов Ю.И., Юдаева Н.В. Модели и анализ сетей массового обслуживания с управлением маршрутизацией // АиТ. 2000. № 6. С. 104–113.

4. Митрофанов Ю.И. Метод управления маршрутизацией в замкнутых сетях массового обслуживания // ТиСУ. 2002. № 6. С. 86–92.

5. Rumsewicz M., Henderson W. Insensitivity with agedependent routing // Adv. Appl. Prob. 1984. V. 21, № 2. P. 398–408.

6. Miyazawa M. Structure-reversibility and departure functions of queueing networks with batch movements and state dependent routing // Queueing Networks. 1997. № 25. P. 45–75.

7. Daskalaki S., Smith J.M. Real–time routing in finite queueing networks // Queueing Network Blocking: Proc. 1-st Int. Workshop, Raleigh, N.C., 1988. P. 313–324.

8. Towsley D. Queuing network models with statedependent routing // J. of ACM. 1980. V. 27, № 2. P. 323–337.

9. Krzesinski A.E. Multiclass queueing networks with state-dependent routing // Performance Evaluations. 1987. V. 7. № 2. P. 125–143.

10. Baskett F., Chandy K.M., Muntz R.R., Palacios F.G. Open, closed, and mixed networks of queues with different classes of customers // J. Assoc. Comput. Mach. 1975. V. 22. P. 248–260.

11. Липский В. Комбинаторика для программистов. М.: Мир, 1988. 

Full text:
download
62