Diffusion approximation for a processor sharing queue in heavy traffic.

DOI10.1214/105051604000000035zbMath1050.60085arXivmath/0405298OpenAlexW3105730966MaRDI QIDQ1879882

H. Christian Gromoll

Publication date: 15 September 2004

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

Full work available at URL: https://arxiv.org/abs/math/0405298

Mathematics Subject Classification ID

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

Related Items

Invariant states and rates of convergence for a critical fluid model of a processor sharing queue. ⋮ Conjectures on symmetric queues in heavy traffic ⋮ Asymptotic behavior of a critical fluid model for bandwidth sharing with general file size distributions ⋮ The fluid limit of the multiclass processor sharing queue ⋮ Scaling limits via excursion theory: interplay between Crump-Mode-Jagers branching processes and processor-sharing queues ⋮ Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling ⋮ Scaling limit of a limit order book model via the regenerative characterization of Lévy trees ⋮ Stabilizing the virtual response time in single-server processor sharing queues with slowly time-varying arrival rates ⋮ Processor sharing: a survey of the mathematical theory ⋮ The weak convergence of regenerative processes using some excursion path decompositions ⋮ Heavy traffic limit for a processor sharing queue with soft deadlines ⋮ A Skorokhod map on measure-valued paths with applications to priority queues ⋮ Heavy traffic analysis for EDF queues with reneging ⋮ Diffusion limits of limited processor sharing queues ⋮ Heavy-traffic approximations for a layered network with limited resources ⋮ Large deviations of sojourn times in processor sharing queues ⋮ PERFORMANCE ESTIMATION OFM/D_K/1 QUEUE UNDER FAIR SOJOURN PROTOCOL IN HEAVY TRAFFIC ⋮ Steady state approximations of limited processor sharing queues in heavy traffic ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue ⋮ Achievable Performance of Blind Policies in Heavy Traffic ⋮ Queuing systems with semi-Markov flow in average and diffusion approximation schemes ⋮ A note on the event horizon for a processor sharing queue ⋮ Distribution-valued heavy-traffic limits for the \(\mathrm{G}/\mathrm{GI}/\infty\) queue ⋮ Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Processor-sharing queues: Some progress in analysis
• Brownian models of feedforward queueing networks: Quasireversibility and product form solutions
• Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
• State space collapse with application to heavy traffic limits for multiclass queueing networks
• Multiple-input heavy-traffic real-time queues.
• The fluid limit of a heavily loaded processor sharing queue
• Real-time queues in heavy traffic with earliest-deadline-first queue discipline
• A LIFO queue in heavy traffic
• Invariant states and rates of convergence for a critical fluid model of a processor sharing queue.
• On the behavior of LIFO preemptive resume queues in heavy traffic
• GI/G/1 processor sharing queue in heavy traffic
• The Fluid Limit of an Overloaded Processor Sharing Queue
• Multiple channel queues in heavy traffic. I