Quality Assurance of Data Transmission in Queuing Networks
L. A. Komarova1, V. G. Saiko2, V. S. Nakonechnyi3, S. V. Toliupa4, R. V. Ziubina5

1L. A. Komarova*, Department of Telecommunications Odessa National A. S. Popov Academy of Telecommunications, Odessa, Ukraine.
2V. G. Saiko, Department of Applied Information Systems, Taras Shevchenko National University of Kyiv, Ukraine.
3V. S. Nakonechnyi, Protection Department, Taras Shevchenko National University of Kyiv, Ukraine.
4S. V. Toliupa, Protection Department, Taras Shevchenko National University of Kyiv, Ukraine.
5R. V. Ziubina, Department of Cyber Security and Information Protection, Taras Shevchenko National University of Kyiv, Ukraine.
Manuscript received on November 20, 2019. | Revised Manuscript received on December 15, 2019. | Manuscript published on December 30, 2019. | PP: 4019-4024  | Volume-9 Issue-2, December, 2019. | Retrieval Number: B4667129219/2019©BEIESP | DOI: 10.35940/ijeat.B4667.129219
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: With the development of high-speed communication networks, the so-called property of self-similarity of flows has an increasing impact on the quality of service. From a practical point of view, this can be explained by the high variability of traffic intensity and, as a consequence, the high receipt of packets to the network node at a high data rate, which leads, due to the limitation of the buffer, to packet losses. For a long time, it was believed that the traffic of the local network is described by the classical Poisson distribution. Telephone networks were originally built on the principle of channel switching, and computer networks are usually based on the principle of packet switching, but the calculation methods have remained virtually the same. Packets at high speed of their movement on a network arrive on a node not separately, and the whole pack. Traffic in such networks has ripples, which increases the likelihood of congestion in the network nodes, which lead to buffer overflows and cause losses and / or delays. Pulsations lead to differences in the speed of information flows, in which the ratio of the maximum value to the minimum speed is tens of times. At the same time, it turned out that in multiservice networks, the number of events in a given time interval depends on previous, very distant events. This means that at large scales of a multiservice network, traffic has the property of self-similarity, i.e. it looks qualitatively the same at any sufficiently large scales of the time axis.
Keywords: Informatization, Traffic parameters, Communication networks, Packet-switched networks, Third-video in real time.