arXiv Analytics

Sign in

arXiv:1205.0925 [math.PR]AbstractReferencesReviewsResources

Controlled stochastic networks in heavy traffic: Convergence of value functions

Amarjit Budhiraja, Arka P. Ghosh

Published 2012-05-04Version 1

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.

Comments: 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)
Journal: Annals of Applied Probability 2012, Vol. 22, No. 2, 734-791
Categories: math.PR
Related articles: Most relevant | Search more
arXiv:1812.08626 [math.PR] (Published 2018-12-20)
Optimal Stopping under G-expectation
arXiv:1812.04564 [math.PR] (Published 2018-12-11)
Global $C^1$ Regularity of the Value Function in Optimal Stopping Problems
arXiv:0807.4621 [math.PR] (Published 2008-07-29, updated 2014-05-31)
On the $M_t/M_t/K_t+M_t$ queue in heavy traffic