Our website uses cookies. By continuing to use this site, you agree to our use of cookies in accordance with this notice and the Terms of Use.
Submit manuscript
Herald of Technological University
Journals / Herald of Technological University / Volume 29 Issue 8 / MODELING OF A POLLING SYSTEM WITH VARIABLE FLOW INTENSITY

MODELING OF A POLLING SYSTEM WITH VARIABLE FLOW INTENSITY

Published in Herald of Technological University · Volume 29, Issue 8, 2026 · Pages 92–97 · Rubric: 3. Information teory, computer technology and control
DOI: https://doi.org/10.55421/3034-4689_2026_29_8_92 · EDN: TWQKVZ
Received: 16.07.2026 Accepted: 16.08.2026 Published: 28.08.2026
Authors
DI
Dinar T. Churekeev
N
N K Nuriev
ABSTRACT
This paper addresses the problem of simulation modeling of a stochastic polling system with a non-stationary (time-varying) arrival process. Polling systems, also known as ordered-service systems, constitute a special subclass of multi-queue queueing systems and are widely applied in telecommunications, transportation, manufacturing, inventory management, and traffic control systems. Analytical investigation of such systems becomes considerably difficult for complex configurations, which underscores the relevance of employing simulation-based approaches. A simulation model has been developed in the AnyLogic environment, incorporating three queues with distinct input flow characteristics: a heterogeneous flow following a Weibull distribution, a flow governed by an intensity schedule with daily periodicity, and a non-ordinary flow with a uniform distribution and batch arrivals. Service is provided by a single server operating under a cyclic polling order with an exhaustive discipline, whereby the server processes each queue until it is completely emptied. The service intensity is defined by a triangular distribution as a non-homogeneous Poisson process that varies over time. A comparative analysis is conducted between two models - one with variable and the other with constant service intensity. The simulation results obtained over a 700-hour period demonstrate that the model with variable intensity exhibits more stable operation: the average utilization factor is 0.81 compared to 0.88 under constant intensity, while peak loads are smoothed more effectively and the risk of queue overflow is reduced. The queue with the intensity-scheduled flow has been identified as the most heavily loaded and thus the bottleneck of the system. It is established that variable service intensity adapts more effectively to daily load cycles and provides a greater safety margin for unexpected surges in demand.
KEYWORDS
MODELING, VARIABLE FLOW, POLLING SYSTEM, ANILOGIC
Text References
Text
Text (PDF)
Read Download

1. V.M. Vishnevsky, O.V. Semenova, *Problems of Informatics*, 3, 29–59 (2020) DOI:https://doi.org/10.24411/2073-0667-2020-10011.

2. D.V. Lakontsev, O.V. Semenova, S.A. Shpilev, III International Conference on Control Problems (Moscow, June 20–22, 2006). Institute of Problems of Control, Russian Academy of Sciences, Moscow, 2006. Vol. 2. p. 145.

3. V.M. Vishnevsky, O.V. Semenova, Automation and Telemechanics, 2, 3–56 (2006) DOI:https://doi.org/10.1134/S0005117906020019.

4. S.C. Borst, Polling Systems. Centrum voor Wiskunde en Informatica, Amsterdam, 1996.

5. H. Takagi, Analysis of Polling Systems. MIT Press, Cambridge, 1986.

6. V.H. Nguyen, Proceedings of the Moscow Institute of Physics and Technology, 16, 1, 34–43 (2024). EDN: https://elibrary.ru/HAKDLA.

7. F.A. Murshed, N.K. Nuriev, Bulletin of the Technological University, 20, 13, 107–109 (2017).

8. D.J. Daley, D. Vere-Jones, An Introduction to the Theory of Point Processes. Vol. I: Elementary Theory and Methods. Springer, New York, 2003. 472 pp.

9. S.M. Ross, Introduction to Probability Models. Academic Press, Amsterdam, 2019. 826 pp. DOI: https://doi.org/10.1016/B978-0-12-814346-9.00006-8

10. B.V. Gnedenko, I.N. Kovalenko, Introduction to Queueing Theory. URSS, Moscow, 2005. 280 pp.

11. Ilya Grigoriev, AnyLogic 8 in Three Days. 2024. 268 pp.

12. N.E. Kuvshinov, Theory and Practice of Modern Science, 4 (22) (2017).

13. L. Breuer, Int. J. Simul., 3, 3–4, 15–24 (2002).

14. A. Dudin, O. Dudina, in *Distributed Computer and Communication Networks: DCCN 2024, revised selected papers*. Springer, Cham, 2025 (Lecture Notes in Computer Science, vol. 15460) . pp. 129–143. DOI:https://doi.org/10.1007/978-3-031-80853-1_11.

15. M.A. Pleskunov, Theory of Queuing. Ural University Press, Yekaterinburg, 2022. 264 pp.

PDF JATS XML
The contact persons
Head of the Publishing house
Raziya Romanova
romanova_rg@mail.ru
Deputy Editor-in-Chief
Aleksandr Dresvyannikov
a.dresvyannikov@mail.ru
Executive Secretary
Svetlana Goryunova
svetlanagoryunova@yandex.ru
Editor-in-Chief
Yurij Kazakov
office@kstu.ru
Deputy Editor-in-Chief
Oleg Mickailov
olegmkhlv@gmail.com
84
downloads
Crossref RINC RINC Science Index
© vestniktu.ru
Agreement Personal data protection and processing policy Powered by Editorum, 2026
Login or Create
* Forgot your password?