English
Related papers

Related papers: Fluid Limits for Time-Varying Many-Server Queues w…

200 papers

This work considers a many-server queueing system in which impatient customers with i.i.d., generally distributed service times and i.i.d., generally distributed patience times enter service in the order of arrival and abandon the queue if…

Probability · Mathematics 2010-11-15 Weining Kang , Kavita Ramanan

The purpose of this note is to show that it is possible to establish a many-server functional strong law of large numbers (FSLLN) for the fraction of occupied servers (i.e., the scaled number-in-system) without explicitly tracking either…

Probability · Mathematics 2020-01-01 Prakash Chakraborty , Harsha Honnappa

This work considers a many-server queueing system in which customers with i.i.d., generally distributed service times enter service in the order of arrival. The dynamics of the system is represented in terms of a process that describes the…

Probability · Mathematics 2007-08-08 Haya Kaspi , Kavita Ramanan

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…

Probability · Mathematics 2013-04-09 Anup Biswas

This paper studies many-server limits for multi-server queues that have a phase-type service time distribution and allow for customer abandonment. The first set of limit theorems is for critically loaded $G/Ph/n+GI$ queues, where the…

Probability · Mathematics 2010-11-10 J. G. Dai , Shuangchi He , Tolga Tezcan

A many-server heavy-traffic FCLT is proved for the $G_t/M/s_t+\mathit {GI}$ queueing model, having time-varying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment…

Probability · Mathematics 2014-01-17 Yunan Liu , Ward Whitt

In this paper, we present a functional fluid limit theorem and a functional central limit theorem for a queue with an infinity of servers M/GI/$\infty$. The system is represented by a point-measure valued process keeping track of the…

Probability · Mathematics 2009-09-29 Laurent Decreusefond , Pascal Moyal

We study many-server queues with abandonment in which customers have general service and patience time distributions. The dynamics of the system are modeled using measure- valued processes, to keep track of the residual service and patience…

Probability · Mathematics 2013-08-27 Jiheng Zhang

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…

Probability · Mathematics 2020-09-01 Lun Yu , Ohad Perry

The synchronization process inherent to the Bitcoin network gives rise to an infinite-server model with the unusual feature that customers interact. Among the closed-form characteristics that we derive for this model is the busy period…

Probability · Mathematics 2017-03-27 Maria Frolkova , Michel Mandjes

We prove a many-server heavy-traffic fluid limit for an overloaded Markovian queueing system having two customer classes and two service pools, known in the call-center literature as the X model. The system uses the…

Probability · Mathematics 2013-01-24 Ohad Perry , Ward Whitt

In this paper, we study an $N$ server fork-join queue with nearly deterministic arrival and service times. Specifically, we present a fluid limit for the maximum queue length as $N\to\infty$. This fluid limit depends on the initial number…

Probability · Mathematics 2021-08-24 Dennis Schol , Maria Vlasiou , Bert Zwart

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.…

Probability · Mathematics 2012-04-30 Weining Kang , Kavita Ramanan

This paper introduces and analyzes the notion of throughput suboptimality for many-server queueing systems in heavy traffic. The queueing model under consideration has multiple customer classes, indexed by a finite set $\mathcal{I}$, and…

Probability · Mathematics 2009-06-15 Rami Atar , Gennady Shaikhet

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…

Probability · Mathematics 2018-12-04 Wenyi Qin

In this paper, we consider modeling time-dependent multi-server queues that include abandonments and retrials. For the performance analysis of those, fluid and diffusion models called "strong approximations" have been widely used in the…

Probability · Mathematics 2009-11-13 Young Myoung Ko , Natarajan Gautam

In this thesis, we propose and analyze a multi-server model that captures a performance trade-off between centralized and distributed processing. In our model, a fraction $p$ of an available resource is deployed in a centralized manner…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-03-23 Kuang Xu

The large-time behavior of a nonlinearly coupled pair of measure-valued transport equations with discontinuous boundary conditions, parameterized by a positive real-valued parameter $\lambda$, is considered. These equations describe the…

Probability · Mathematics 2021-07-13 Rami Atar , Weining Kang , Haya Kaspi , Kavita Ramanan

We consider GI/Ph/n+M parallel-server systems with a renewal arrival process, a phase-type service time distribution, n homogenous servers, and an exponential patience time distribution with positive rate. We show that in the Halfin-Whitt…

Probability · Mathematics 2014-01-14 J. G. Dai , A. B. Dieker , Xuefeng Gao

The focus of this paper is on the asymptotics of large-time numbers of customers in time-periodic Markovian many-server queues with customer abandonment in heavy traffic. Limit theorems are obtained for the periodic number-of-customers…

Probability · Mathematics 2014-06-03 Anatolii A. Puhalskii
‹ Prev 1 2 3 10 Next ›