Controlled stochastic networks in heavy traffic: convergence of value functions
From MaRDI portal
(Redirected from Publication:417083)
diffusion approximationstochastic controlscaling limitsasymptotic optimalitysingular control with state constraintsunitary network
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) Stochastic network models in operations research (90B15) Stochastic scheduling theory in operations research (90B36)
Abstract: Scheduling control problems for a family of unitary networks under heavy traffic with general interarrival and service times, probabilistic routing and an infinite horizon discounted linear holding cost are studied. Diffusion control problems, that have been proposed as approximate models for the study of these critically loaded controlled stochastic networks, can be regarded as formal scaling limits of such stochastic systems. However, to date, a rigorous limit theory that justifies the use of such approximations for a general family of controlled networks has been lacking. It is shown that, under broad conditions, the value function of the suitably scaled network control problem converges to that of the associated diffusion control problem. This scaling limit result, in addition to giving a precise mathematical basis for the above approximation approach, suggests a general strategy for constructing near optimal controls for the physical stochastic networks by solving the associated diffusion control problem.
Recommendations
- Diffusion approximations for controlled stochastic networks: an asymptotic bound for the value function
- scientific article; zbMATH DE number 1631027
- Routing and Singular Control for Queueing Networks in Heavy Traffic
- Ergodic rate control problem for single class queueing networks
- Heavy Traffic Convergence of a Controlled, Multiclass Queueing System
Cites work
- scientific article; zbMATH DE number 1631026 (Why is no real title available?)
- scientific article; zbMATH DE number 1631027 (Why is no real title available?)
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- scientific article; zbMATH DE number 4076265 (Why is no real title available?)
- scientific article; zbMATH DE number 53999 (Why is no real title available?)
- scientific article; zbMATH DE number 932423 (Why is no real title available?)
- A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic
- An invariance principle for semimartingale reflecting Brownian motions in an orthant
- Asymptotic optimality of maximum pressure policies in stochastic processing networks
- Asymptotically Optimal Admission Control of a Queue with Impatient Customers
- Brownian models of open processing networks: Canonical representation of workload.
- Control Techniques for Complex Networks
- Convex duality and the Skorokhod problem. II
- Diffusion approximation for \(GI/G/1\) controlled queues
- Diffusion approximations for controlled stochastic networks: an asymptotic bound for the value function
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Existence of optimal controls for singular control problems with state constraints
- Heavy Traffic Analysis of a Controlled Multiclass Queueing Network via Weak Convergence Methods
- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
- On lipschitz continuity of the solution mapping to the skorokhod problem, with applications
- On the Continuity of the Optimal Policy Set for Linear Programs
- Reflected Brownian motion on an orthant
- Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations
- Singular control with state constraints on unbounded domain
- Two workload properties for Brownian networks
Cited in
(15)- Ergodic rate control problem for single class queueing networks
- Parallel server systems under an extended heavy traffic condition: a lower bound
- Brownian control problems for a multiclass M/M/1 queueing problem with model uncertainty
- Diffusion approximations for controlled weakly interacting large finite state systems with simultaneous jumps
- Stochastic Approximations and Adaptive Control of a Discrete-Time Single-Server Network with Random Routing
- Diffusion approximations for controlled stochastic networks: an asymptotic bound for the value function
- scientific article; zbMATH DE number 1631027 (Why is no real title available?)
- Utility-maximizing resource control: diffusion limit and asymptotic optimality for a two-bottleneck model
- Asymptotic analysis of a multiclass queueing control problem under heavy traffic with model uncertainty
- Asymptotic optimality of the generalized \(c\mu\) rule under model uncertainty
- Limit theorems for pathwise average cost per unit time problems for controlled queues in heavy traffic
- An asymptotic optimality result for the multiclass queue with finite buffers in heavy traffic
- scientific article; zbMATH DE number 3918067 (Why is no real title available?)
- Diffusion approximation for fair resource control -- interchange of limits under a moment condition
- Diffusion approximations for load balancing mechanisms in cloud storage systems
This page was built for publication: Controlled stochastic networks in heavy traffic: convergence of value functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417083)
