Approximations and Optimal Control for State-Dependent Limited Processor Sharing Queues

DOI10.1287/stsy.2021.0087zbMath1496.60113arXiv1409.0153OpenAlexW1652189572WikidataQ113239862 ScholiaQ113239862MaRDI QIDQ5084505

No author found.

Publication date: 24 June 2022

Published in: Stochastic Systems (Search for Journal in Brave)

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

zbMATH Keywords

diffusion approximationconcurrency controlheavy traffic analysislimited processor sharingaverage cost iteration

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Optimal stochastic control (93E20)

Related Items (1)

Analysis of a queueing system with mixed service discipline

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal arrival rate and service rate control of multi-server queues
• Diffusion limits of limited processor sharing queues
• Dynamic admission and service rate control of a queue
• Steady state approximations of limited processor sharing queues in heavy traffic
• The \(G/GI/N\) queue in the Halfin-Whitt regime
• Optimal control of diffusion processes with reflection
• Optimal multiprogramming
• State-dependent stochastic networks. I: Approximation and applications with continuous diffusion limits
• A heavy-traffic analysis of a closed queueing system with a \(GI/\infty\) service center
• Diffusion approximation for open state-dependent queueing networks in the heavy traffic situation
• Instantaneous Control of Brownian Motion
• Impulse Control of Brownian Motion
• Dynamic Control of an M/M/1 Service System with Adjustable Arrival and Service Rates
• Law of Large Number Limits of Limited Processor-Sharing Queues
• Some comparability results for waiting times in single- and many-server queues
• Steady-state analysis of a multiserver queue in the Halfin-Whitt regime
• Dynamic Control of a Queue with Adjustable Service Rate
• An Optimal Design Problem for Limited Processor Sharing Systems
• Response times in M/M/1 time-sharing schemes with limited number of service positions
• Heavy-Traffic Limits for Queues with Many Exponential Servers
• Asymptotic analysis of queueingnetworks
• On the Convergence of Policy Iteration in Stationary Dynamic Programming
• Heavy traffic theory for queues with several servers. I
• Non-Markovian State-Dependent Networks in Critical Loading
• Asymptotically Optimal Admission Control of a Queue with Impatient Customers
• Some Inequalities for Parallel-Server Queues

This page was built for publication: Approximations and Optimal Control for State-Dependent Limited Processor Sharing Queues