STABILITY AND ASYMPTOTIC OPTIMALITY OF GENERALIZED MAXWEIGHT POLICIES

被引:21
作者
Meyn, Sean [1 ,2 ]
机构
[1] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL 61801 USA
[2] Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA
基金
美国国家科学基金会;
关键词
queueing networks; routing; scheduling; optimal control; MULTICLASS QUEUING-NETWORKS; MARKOV DECISION-PROCESSES; HEAVY TRAFFIC ANALYSIS; SCHEDULING POLICIES; STOCHASTIC NETWORKS; PERFORMANCE EVALUATION; PROCESSING NETWORKS; WIRELESS CHANNELS; PARALLEL SERVERS; STATE-SPACE;
D O I
10.1137/06067746X
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
It is shown that stability of the celebrated MaxWeight or back pressure policies is a consequence of the following interpretation: either policy is myopic with respect to a surrogate value function of a very special form, in which the "marginal disutility" at a buffer vanishes for a vanishingly small buffer population. This observation motivates the h-MaxWeight policy, defined for a wide class of functions h. These policies share many of the attractive properties of the MaxWeight policy as follows: (i) Arrival rate data is not required in the policy. (ii) Under a variety of general conditions, the policy is stabilizing when h is a perturbation of a monotone linear function, a monotone quadratic, or a monotone Lyapunov function for the fluid model. (iii) A perturbation of the relative value function for a workload relaxation gives rise to a myopic policy that is approximately average-cost optimal in heavy traffic, with logarithmic regret. The first results are obtained for a general Markovian network model. Asymptotic optimality is established for a general Markovian scheduling model with a single bottleneck, and with homogeneous servers.
引用
收藏
页码:3259 / 3294
页数:36
相关论文
共 55 条
[1]  
[Anonymous], THESIS CAMBRIDGE U C
[2]  
[Anonymous], 1992, PROBLEMY PEREDACHI I
[3]  
[Anonymous], 2002, Internat. Ser. Oper. Res. Management Sci.
[4]  
[Anonymous], STOCHASTIC MODELLING
[5]  
[Anonymous], 2007, Control Techniques for Complex Networks
[6]   Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies [J].
Ata, B ;
Kumar, S .
ANNALS OF APPLIED PROBABILITY, 2005, 15 (1A) :331-391
[7]  
Bell SL, 2001, ANN APPL PROBAB, V11, P608
[8]  
Bertsekas Dimitri, 1996, Neuro dynamic programming
[9]   Stability conditions for multiclass fluid queueing networks [J].
Bertsimas, D ;
Gamarnik, D ;
Tsitsiklis, JN .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1996, 41 (11) :1618-1631
[10]   OPTIMIZATION OF MULTICLASS QUEUEING NETWORKS: POLYHEDRAL AND NONLINEAR CHARACTERIZATIONS OF ACHIEVABLE PERFORMANCE [J].
Bertsimas, Dimitris ;
Paschalidis, Ioannis Ch. ;
Tsitsiklis, John N. .
ANNALS OF APPLIED PROBABILITY, 1994, 4 (01) :43-75