相关论文: Distributional properties of fluid queues busy per…
Solving a Riccati equation, induced by the study of the transient behaviour of the MGInf queue system, a collection of service times distributions is determined. For the MGInf queue, which service time distribution is a member of that…
The problems arising when the moments of service time distributions, for which the MGinf queue system busy period and busy cycle become very easy to study, are presented and it is shown how to overcome them. The busy cycle renewal function…
In this short communication we study a fluid queue with a finite buffer. The performance measure we are interested in is the occupation time over a finite time period, i.e., the fraction of time the workload process is below some fixed…
In this paper we analyze a single server queue with batch arrivals and semi-Markovian service times. We also include the feature that the first service of each busy period might have a different distribution than subsequent service times.…
We investigate an M/M/1 queue operating in two switching environments, where the switch is governed by a two-state time-homogeneous Markov chain. This model allows to describe a system that is subject to regular operating phases alternating…
We consider a fluid queue where the input process consists of N identical sources that turn on and off at exponential waiting times. The server works at the constant rate c and an on source generates fluid at unit rate. This model was first…
The advent of digital twins (DT) for the control and management of communication networks requires accurate and fast methods to estimate key performance indicators (KPI) needed for autonomous decision-making. Among several alternatives,…
The busy period length distribution function knowledge is important for any queue system, and for the MGINF queue. But the mathematical expressions are in general very complicated, with a few exceptions, involving usually infinite sums and…
Some important results on the variance of the $M|G|\infty$ queue busy period are presented. Often, this parameter depends on the whole structure of the service time distribution. So, the importance of the bounds presented, depending only on…
We study the impact of service-time distributions on the distribution of the maximum queue length during a busy period for the M^X/G/1 queue. The maximum queue length is an important random variable to understand when designing the buffer…
Fluctuations in stochastic systems are usually characterized by the full counting statistics, which analyzes the distribution of the number of events taking place in the fixed time interval. In an alternative approach, the distribution of…
We study finite-time mixing in time-periodic open flow systems. We describe the transport of densities in terms of a transfer operator, which is represented by the transition matrix of a finite-state Markov chain. The transport processes in…
We introduce the {\Delta}(i)/GI/1 queue, a new queueing model. In this model, customers from a given population independently sample a time to arrive from some given distribution F. Thus, the arrival times are an ordered statistics, and the…
We introduce a framework and develop a theory of transitory queueing models. These are models that are not only non-stationary and time-varying but also have other features such as the queueing system operates over finite time, or only a…
We investigate a processor sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue, or renege, before completing service. The corresponding stochastic processes are represented by…
Systems where resource availability approaches a critical threshold are common to many engineering and scientific applications and often necessitate the estimation of first passage time statistics of a Brownian motion (Bm) driven by…
This paper considers the mean waiting times in discrete-time preemptive-resume and nonpreemptive priority single-server queues fed by K independent batch Markovian arrival streams with geometrically distributed idle periods. While being…
In this article it is shown that if the busy period of a MGinf queue system is PME distributed, the service time is a random variable with a long tail distribution. The result is obtained through Laplace transforms analysis.
In traditional priority queues, we assume that every customer upon arrival has a fixed, class-dependent priority, and that a customer may not commence service if a customer with a higher priority is present in the queue. However, in…
We consider the heavy-traffic approximation to the $GI/M/s$ queueing system in the Halfin-Whitt regime, where both the number of servers $s$ and the arrival rate $\lambda$ grow large (taking the service rate as unity), with…