POWER FOR PROCESSING APPLICATION FLOWS AND QUEUE SIZES IN MASS SERVICE SYSTEMS
DOI: 10.36724/2072-8735-2020-14-9-10-16
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
Abstract
The classical queuing theory studies time series processing under the assumption of sampling independence. However, the traffic of modern multiservice networks is usually strongly correlated and the methods of classical theory do not work. In this paper, we consider the cyclic process of queuing, conditional and unconditional mutual correlations. Conditional average values of queues are considered. The concept of processing power of the flow of applications in queuing systems (QS) is introduced. It is shown that the variable component of the indicated power is determined by the change in the load factor and corresponds to the conditional average size of the queue of applications in the QS.
Keywords:queuing systems, applications, correlation, power, queues, interval analysis, traffic, telecommunications.
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. Likhttsinder B.Ya. (2015). Correlation links in burst streams of queuing systems. Telecommunications. No. 9. P. 8-12.
9. Likhttsinder B.Ya. (2015). Correlation properties of queue lengths in queuing systems with general flows. Infocommunication technologies. Vol.13. No. 3. P 276-280.
10. 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. P. 1607-1616.
11. Likhttsinder B.Ya. (2015). Interval method of analysis of multiservice traffic of access networks. Electrosvyaz. No. 12. P. 52-54.
12. Likhttsinder B.Ya. (2018). Traffic of multiservice access networks (interval analysis and design). Moscow: Hotline – Telecom. 290 p.
13. Tsybakov B.S. (1999). Teletraffic model based on a self-similar random process. Radiotekhnika. No. 5. P. 24-31.
14. Likhtzinder B.Ya. (2007). On some generalizations of the Khinchin-Pollyachek formula. Infocommunication technologies. Vol.5. No. 4. P. 253-258.[15].
15. Shelukhin O.I., Tenyakshev A.M., Osin A.V. (2003). Fractal processes in telecommunications / Ed. O.I. Shelukhin. Moscow: Radiotekhnika. 480 p.
16. 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.
17. Blatov I.A., Likhttsinder B.Ya. Conditional average value of queues in queuing systems with batch flows of claims. ICT. Vol. 14. No. 4. P. 379-383
18. Kleinrock L. (1979). Queuing Theory. Moscow: Mechanical Engineering. 600 p.
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

