Fluid limits for processor-sharing queues with impatience

DOI10.1287/MOOR.1070.0298MaRDI QIDQ3168972zbMATH OpenOpenAlexFDO

Authors H. Christian Gromoll, Philippe Robert, Bert Zwart

Publication date 27 April 2011

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

Full work available at URL https://doi.org/10.1287/moor.1070.0298

zbMATH Keywords

delay-differential equationsempirical processesfluid limitsmeasure-valued processprocessor sharingqueues with impatience

Mathematics Subject Classification ID

Functional limit theorems; invariance principles (60F17) Random measures (60G57) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)

Recommendations

• Fluid approximations for a processor-sharing queue
• The fluid limit of a heavily loaded processor sharing queue
• Law of Large Number Limits of Limited Processor-Sharing Queues
• Fluid limits of many-server queues with reneging
• The fluid limit of the multiclass processor sharing queue

Cited in

(32)

• Steady state approximations of limited processor sharing queues in heavy traffic
• Edge minimality of EDF resource sharing networks
• On the scheduling of operations in a chat contact center
• Fluid models of many-server queues with abandonment
• Fluid limits of many-server retrial queues with nonpersistent customers
• Front-office multitasking between service encounters and back-office tasks
• On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency
• Bounds and limit theorems for a layered queueing model in electric vehicle charging
• Distribution-valued heavy-traffic limits for the \(\mathrm{G}/\mathrm{GI}/\infty\) queue
• The efficiency-fairness balance of round robin scheduling
• Asymptotic behavior of a critical fluid model for a processor sharing queue via relative entropy
• On the accuracy of fluid models for capacity sizing in queueing systems with impatient customers
• Comparisons of ticket and standard queues
• A dynamic network model of interbank lending -- systemic risk and liquidity provisioning
• Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline
• Fluid limit of a heavily loaded EDF queue with impatient customers
• The fluid limit of the multiclass processor sharing queue
• Fluid limits for an ALOHA-type model with impatient customers
• On queues with impatience: stability, and the optimality of earliest deadline first
• Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers
• FLUID LIMIT OF A PS-QUEUE WITH MULTISTAGE SERVICE
• A fluid model of an electric vehicle charging network
• A Markovian event-based framework for stochastic spiking neural networks
• Fluid Limits for Overloaded Multiclass FIFO Single-Server Queues with General Abandonment
• Insensitivity of the mean field limit of loss systems under \(\mathrm{SQ}(d)\) routeing
• Fluid limits for bandwidth-sharing networks with rate constraints
• Diffusion limits of limited processor sharing queues
• On a processor sharing queue that models balking
• Singular perturbation for a two-class processor-sharing queue with impatience
• Law of large numbers limits for many-server queues
• Processor Sharing Queues with Impatience
• A fluid approximation for a matching model with general reneging distributions

This page was built for publication: Fluid limits for processor-sharing queues with impatience

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