相关论文: About some extended Erlang-Sevast'yanov queueing s…
Polynomial convergence rates in total variation are established in Erlang-Sevastyanov's type problem with an infinite number of servers and a general distribution of service under assumptions on the intensity of serving.
Polynomial convergence rate to stationarity is shown for extended Erlang -- Sevastyanov's model.
A many-server queueing system is considered in which customers arrive according to a renewal process and have service and patience times that are drawn from two independent sequences of independent, identically distributed random variables.…
We consider a service system with an infinite number of exponential servers sharing a finite service capacity. The servers are ordered according to their speed, and arriving customers join the fastest idle server. A capacity allocation is…
We consider a heterogeneous queueing system consisting of one large pool of $O(r)$ identical servers, where $r\to\infty$ is the scaling parameter. The arriving customers belong to one of several classes which determines the service times in…
We establish a heavy-traffic limit theorem on convergence in distribution for the number of customers in a many-server queue when the number of servers tends to infinity. No critical loading condition is assumed. Generally, the limit…
In this paper one presents method for the computation of convergence bounds for four classes of multiserver queueing systems, described by inhomogeneous Markov chains. Specifically one considers inhomogeneous $M/M/S$ queueing system with…
This paper studies the limiting behavior of a closed queueing network with multiple single-server and infinite-server stations. Under a heavy traffic asymptotic regime$\unicode{x2014}$where the number of jobs and single-server service rates…
We introduce and study a queue with the Erlang service system and whose arrivals are governed by a counting process in which there is a possibility of finitely many arrivals in an infinitesimal time interval. We call it the Erlang queue…
We consider many-server queueing systems with heterogeneous exponential servers and renewal arrivals. The service rate of each server is a random variable drawn from a given distribution. We develop a framework for analyzing the heavy…
Obtaining estimates of the convergence rate of the regenerating process $Q(t)$ whose value at time $t$ is equal to the number of claims in the system $ M \backslash G \backslash \infty $ at this moment, to the limit (stationary) regime.
The exponential upper bounds for the convergence rate of the distribution of restorable element with partially energized standby redundancy are founded, in the case when all working and repair times are bounded by exponential random…
We study a many-server queuing system with general service time distribution and state dependent service rates. The dynamics of the system are modeled using measure valued processes which keep track of the residual service times. Under…
Inspired by the work of Atar and Miyazawa [1] (2026) as well as applications to energy-saving problems, we are interested in the heavy-traffic limit of the stationary queue length distribution, which is not addressed in [1]. In this paper,…
The Join-the-Shortest-Queue (JSQ) policy is among the most widely used load balancing algorithms and has been extensively studied. However, an exact characterization of the system behavior remains challenging. Most prior research has…
We study the information-theoretic limit of reliable information processing by a server with queue-length dependent quality of service. We define the capacity for such a system as the number of bits reliably processed per unit time, and…
In this thesis, we study the queueing systems with heterogeneous servers and service rate uncertainty under the Halfin-Whitt heavy traffic regime. First, we analyse many server queues with abandonments when service rates are i.i.d. random…
In this paper continuity theorems are established for the number of losses during a busy period of the $M/M/1/n$ queue. We consider an $M/GI/1/n$ queueing system where the service time probability distribution, slightly different in a…
Consideration is given to the three different analytical methods for the computation of upper bounds for the rate of convergence to the limiting regime of one specific class of (in)homogeneous continuous-time Markov chains. This class is…
This paper concerns the recurrence structure of the infinite server queue, as viewed through the prism of the maximum dater sequence, namely the time to drain the current work in the system as seen at arrival epochs. Despite the importance…