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