Geodesic
An analysis of queueing networks with dynamic routing control
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 7 (2007) no. 1, pp. 27-33 
Yu. I. Mitrophanov; N. P. Fokina. An analysis of queueing networks with dynamic routing control. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 7 (2007) no. 1, pp. 27-33. http://geodesic.mathdoc.fr/item/ISU_2007_7_1_a5/
@article{ISU_2007_7_1_a5,
     author = {Yu. I. Mitrophanov and N. P. Fokina},
     title = {An analysis of queueing networks with dynamic routing control},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {27--33},
     year = {2007},
     volume = {7},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2007_7_1_a5/}
}
TY  - JOUR
AU  - Yu. I. Mitrophanov
AU  - N. P. Fokina
TI  - An analysis of queueing networks with dynamic routing control
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2007
SP  - 27
EP  - 33
VL  - 7
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/ISU_2007_7_1_a5/
LA  - ru
ID  - ISU_2007_7_1_a5
ER  - 
%0 Journal Article
%A Yu. I. Mitrophanov
%A N. P. Fokina
%T An analysis of queueing networks with dynamic routing control
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2007
%P 27-33
%V 7
%N 1
%U http://geodesic.mathdoc.fr/item/ISU_2007_7_1_a5/
%G ru
%F ISU_2007_7_1_a5

Voir la notice de l'article provenant de la source Math-Net.Ru

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.

[1] Mitrofanov Yu. I., Reshetnikova N. P., Metody analiza setei massovogo obsluzhivaniya s upravleniem marshrutizatsiei, Dep. v VINITI, No 973–B2002, Saratov, 2002, 55 pp.

[2] Serfozo R. F., “Markovian network processes: congestion-dependent routing and processing”, Queueing Systems, 1989, no. 5, 5–36 | DOI | MR | Zbl

[3] Mitrofanov Yu. I., Yudaeva N. V., “Modeli i analiz setei massovogo obsluzhivaniya s upravleniem marshrutizatsiei”, AiT, 2000, no. 6, 104–113 | MR | Zbl

[4] Mitrofanov Yu. I., “Metod upravleniya marshrutizatsiei v zamknutykh setyakh massovogo obsluzhivaniya”, TiSU, 2002, no. 6, 86–92

[5] Rumsewicz M., Henderson W., “Insensitivity with age-dependent routing”, Adv. Appl. Prob., 21:2 (1984), 398–408 | DOI | MR

[6] Miyazawa M., “Structure-reversibility and departure functions of queueing networks with batch movements and state dependent routing”, Queueing Networks, 25 (1997), 45–75 | DOI | MR | Zbl

[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, 313–324 | MR

[8] Towsley D., “Queuing network models with state-dependent routing”, J. of ACM, 27:2 (1980), 323–337 | DOI | MR | Zbl

[9] Krzesinski A. E., “Multiclass queueing networks with state-dependent routing”, Performance Evaluations, 7:2 (1987), 125–143 | DOI | MR | Zbl

[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., 22 (1975), 248–260 | DOI | MR | Zbl

[11] Lipskii V., Kombinatorika dlya programmistov, Mir, M., 1988