Closed Gordon – Newell network with single-line poles and exponentially limited request waiting time
https://doi.org/10.37661/1816-0301-2023-20-4-48-55
Abstract
Objectives. An exponential queuing network with single-line poles is considered, which differs from the Gordon – Newell network only that the waiting time for service requests at the poles of the network is a random variable with conditional distribution for a fixed number of requests at the pole as an exponential distribution. Requests at poles and requests that did not get the service are moving through the network in accordance with different routing matrices. The objective was to investigate a queuing system and to establish sufficient conditions for its ergodicity, also to find stationary distribution of given network.
Methods. Methods of mathematical modeling and analytical research of queuing networks are used.
Results. A theorem generalizing the Gordon – Newell theorem is proved.
Conclusion. The possibility of varying the routing matrices of served and unserved requests makes it possible to take into account a wide variety of practical situations and reduce the load in the bottlenecks of the network under study. It is very important in the design and modernization of information and computer networks.
About the Authors
Yu. V. Malinkovsky
Francisk Skorina Gomel State University
Belarus
Belarus
Yuri V. Malinkovsky, Prof., D. Sc. (Phys.-Math.), Prof. of the Department of Fundamental and Applied Mathematics
st. Kirova, 119, Gomel, 246019
V. A. Nemilostivaya
Francisk Skorina Gomel State University
Belarus
Belarus
Violetta A. Nemilostivaya, Assistant at the Department of Fundamental and Applied Mathematics
st. Kirova, 119, Gomel, 246019
References
1. Malinkovskii Yu. V. Queueing network with customer bypass. Avtomatika i telemehanika [Automation and Remote Control], 1991, no. 2, pp. 102–110 (In Russ.).
2. Kopats D. Ya., Matalytski M. A. Analysis in non-stationary regime of exponential G-network with bypass of queueing systems positive customers. Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika [Tomsk State University Journal of Control and Computer Science], 2020, no. 52. pp. 66–72 (In Russ.)
3. Malinkovskii Yu. V. Queueing network with symmetrical backup channels. Izvestija Akademii nauk Sojuza Sovetskih Socialisticheskih Respublik. Tehnicheskaja kibernetika [News of the Academy of Sciences of the Union of Soviet Socialist Republics. Technical Cybernetics], 1986, no. 4, pp. 69–77 (In Russ.).
4. Kovalev E. A., Malinkovskii Yu. V. Queuing networks with backup devices. Avtomatika i vychislitel'naja tehnika [Automatic Control and Computer Sciences], 1987, no. 2, pp. 64–70 (In Russ.).
5. Samochernova L. I. Optimization of a queuing system with a backup device with control depending on the waiting time. Izvestija Tomskogo politekhnicheskogo universiteta [News of Tomsk Polytechnic University], 2010, vol. 316, no. 5, pp. 94–97 (In Russ.).
6. Kovalev E. A. Queuing networks with limited waiting time in queues. Avtomatika i vychislitel'naja tehnika [Automatic Control and Computer Sciences], 1985, no. 2, pp. 50–55 (In Russ.).
7. Malinkovskii Yu. V. Jackson networks with single-line nodes and limited sojourn or waiting times. Automation and Remote Control, 2015, vol. 76, no. 4. pp. 67–79.
8. Malinkovskii Yu. V. Stationary probability distribution for states of G-networks with constrained sojourn waiting time. Automation and Remote Control, 2017, vol. 564, no. 4, pp. 155–167.
9. Gordon W. J., Newell G. F. Closed queueing systems with exponential servers. Operations Research, 1967, vol. 15, no. 2, pp. 254–265.
10. Boyarovich Yu. S. Stationary distribution of the closed queuing network with batch transitions of customers. Automation and Remote Control, 2009, vol. 70, no. 11, pp. 1836–1842.
Review
For citations:
Malinkovsky Yu.V., Nemilostivaya V.A. Closed Gordon – Newell network with single-line poles and exponentially limited request waiting time. Informatics. 2023;20(4):48-55. (In Russ.) https://doi.org/10.37661/1816-0301-2023-20-4-48-55
Views: 214
Email this article 