Controlled stochastic networks in heavy traffic: Convergence of value functions

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.

Published in at http://dx.doi.org/10.1214/11-AAP784 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (6)

• Asymptotic optimality of maximum pressure policies in stochastic processing networks
• Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
• Diffusion approximations for controlled stochastic networks: An asymptotic bound for the value function
• A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic
• Existence of optimal controls for singular control problems with state constraints
• Singular control with state constraints on unbounded domain