Oct 2026· WSEAS transactions on systems and control· Vol 21, pp. 476· 0 citations· 15 references
TL;DR
Based on the apparatus of semi-Markovian random evolutions, the weak convergence of the queue length process in two asymptotic schemes: averaging and diffusion approximation (central limit theorem), with the Ornstein–Uhlenbeck limit process, is proved.
Abstract
The paper considers the model of a heterogeneous queuing system
H
K
(
t
)
/
M
/
∞
and limit evolutions in the averaging and diffusion approximation scheme. The input process of the system under study is modelled as a mixture of independent heterogeneous Poisson processes, which reflects the behaviour of modern cloud serverless platforms, where tasks arrive simultaneously from different event sources (HTTP gateways, object stores, message queues, event buses). Based on the apparatus of semi-Markovian random evolutions, the weak convergence of the queue length process
L
(
t
)
in two asymptotic schemes: averaging (law of large numbers) and diffusion approximation (central limit theorem), with the Ornstein–Uhlenbeck limit process, is proved. As a result, simple analytical estimates of the queue length
L
(
t
)
and the probability of exceeding the maximum length
P
(
sup
t
∈
[
0
,
T
]
L
(
t
)
<
L
MAX
)
are constructed. Also, a necessary and sufficient condition for the queue's finiteness is expressed in terms of the parameters of the input and task-processing processes. The results obtained enable us to develop analytical methods for parameter estimation and predictive scaling for complex serverless systems in cloud environments, without the need to train models or neural networks on large amounts of data.
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,...
D. T. Churekeev, N. K. Nuriev· Herald Of Technological Univ...· 0 citations
The paper presents the obtained results of the analysis of general type queuing systems (QS), which are described by the second-order Cox phase distributions C2/C2/1. The use of phase distributions in queueing theory has been known for a long time. This class of distributions is suitable as a mathematical apparatus for...
Tandem queueing systems provide a fundamental framework for modeling multi-tier service architectures widely encountered in cloud computing, edge computing, and communication networks. In such systems, the interaction between service stages and the allocation of workloads across heterogeneous servers play a critical ro...
This paper introduces a model for infinite-server queues driven by a Cox process with stochastic intensity given by a squared Bessel (BESQ) process. Exploiting the affine structure of the underlying dynamics, we derive a closed-form expression for the joint moment-generating function (MGF) of the arrival intensity, the...
J. D. da Fonseca, Ya-Jun Shi, Wen-Jun Zhang· 0 citations
Motivated by call center systems, we investigate the optimal admission control problem for a retrial queueing system with multiple customer classes. Arrivals follow independent Poisson processes, service times are exponentially distributed, and the decision maker possesses complete information on the system state. The...
- This paper presents a comprehensive modelling and performance analysis of telecommunication queuing systems using Continuous-Time Markov Chains (CTMCs). The research addresses the stochastic nature of packet arrivals and service processes by developing mathematical representations for classic queuing models: M/M/1, M...
Owoade Praise Oluwapelumi, Ini Adinya, Folorunso Tobi Emmanuel· Iconic research and engineer...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.