Geodesic
Analysis of closed queueing networks with batch service
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 20 (2020) no. 4, pp. 527-533.

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

We consider a closed queuing network with batch service and movements of customers in continuous time. Each node in the queueing network is an infinite capacity single server queueing system under a RANDOM discipline. Customers move among the nodes following a routing matrix. Customers are served in batches of a fixed size. If a number of customers in a node is less than the size, the server of the system is idle until the required number of customers arrive at the node. An arriving at a node customer is placed in the queue if the server is busy. The batсh service time is exponentially distributed. After a batсh finishes its execution at a node, each customer of the batch, regardless of other customers of the batch, immediately moves to another node in accordance with the routing probability. This article presents an analysis of the queueing network using a Markov chain with continuous time. The qenerator matrix is constructed for the underlying Markov chain. We obtain expressions for the performance measures. Some numerical examples are provided. The results can be used for the performance analysis manufacturing systems, passenger and freight transport systems, as well as information and computing systems with parallel processing and transmission of information. 
@article{ISU_2020_20_4_a10,
     author = {E. P. Stankevich and I. E. Tananko and V. I. Dolgov},
     title = {Analysis of closed queueing networks with batch service},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {527--533},
     publisher = {mathdoc},
     volume = {20},
     number = {4},
     year = {2020},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ISU_2020_20_4_a10/}
}
TY  - JOUR
AU  - E. P. Stankevich
AU  - I. E. Tananko
AU  - V. I. Dolgov
TI  - Analysis of closed queueing networks with batch service
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2020
SP  - 527
EP  - 533
VL  - 20
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ISU_2020_20_4_a10/
LA  - en
ID  - ISU_2020_20_4_a10
ER  - 
%0 Journal Article
%A E. P. Stankevich
%A I. E. Tananko
%A V. I. Dolgov
%T Analysis of closed queueing networks with batch service
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2020
%P 527-533
%V 20
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ISU_2020_20_4_a10/
%G en
%F ISU_2020_20_4_a10
E. P. Stankevich; I. E. Tananko; V. I. Dolgov. Analysis of closed queueing networks with batch service. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 20 (2020) no. 4, pp. 527-533. http://geodesic.mathdoc.fr/item/ISU_2020_20_4_a10/

[1] Basharin G. P., Bocharov P. P., Kogan A. M., Analysis of queues in computer networks. Theory and methods of calculation, Nauka, M., 1989, 336 pp. (in Russian) | MR

[2] Vishnevskii V. M., Theoretical foundations for the design of computer networks, Tekhnosfera, M., 2003, 512 pp. (in Russian)

[3] Mitrophanov Yu. I., Analysis of queueing networks, Nauchnaya kniga, Saratov, 2005, 175 pp. (in Russian)

[4] Chaudhry M. L., Templeton J. G. C., A First Course in Bulk Queues, John Wiley Sons Inc., New York, 1983, 372 pp. | MR | Zbl

[5] Krishnamoorthy A., Ushakumari P., “A Queueing System with Single Arrival Bulk Service and Single Departure”, Mathematical and Computer Modelling, 31:2 (2000), 99–108 | DOI | MR | Zbl

[6] Bountali O., Economou A., “Equilibrium Joining Strategies in Batch Service Queueing Systems”, European Journal of Operational Research, 260:3 (2017), 1142–1151 | DOI | MR | Zbl

[7] Pershakov N. V., Samouylov K. E., “M|G|1 Queues with batch service and its aplication to the stream control trasmission protocol performance analysis. Part I”, Bulletin of Peoples' Friendship. Ser. Maths. Informatics. Physics, 2009, no. 1, 34–44 (in Russian)

[8] Walrand J., “A Discrete-Time Queueing Network”, Journal of Applied Probability, 20:4 (1983), 903–909 | DOI | MR | Zbl

[9] Malchin C., Daduna H., “Discrete Time Queueing Networks with Product Form Steady State. Availability and Performance Analysis in an Integrated Model”, Queueing Systems, 65:4 (2010), 385–421 | DOI | MR | Zbl

[10] Chao X., Pinedo M., Shaw D., “Networks of Queues with Batch Services and Customer Coalescence”, Journal of Applied Probability, 33:3 (1996), 858–869 | DOI | MR | Zbl

[11] Chao X., Zheng S., “Triggered Concurrent Batch Arrivals and Batch Departures in Queueing Networks”, Discrete Event Dynamic Systems: Theory and Applications, 10 (2000), 115–129 | DOI | MR | Zbl

[12] Hanschke Th., Zisgen H., “Queueing Networks with Batch Service”, European Journal Industrial Engineering, 5:3 (2011), 313–326 | DOI

[13] Boucherie R. J., Dijk N. M., “Product Forms for Queueing Networks with State-Dependent Multiple Job Transitions”, Advances in Applied Probability, 23:1 (1991), 152–187 | DOI | MR | Zbl