Law of Large Number Limits of Limited Processor-Sharing Queues

DOI10.1287/MOOR.1090.0412MaRDI QIDQ3169074zbMATH OpenOpenAlexFDO

Authors Jiheng Zhang, J. G. Dai, Bert Zwart

Publication date 27 April 2011

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/7af47ae3c138fe98ac6fa860b948145cdaecbaf0

zbMATH Keywords

convolution equationfluid modelinvariant manifoldlimited processor sharingmeasure-valued process

Mathematics Subject Classification ID

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

Recommendations

• Law of large numbers limits for many-server queues
• Diffusion limits of limited processor sharing queues
• Law of large numbers for the many-server earliest-deadline-first queue
• The fluid limit of a heavily loaded processor sharing queue
• The Fluid Limit of an Overloaded Processor Sharing Queue
• On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
• Tail asymptotics for processor-sharing queues
• Large deviations of sojourn times in processor sharing queues

Cited in

(26)

• Steady state approximations of limited processor sharing queues in heavy traffic
• Fluid approximations for a processor-sharing queue
• Law of large numbers for the many-server earliest-deadline-first queue
• A Skorokhod map on measure-valued paths with applications to priority queues
• On the scheduling of operations in a chat contact center
• Convergence to equilibrium states for fluid models of many-server queues with abandonment
• Invariant states and rates of convergence for a critical fluid model of a processor sharing queue.
• Fluid models of many-server queues with abandonment
• WCFS: a new framework for analyzing multiserver systems
• The efficiency-fairness balance of round robin scheduling
• Queueing system with processor sharing and limited memory under control of the AQM mechanism
• Routing and staffing in customer service chat systems with impatient customers
• Fluid limits for processor-sharing queues with impatience
• Approximations for chat service systems using many-server diffusion limits
• Monotonicity in the Limited Processor-Sharing Queue
• Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline
• An Optimal Design Problem for Limited Processor Sharing Systems
• The fluid limit of the multiclass processor sharing queue
• Heavy-traffic approximations for a layered network with limited resources
• A fluid limit for processor-sharing queues weighted by functions of remaining amounts of service
• A fluid model of an electric vehicle charging network
• Approximations and optimal control for state-dependent limited processor sharing queues
• Diffusion limits of limited processor sharing queues
• The Fluid Limit of an Overloaded Processor Sharing Queue
• Fluid model solution of feedforward network of overloaded multiclass processor sharing queues
• A fluid approximation for a matching model with general reneging distributions

This page was built for publication: Law of Large Number Limits of Limited Processor-Sharing Queues

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