Steady state approximations of limited processor sharing queues in heavy traffic
From MaRDI portal
Publication:1007146
DOI10.1007/s11134-008-9095-4zbMath1156.90337MaRDI QIDQ1007146
Publication date: 27 March 2009
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-008-9095-4
90B22: Queues and service in operations research
Related Items
Heavy traffic analysis for EDF queues with reneging, Monotonicity in the Limited Processor-Sharing Queue
Cites Work
- Unnamed Item
- Unnamed Item
- Diffusion limits of limited processor sharing queues
- An extension of the square root law of TCP
- On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough
- Optimal multiprogramming
- The fluid limit of a heavily loaded processor sharing queue
- Diffusion approximation for a processor sharing queue in heavy traffic.
- Heavy traffic limit for a processor sharing queue with soft deadlines
- Validity of heavy traffic steady-state approximations in generalized Jackson networks
- A Review of Regenerative Processes
- Fluid Limits for Processor-Sharing Queues with Impatience
- Stationary Distribution Convergence for Generalized Jackson Networks in Heavy Traffic
- Law of Large Number Limits of Limited Processor-Sharing Queues
- Monotonicity in the Limited Processor-Sharing Queue
- Response times in M/M/1 time-sharing schemes with limited number of service positions
- GI/G/1 processor sharing queue in heavy traffic
- Applied Probability and Queues