Asymptotic approximations for stationary distributions of many-server queues with abandonment

DOI10.1214/10-AAP738MaRDI QIDQ417069zbMATH OpenFDO

Authors Weining Kang, Kavita Ramanan

Publication date 13 May 2012

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1003.3373, https://projecteuclid.org/euclid.aoap/1333372005

zbMATH Keywords

ergodicitystationary distributionmean-field limitscall centersmulti-server queuesabandonmentrenegingmeasure-valued processes

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Limit theorems in probability theory (60F99)

Abstract: 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. Customers enter service in the order of arrival and are assumed to abandon the queue if the waiting time in queue exceeds the patience time. The state of the system with $N$ servers is represented by a four-component process that consists of the forward recurrence time of the arrival process, a pair of measure-valued processes, one that keeps track of the waiting times of customers in queue and the other that keeps track of the amounts of time customers present in the system have been in service and a real-valued process that represents the total number of customers in the system. Under general assumptions, it is shown that the state process is a Feller process, admits a stationary distribution and is ergodic. It is also shown that the associated sequence of scaled stationary distributions is tight, and that any subsequence converges to an invariant state for the fluid limit. In particular, this implies that when the associated fluid limit has a unique invariant state, then the sequence of stationary distributions converges, as $Nightarrowinfty$, to the invariant state. In addition, a simple example is given to illustrate that, both in the presence and absence of abandonments, the $Nightarrowinfty$ and $tightarrowinfty$ limits cannot always be interchanged.

Recommendations

• Customer abandonment in many-server queues
• Fluid limits of many-server queues with abandonments, general service and continuous patience time distributions
• Queues with many servers and impatient customers
• Fluid limits of many-server queues with reneging
• Fluid models of many-server queues with abandonment

Cites work

• scientific article; zbMATH DE number 3852177 (Why is no real title available?)
• scientific article; zbMATH DE number 3858809 (Why is no real title available?)
• scientific article; zbMATH DE number 3538605 (Why is no real title available?)
• scientific article; zbMATH DE number 721868 (Why is no real title available?)
• scientific article; zbMATH DE number 3245885 (Why is no real title available?)
• A Proof for the Queuing Formula: L = λW
• Applied Probability and Queues
• Call centers with impatient customers: Many-server asymptotics of the M/M/\(n+G\) queue
• Ergodicity for Infinite Dimensional Systems
• Fluid Models for Multiserver Queues with Abandonments
• Fluid limits of many-server queues with reneging
• Heavy traffic limits for queues with many deterministic servers
• Heavy-Traffic Limits for Queues with Many Exponential Servers
• Law of large numbers limits for many-server queues
• On the Theory of Queues With Many Servers
• Point process theory and applications. Marked point and picewise deterministic processes.
• Queueing Theory
• SPDE limits of many-server queues
• Stability of Markovian processes II: continuous-time processes and sampled chains
• Statistical Analysis of a Telephone Call Center
• Steady-state analysis of a multiserver queue in the Halfin-Whitt regime
• Validity of heavy traffic steady-state approximations in generalized Jackson networks

Cited in

(40)

• Limit theorems for an infinite-server queuing system
• Mean-field limits for large-scale random-access networks
• \(\mathrm{G}/\mathrm{GI}/N (+ \mathrm{GI})\) queues with service interruptions in the Halfin-Whitt regime
• Limit theorems for queuing systems with regenerative doubly stochastic input flow
• Large-time asymptotics for the \(G_{t}/M_{t}/s_{t}+GI_{t}\) many-server fluid queue with abandonment
• Asymptotic Inference for Waiting Times and Patiences in Queues with Abandonment
• Law of large numbers limits for many-server queues
• Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
• Fluid limits for bandwidth-sharing networks with rate constraints
• The limit of stationary distributions of many-server queues in the Halfin-Whitt regime
• Multiclass multiserver queueing system in the Halfin-Whitt heavy traffic regime: asymptotics of the stationary distribution
• Steady-state GI/G/\(n\) queue in the Halfin-Whitt regime
• Heavy-traffic limits for waiting times in many-server queues with abandonment
• A fluid approximation for a matching model with general reneging distributions
• Fluid limits of many-server retrial queues with nonpersistent customers
• Law of large numbers for the many-server earliest-deadline-first queue
• Economies-of-scale in many-server queueing systems: tutorial and partial review of the QED Halfin-Whitt heavy-traffic regime
• Asymptotically optimal idling in the \(GI/GI/N+GI\) queue
• Fluid limits for many-server systems with reneging under a priority policy
• Customer abandonment in many-server queues
• Existence and uniqueness of a fluid model for many-server queues with abandonment
• SPDE limits of many-server queues
• A fair policy for the \(\mathrm{G}/\mathrm{GI}/N\) queue with multiple server pools
• Many-server limits for service systems with dependent service and patience times
• Parallel multi-type many server conjecture
• Fluid limits of many-server queues with abandonments, general service and continuous patience time distributions
• Long-Time Limit of Nonlinearly Coupled Measure-Valued Equations that Model Many-Server Queues with Reneging
• Sensitivity analysis for diffusion processes constrained to an orthant
• Fluid Limits for Overloaded Multiclass FIFO Single-Server Queues with General Abandonment
• Validity of heavy-traffic steady-state approximations in many-server queues with abandonment
• Diffusion Approximation for Efficiency-Driven Queues When Customers Are Patient
• Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments
• Diffusion approximations for \(\mathrm{G}/\mathrm{M}/n + \mathrm{GI}\) queues with state-dependent service rates
• Stationary distribution convergence of the offered waiting processes for \(GI/GI/1+GI\) queues in heavy traffic
• To pool or not to pool: queueing design for large-scale service systems
• On the rate of convergence to stationarity of the M/M/\(n\) queue in the Halfin-Whitt regime
• An overloaded multiclass FIFO queue with abandonments
• Many-server queues with customer abandonment: numerical analysis of their diffusion model
• Many-Server Heavy-Traffic Limits for Queueing Systems with Perfectly Correlated Service and Patience Times
• Computing absorbing times via fluid approximations

This page was built for publication: Asymptotic approximations for stationary distributions of many-server queues with abandonment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417069)