Извините, этот техт доступен только в “Американский Английский”. For the sake of viewer convenience, the content is shown below in the alternative language. You may click the link to switch the active language.
ON ESTIMATES OF THE AVERAGE QUEUE LENGTH FOR MASS SERVICE SYSTEMS IN CASE OF CORRELATED INPUT FLOW
DOI: 10.36724/2072-8735-2020-14-8-13-20
Boris Ya. Lichtzinder, Volga State University of Telecommunications and Informatics, Samara, Russia, lixt@psuti.ru
Igor A. Blatov, Volga State University of Telecommunications and Informatics, Samara, Russia, blatow@mail.ru
Elena V. Kitaeva, Samara National Research University named after Academician S.P. Korolev, Samara, Russia, el_kitaeva@mail.ru
Abstract
In multiservice packet-switched networks, the packet flow differs significantly from the Poisson flow, since these flows are generated by many sources of requests for services that are significantly different from each other. All this leads to the fact that the flows in multiservice networks are characterized by uneven arrival of requests and packets. Packages are grouped into «bundles» at some time intervals and are practically absent at other intervals. The random process of claims (packets) entering the system is characterized by a distribution law that establishes a relationship between the values ??of a random variable and the probabilities of occurrence of the indicated values. In most cases, such a flow is characterized by a distribution function of time intervals between neighboring claims, and the process of their processing is characterized by a probability distribution function of service time intervals. The mathematical model of the simplest single-channel queuing systems (QS) in case of incoming flow with arbitrary correlation. For this QS, various generalizations of the Khinchin-Pollachek formula of the average queue length. An interval model of the incoming flow is proposed, within which an expression of the average queue length through unconditional moments is obtained second order. All results were obtained with very general assumptions of ergodicity and stationarity. Are given results of numerical experiments confirming theoretical conclusions.
Keywords: queuing system, correlated input stream, average queue length, Khinchin-Pollachek formula.
References
1. Leland W. E., Taqqu Murad S., Willinger W., Wilson D.V. (1994). On the Self-Similar Natureof Ethernet Traffic. J. IEEE/ACM Transact. Networking, 2:1. P. 1-15.
2. Neuts M.F. (1979). Versatile Markovian point process. J. Appl. Probab., 16:4. P. 764-779.
3. Ramaswami V. (1980). The N/G/1 queue and its detailed analysis. Advances Appl. Probab., 12:1. P. 222-261.
4. Jagerman D.L., Balcioglu B., Altiok T., Melamed B. (2004). Mean Waiting Time Approximations in the G/G/1 Queue. Queueing Systems. Vol. 46. P. 481-506.
5. Balcioglu B., Jagerman D.L., Altiok T. (2007). Approximate mean waiting time in a GI/D/1 queue with autocorrelated time to failures. IEEE Transactions, 39 10. P. 985-996.
6. Kartashevsky I.V., Saprykin A.V. (2017). Processing of correlated traffic in a network node of type G / G / 1. Radiotekhnika. No. 10. P. 119-125.
7. Kartashevsky I.V. (2016). Traffic model for software-defined networks. Radio engineering. No. 6. P. 124-129.
8. Tsybakov B.S. (1999). Teletraffic model based on a self-similar random process. Radiotekhnika. No. 5. P. 24-31.
9. Shelukhin O.I., Tenyakshev A.M., Osin A.V. (2003). Fractal processes in telecommunications / Ed. O.I. Shelukhin. Moscow: Radiotekhnika.
10. Likhttsinder B.Ya. (2015). Correlation links in burst streams of queuing systems. Telecommunications. No. 9. P. 8-12.
11. Likhttsinder B.Ya. (2015). Correlation properties of queue lengths in queuing systems with general flows. Infocommunication technologies. Vol.13. No. 3. P 276-280.
12. Blatov I.A., Likhttsinder B.Ya. (2018). On the estimation of the lengths of queues in the QS with arbitrary correlation. Information technology and nanotechnology Proceedings of ITNT-2018, Samara National Research University named after academician S.P. Queen. P. 1607-1616.
13. Likhtzinder B.Ya. (2007). On some generalizations of the Khinchin-Pollyachek formula. Infocommunication technologies. Vol.5. No. 4. P. 253-258.
14. Vishnevskii V.M., Dudin A.N. (2017). Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks. Autom. Remote Control, 78:8. P. 1361-1403.
15. Shul’ga Yu.N. (1989). Extension of the Polaczek — Khinchin formula to 3d stochastic networks. Autom. Remote Control. 50:3. P. 355-365.
16. Jain G., Sigman K. (1996). A Pollaczeek-Khinchine formula for M/G/1 queues with disasters. J. Appl. Prob. Vol. 33. P. 1191-1200.
17. Likhttsinder B.Ya. (2015). Interval method of analysis of multiservice traffic of access networks. Electrosvyaz. No. 12. P. 52-54.
18. Likhttsinder B.Ya. (2018). Traffic of multiservice access networks (interval analysis and design). Moscow: Hotline – Telecom.
19. Ventzel ES, Operations Research. Tasks, principles, methodology, Moscow: Nauka, 1988.
20. Likhttsinder B.Ya. (2015). Interval method for traffic analysis of multiservice access networks, Samara PSUTI.
21. Kleinrock L. (1979). Queuing Theory. Moscow: Mechanical Engineering.
Information about authors:
Boris Ya. Lichtzinder, Dr. Tech. sciences, Volga State University of Telecommunications and Informatics, Samara, Russia
Igor A. Blatov, Doctor of Phys.-Math. Sciences, Volga State University of Telecommunications and Informatics, Samara, Russia
Elena V. Kitaeva, set physical-mat. Sciences, Samara National Research University named after Academician S.P. Korolev, Samara, Russia