ANALYSIS OF THE QUEUEING SYSTEMS AT JUMPING VARIABLE INFORMATION FLOW INTENSITY
DOI:
https://doi.org/10.32782/KNTU2618-0340/2021.4.2.1.7Keywords:
transient mode, fundamental matrix, the probabilities of the states, switch, jumps of the trafficAbstract
This paper presents an analytical approach to the analysis of a multi-channel queuing system with losses without buffering, both for transient and stationary modes. It is considered the M|M|2 system as an example. Such a system is described as a three-state birth-and-death process. For this system the system of Kolmogorov equations is compiled and the fundamental matrix of the Kolmogorov equation system is found for two cases. In the first case arrival and service rates are constant and in the second case the ones change abruptly at some moments of time. Numerical calculations are carried out on the example of the model of the data transmission network switch connected to another network switch via two Ethernet channels. The throughput of each channel is 100 Mbps. The transient mode of the system is analyzed for three cases. In the first case, the arrival rate is lower than the service rate; in the second case, the arrival rate of packets is equal to their service rate, and in the third case, the arrival rate is greater than the device service rate. For each case, the probabilities of the system states are found, including the probabilities of packet loss and the transient time. It is shown that with an increase in the intensity of the input traffic, the transient time decreases, and the probability of packet loss increases. So, with an increase in the arrival rate up to 10 times, the probability of packet loss is 82%, and the transient time is 0.0001 s, which is 6 times less than the transient time under normal network operation when the intensity of incoming flows λ is less than the service intensity μ. The probabilities of the system states after jumps of the intensity of the input traffic are calculated. The cases of one and two jumps are considered. Under the influence of the first jump, when the arrival rate increases sharply from
References
Alfa A.S.. Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System (1st. ed.). Springer Publishing Company, Incorporated, XIV, 2010, 238 p.
Lakatos L., Szeidl L., Telek M.. Introduction to Queueing Systems with Telecommunication Applications. Springer International Publishing, 2019. 559 p.
Harrison P. G. Transient Behaviour of Queueing Networks. Journal of Applied Probability. 1981. V. 18. № 2. P. 482–490.
Krishnamoorthy A., Sreenivasan C. An M/M/2 Queueing System with Heterogeneous Servers Including One with Working Vacation. International Journal of Stochastic Analysis. 2012, 16 p. https://doi.org/10.1155/2012/145867.
Kumar B.K., Pavai M.S. Transient Analysis of an M/M/1 Queue Subject to Catastrophes and Server Failures. Stochastic Analysis and Applications. 2005. 23. P. 329–340.
Kumar B.K., Arivudainambi D. Transient Solution of an M/M/1 Queue with Catastrophes. Computers & mathematics with applications. 2000. 40. P. 1233–1240.
Amin S. A., Venkatesan D. SPC Techniques Using M/M/2 Queuing Model. Science, Technology and Development. 2019. 8. P. 517–525.
Gerardo R.. Transient analysis of Markovian queueing systems: a survey with focus on closedforms and uniformization. Vladimir Anisimov and Nikolaos Limnios. Advanced Trends in Queueing Theory. 2020. P.1–35..
Гантмахер Ф.Р. Теория матриц. Москва: ФизМатЛит, 2010. 560 с.