We consider the scheduling control problem for a family of unitary networks under heavy traffic, with general interarrival and service times, probabilistic routing and infinite horizon discounted linear holding cost. A natural nonanticipativity condition for admissibility of control policies is introduced. The condition is seen to hold for a broad class of problems. Using this formulation of admissible controls and a time-transformation technique, we establish that the infimum of the cost for the network control problem over all admissible sequencing control policies is asymptotically bounded below by the value function of an associated diffusion control problem (the Brownian control problem). This result provides a useful bound on the best achievable performance for any admissible control policy for a wide class of networks.
Publié le : 2006-11-14
Classification:
Control of queuing networks,
heavy traffic,
Brownian control problem,
equivalent workload formulation,
unitary networks,
asymptotic optimality,
60K25,
68M20,
90B22,
90B35,
60J70
@article{1169065213,
author = {Budhiraja, Amarjit and Ghosh, Arka Prasanna},
title = {Diffusion approximations for controlled stochastic networks: An asymptotic bound for the value function},
journal = {Ann. Appl. Probab.},
volume = {16},
number = {1},
year = {2006},
pages = { 1962-2006},
language = {en},
url = {http://dml.mathdoc.fr/item/1169065213}
}
Budhiraja, Amarjit; Ghosh, Arka Prasanna. Diffusion approximations for controlled stochastic networks: An asymptotic bound for the value function. Ann. Appl. Probab., Tome 16 (2006) no. 1, pp. 1962-2006. http://gdmltest.u-ga.fr/item/1169065213/