Geodesic
Dynamic load allocation in closed queueing networks with batch movements
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 12 (2012) no. 1, pp. 22-28 
Yu. I. Mitrophanov; E. S. Rogachko; E. P. Stankevich. Dynamic load allocation in closed queueing networks with batch movements. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 12 (2012) no. 1, pp. 22-28. http://geodesic.mathdoc.fr/item/ISU_2012_12_1_a3/
@article{ISU_2012_12_1_a3,
     author = {Yu. I. Mitrophanov and E. S. Rogachko and E. P. Stankevich},
     title = {Dynamic load allocation in closed queueing networks with batch movements},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {22--28},
     year = {2012},
     volume = {12},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2012_12_1_a3/}
}
TY  - JOUR
AU  - Yu. I. Mitrophanov
AU  - E. S. Rogachko
AU  - E. P. Stankevich
TI  - Dynamic load allocation in closed queueing networks with batch movements
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2012
SP  - 22
EP  - 28
VL  - 12
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/ISU_2012_12_1_a3/
LA  - ru
ID  - ISU_2012_12_1_a3
ER  - 
%0 Journal Article
%A Yu. I. Mitrophanov
%A E. S. Rogachko
%A E. P. Stankevich
%T Dynamic load allocation in closed queueing networks with batch movements
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2012
%P 22-28
%V 12
%N 1
%U http://geodesic.mathdoc.fr/item/ISU_2012_12_1_a3/
%G ru
%F ISU_2012_12_1_a3

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

A method of load allocation control in closed queueing networks with batch movements is proposed. When this method is used in queueing networks of considered type, close to given customer allocation among queueing systems is provided. The control is realized by use of different routing matrices during fixed time intervals in process of network operation. Models of evolution and an approximate method of computing a stationary distribution and other stationary characteristics of considered type queueing networks are presented.

[1] Bovopoulos A. D., Lazar A. A., “Optimal load balancing for Markovian queueing networks”, Proc. 30th Midwest Symp. Circ. and Syst., Syracuse, N.Y., 1987, 1428–1432

[2] Alanyali M., Hajek B., “Analysis of simple algorithms for dynamic load balancing”, Math. Oper. Res., 22:4 (1997), 840–871 | DOI | MR | Zbl

[3] Bonald T., Jonckheere M., Proutiere A., “Insensitive load balancing”, Proc. of ACM Sigmetrics/Performance, N.Y., 2004, 6367–6378

[4] Down D. G., Lewis M. E., “Dynamic load balancing in parallel queueing systems: stability and optimal control”, Eur. J. Oper. Res., 168:2 (2006), 509–519 | DOI | MR | Zbl

[5] Henderson W., Pearce C. E. M., Taylor P. G., Dijk N. M., “Closed queueing networks with batch services”, Queueing Systems, 6 (1990), 59–70 | DOI | MR | Zbl

[6] Henderson W., Taylor P. G., “Product form in networks of queues with batch arrivals and batch services”, Queueing Systems, 6 (1990), 71–88 | DOI | MR

[7] Boucherie R. J., Dijk N. M., “Product forms for queueing networks with state-dependent multiple job transitions”, Adv. Appl. Prob., 23:1 (1991), 152–187 | DOI | MR | Zbl

[8] Serfozo R. F., “Queueing networks with dependent nodes and concurrent movements”, Queueing Systems, 13 (1993), 143–182 | DOI | MR | Zbl

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

[10] Coyle A. J., Henderson W., Pearce C. E. M., Taylor P. G., “A general formulation for mean-value analysis in product-form batch-movement queueing networks”, Queueing Systems, 16 (1994), 363–372 | DOI | MR | Zbl

[11] Bause F., Boucherie R. J., Buchholz P., “Norton's theorem for batch routing queueing networks”, Stochastic Models, 17 (2001), 39–60 | DOI | MR | Zbl

[12] Mitrofanov Yu. I., Rogachko E. S., “Modeli i analiz setei massovogo obsluzhivaniya s dinamicheskim upravleniem raspredeleniem nagruzki”, Avtomatika i vychislitelnaya tekhnika, 2006, no. 5, 69–77

[13] Mitrofanov Yu. I., Fokina N. P., “Analiz setei massovogo obsluzhivaniya s dinamicheskim upravleniem marshrutizatsiei”, Izv. Sarat. un-ta. Nov. ser. Ser. Matematika. Mekhanika. Informatika, 7:1 (2007), 27–33

[14] Mitrofanov Yu. I., Rogachko E. S., “Upravlenie raspredeleniem nagruzki v setyakh massovogo obsluzhivaniya”, Avtomatika i telemekhanika, 2008, no. 9, 94–102 | MR | Zbl