Controlled stochastic networks in heavy traffic: Convergence of value functions

Scheduling control problems for a family of unitary networks under heavy trac with general interarrival and service times, probabilistic routing and an innite horizon discounted linear holding cost are studied. Diusion 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 justies 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 diusion 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 diusion control problem.

[1]  Volker Böhm On the continuity of the optimal policy set for linear programs , 1975 .

[2]  J. Harrison,et al.  Reflected Brownian Motion on an Orthant , 1981 .

[3]  J. Michael Harrison,et al.  Brownian Models of Queueing Networks with Heterogeneous Customer Populations , 1988 .

[4]  P. Dupuis,et al.  On Lipschitz continuity of the solution mapping to the Skorokhod problem , 1991 .

[5]  Elena V. Krichagina,et al.  Diffusion approximation forGI/G/1 controlled queues , 1992, Queueing Syst. Theory Appl..

[6]  J. Quadrat Numerical methods for stochastic control problems in continuous time , 1994 .

[7]  L. F. Martins,et al.  Heavy Traffic Analysis of a Controlled Multiclass Queueing Network via Weak Convergence Methods , 1996 .

[8]  Jan A. Van Mieghem,et al.  Dynamic Control of Brownian Networks: State Space Collapse and Equivalent Workload Formulations , 1997 .

[9]  Ruth J. Williams,et al.  An invariance principle for semimartingale reflecting Brownian motions in an orthant , 1998, Queueing Syst. Theory Appl..

[10]  P. Dupuis,et al.  Convex duality and the Skorokhod Problem. II , 1999 .

[11]  Ronald J. Williams,et al.  Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy , 2001 .

[12]  P. Dupuis,et al.  Convex duality and the Skorokhod Problem. I , 1999 .

[13]  Ruth J. Williams,et al.  On dynamic scheduling of stochastic networks in heavy traffic and some new results for the workload process , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[14]  J. Harrison Brownian models of open processing networks: canonical representation of workload , 2000 .

[15]  H. Kushner Heavy Traffic Analysis of Controlled Queueing and Communication Networks , 2001 .

[16]  Maury Bramson,et al.  Two Workload Properties for Brownian Networks , 2003, Queueing Syst. Theory Appl..

[17]  Sean P. Meyn Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations , 2003, SIAM J. Control. Optim..

[18]  D. Yao,et al.  Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization , 2001, IEEE Transactions on Automatic Control.

[19]  Amarjit Budhiraja,et al.  A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic , 2005 .

[20]  S. L. Bell,et al.  Dynamic Scheduling of a Parallel Server System in Heavy Traffic with Complete Resource Pooling: Asymptotic Optimality of a Threshold Policy , 2005 .

[21]  S. Sushanth Kumar,et al.  Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies , 2005, math/0503477.

[22]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[23]  A. Budhiraja,et al.  Existence of optimal controls for singular control problems with state constraints , 2006, math/0702418.

[24]  Amarjit Budhiraja,et al.  Diffusion approximations for controlled stochastic networks: An asymptotic bound for the value function , 2006 .

[25]  R. Atar,et al.  Singular control with state constraints on unbounded domain , 2005, math/0501016.

[26]  Sean P. Meyn Control Techniques for Complex Networks: Workload , 2007 .

[27]  Sunil Kumar,et al.  Asymptotically Optimal Admission Control of a Queue with Impatient Customers , 2008, Math. Oper. Res..

[28]  J. Dai,et al.  Asymptotic optimality of maximum pressure policies in stochastic processing networks. , 2008, 0901.2451.