The general renovation as the active queue management mechanism. Some aspects and results
VCC Hilquias, IS Zaryadov, VV Tsurlukov… - … on Distributed Computer …, 2019 - Springer
This work is devoted to some aspects of using the general renovation (the definition and
brief overview are given) as the active queue management mechanism (like RED (Random …
brief overview are given) as the active queue management mechanism (like RED (Random …
Two types of single-server queueing systems with threshold-based renovation mechanism
VCC Hilquias, IS Zaryadov, TA Milovanova - International Conference on …, 2021 - Springer
This work is devoted to the analysis of two GI/M/1 infinite capacity queuing systems with
threshold control of the renovation mechanism, which is responsible for the probabilistic …
threshold control of the renovation mechanism, which is responsible for the probabilistic …
Finite capacity single-server queue with Poisson input, general service and delayed renovation
M Konovalov, R Razumchik - European Journal of Operational Research, 2023 - Elsevier
This paper is devoted to the performance evaluation of the finite–capacity single-server
queue with Poisson input and general service times, which is equipped with the novel …
queue with Poisson input and general service times, which is equipped with the novel …
[HTML][HTML] Queueing systems with different types of renovation mechanism and thresholds as the mathematical models of active queue management mechanism
VCC Hilquias - Discrete and Continuous Models and Applied …, 2020 - cyberleninka.ru
This article is devoted to some aspects of using the renovation mechanism (different types of
renovation are considered, definitions and brief overview are also given) with one or several …
renovation are considered, definitions and brief overview are also given) with one or several …
Single-server queuing systems with exponential service times and threshold-based renovation
VCC Hilquias, IS Zaryadov - 2021 13th International Congress …, 2021 - ieeexplore.ieee.org
In this paper, we study a single-server queue system GI/M/1 with infinite capacity queue and
with the implementation of threshold-based renovation mechanism. As usual renovation …
with the implementation of threshold-based renovation mechanism. As usual renovation …
Стационарные характеристики обслуживания в системе с обобщенным обновлением
ИС Зарядов, ЛА Мейханаджян… - Системы и средства …, 2019 - mathnet.ru
1 Введение ‚рАботе рАссмАтривАется n-ли− ей− Ая системА мАссового обслуживА− ия
('ŒО) с од− ой очередью− еогрА− иче−− ой емкости, рекурре− т− ым входящим потоком …
('ŒО) с од− ой очередью− еогрА− иче−− ой емкости, рекурре− т− ым входящим потоком …
Стационарные характеристики двухузловой марковской системы массового обслуживания c обобщенным обновлением
ЛА Мейханаджян, ИС Зарядов… - Системы и средства …, 2020 - mathnet.ru
ˆ− терес к 'ŒО с рАзлич− ыми вАриА− тАми мехА− измА об− овле− ия связА− с поте−
циАль− ыми возмож− остями приме− е− ия послед− его в кАчестве АлгоритмА Актив …
циАль− ыми возмож− остями приме− е− ия послед− его в кАчестве АлгоритмА Актив …
Optimal Offloading Percentage for Fresh Status Updates in Mobile Edge Computing Networks
In this paper, we focus on the age of information (AoI) performance of mobile edge
computing (MEC) networks, and investigate the optimal offloading percentage to achieve the …
computing (MEC) networks, and investigate the optimal offloading percentage to achieve the …
Совместное стационарное распределение в системе 𝐺𝐼/𝑀/𝑛/𝑟 с обобщённым обновлением
ТА Милованова - … -телекоммуникационные технологии и …, 2021 - elibrary.ru
Рассматривается хорошо известная система массового обслуживания GI/M/n/r с
обобщённым обновлением, когда заявка, окончившая обслуживание на приборе, с …
обобщённым обновлением, когда заявка, окончившая обслуживание на приборе, с …
Stationary Characteristics of the two-node Tandem Queueing System with Poisson Arrivals and General Renovation
LA Meykhanadzhyan, IS Zaryadov… - … , связь (DCCN-2020), 2020 - elibrary.ru
We consider the two-node tandem queueing system with finite capacity queues in both
nodes and Poisson input flows. There is one server in each node and the service times are …
nodes and Poisson input flows. There is one server in each node and the service times are …