相关论文: Some Asymptotic Properties of the Erlang-C Formula…

We develop many-server asymptotics in the QED regime for models with admission control. The admission control, designed to reduce the incoming traffic in periods of congestion, scales with the size of the system. For a class of Markovian…

We address the problem of giving robust performance bounds based on the study of the asymptotic behavior of the insensitive load balancing schemes when the number of servers and the load scales jointly. These schemes have the desirable…

In many-server systems it is crucial to staff the right number of servers so that targeted service levels are met. These staffing problems typically lead to constraint satisfaction problems that are hard to solve. During the last decade, a…

The Quality-and-Efficiency-Driven (QED) regime provides a basis for solving asymptotic dimensioning problems that trade off revenue, costs and service quality. We derive bounds for the optimality gaps that capture the differences between…

The Erlang A model--an M/M/s queue with exponential abandonment--is often used to represent a service system with impatient customers. For this system, the popular square-root staffing rule determines the necessary staffing level to achieve…

The analysis of stochastic loss networks has long been of interest in computer and communications networks and is becoming important in the areas of service and information systems. In traditional settings, computing the well known Erlang…

Motivated by health care systems with repeated services that have both personnel (nurse and physician) and space (beds) constraints, we study a restricted version of the Erlang-R model. The space restriction policies we consider are…

The Erlang loss formula, also known as the Erlang B formula, has been known for over a century and has been used in a wide range of applications, from telephony to hospital intensive care unit management. It provides the blocking…

We consider a multi-server queue in the Halfin-Whitt regime: as the number of servers $n$ grows without a bound, the utilization approaches 1 from below at the rate $\Theta(1/\sqrt{n})$. Assuming that the service time distribution is…

In this paper, we investigate the number of customers that overlap or coincide with a virtual customer in an Erlang-A queue. Our study provides a novel approach that exploits fluid and diffusion limits for the queue to approximate the mean…

We characterize heavy-traffic process and steady-state limits for systems staffed according to the square-root safety rule, when the service requirements of the customers are perfectly correlated with their individual patience for waiting…

This paper studies the effect of an overdispersed arrival process on the performance of an infinite-server system. In our setup, a random environment is modeled by drawing an arrival rate $\Lambda$ from a given distribution every $\Delta$…

We consider the problem of staffing large-scale service systems with multiple customer classes and multiple dedicated server pools under joint quality-of-service (QoS) constraints. We first analyze the case in which arrival rates are…

The asymptotic behaviour of a closed BCMP network, with $n$ queues and $m_n$ clients, is analyzed when $n$ and $m_n$ become simultaneously large. Our method relies on Berry-Esseen type approximations coming in the Central Limit Theorem. We…

This paper studies properties of binary runlength-limited sequences with additional constraints on their Hamming weight and/or their number of runs of identical symbols. An algebraic and a probabilistic (entropic) characterization of the…

Service systems like data centers and ride-hailing are popularly modeled as queueing systems in the literature. Such systems are primarily studied in the steady state due to their analytical tractability. However, almost all applications in…

In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends…

This paper demonstrates the occurrence of the feature called BRAVO (Balancing Reduces Asymptotic Variance of Output) for the departure process of a finite-buffer Markovian many-server system in the QED (Quality and Efficiency-Driven)…

Arrival processes to service systems often display (i) larger than anticipated fluctuations, (ii) a time-varying rate, and (iii) temporal correlation. Motivated by this, we introduce a specific non-homogeneous Poisson process that…

We consider N single server infinite buffer queues with service rate beta. Customers arrive at rate N times alpha,choose L queues uniformly, and join the shortest one. The stability condition is alpha strictly less than beta. We study in…