Email this article 
Batch poissonian arrival models of multiservice network traffic
- Authors: Lichtzinder B.Y.1, Privalov A.Y.2, Moiseev V.I3
-
Affiliations:
- Povolzhskiy State University of Telecommunications and Informatics
- Korolyov Samara National Research University
- Perm State National Research University
- Issue: Vol 59, No 1 (2023)
- Pages: 71-79
- Section: Articles
- URL: https://rjmseer.com/0555-2923/article/view/667578
- DOI: https://doi.org/10.31857/S0555292323010060
- EDN: https://elibrary.ru/RMRNDJ
- ID: 667578
Cite item
Open Access
Access granted
Subscription Access
Abstract
The emergence of packet-switched communication networks has made it clear that Poissonian arrival flow models are not quite adequate and required the development of new models based on non-Poisson distributions. This paper is devoted to the analysis of a particular case of a batch Markovian flow, namely, batch (nonordinary) Poissonian arrivals. Such a flow is stationary and memoryless but not ordinary. We consider a class of queueing systems with constant service time. We present results of analytical computations of arrival flow parameters and also simulation results. We show that the variance of the queue depends on the third moment of the batch size in a batch Poissonian arrival flow.
About the authors
B. Ya Lichtzinder
Povolzhskiy State University of Telecommunications and Informatics
Email: lixt@psuti.ru
Samara, Russia
A. Yu Privalov
Korolyov Samara National Research University
Email: privalov1967@gmail.com
Samara, Russia
V. I Moiseev
Perm State National Research University
Email: vim@psu.ru
Perm, Russia
References
- Вишневский В.М., Дудин А.Н. Системы массового обслуживания с коррелированными входными потоками и их применение для моделирования телекоммуникационных сетей // Автомат. и телемех. 2017. № 8. С. 3-59. https://www.mathnet.ru/rus/at14562
- Neuts M.F. A Versatile Markovian Point Process // J. Appl. Probab. 1979. V. 16. № 4. P. 764-779. https://doi.org/10.2307/3213143
- Wamser F., Gasas P., Seufert M., Moldovan C., Tran-Gia P., Hossfeld T. Modeling the YouTube Stack: From Packets to Quality of Experience // Comput.Networks. 2016. V. 109. Part 2. P. 211-224. https://doi.org/10.1016/j.comnet.2016.03.020
- Appenzeller G., Keslassy I., McKeown N. Sizing Router Buffers // Proc. 2004 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM'04). Portland, USA. Aug. 30 - Sept. 3, 2004. P. 281-292. https://doi.org/0.1145/1015467.1015499
- Lee J.-B., Kalva H. The VC-1 and H.264 Video Compression Standards for Broadband Video Services. New York: Springer, 2008. https://doi.org/10.1007/978-0-387-71043-3
- Li Z., Zhu X., Gahm J., Pan R., Hu H., Begen A.C., Oran D. Probe and Adapt: Rate Adaptation for HTTP Video Streaming at Scale // IEEE J. Select. Areas Commun. 2014. V. 32. № 4. P. 719-733. https://doi.org/10.1109/JSAC.2014.140405
- Назаров А.А., Лопухова С.В. Полумарковские процессы и специальные потоки одно родных событий. Томск: ИДО ТГУ, 2010. Электронная библиотека (репозиторий) ТГУ: http://vital.lib.tsu.ru/vital/access/manager/Repository/vtls:000405029 (дата обращения 26.10.2022)
- Лихтциндер Б.Я. Трафик мультисервисных сетей доступа (интервальный анализ и проектирование). М.: Науч.-тех. изд-во "Горячая линия - Телеком", 2019
- Клейнрок Л. Теория массового обслуживания. М.: Машиностроение, 1979
Supplementary files
