On the value function of a priority queue with an application to a controlled polling model

被引:11
作者
Koole, G
Nain, P
机构
[1] Vrije Univ Amsterdam, NL-1081 HV Amsterdam, Netherlands
[2] INRIA, F-06902 Sophia Antipolis, France
关键词
priority queues; policy iteration; mu c rule; polling systems;
D O I
10.1023/A:1019109103725
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We give a closed-form expression for the discounted weighted queue length and switching costs of a two-class single-server queueing model under a preemptive priority rule. These expressions are used to do a single step of policy iteration in a polling model with a dynamically controlled switching rule, starting from the preemptive priority rule. Numerical experiments show that this leads to a policy that performs well.
引用
收藏
页码:199 / 214
页数:16
相关论文
共 13 条
[1]   K COMPETING QUEUES WITH GEOMETRIC SERVICE REQUIREMENTS AND LINEAR COSTS - THE MU-C-RULE IS ALWAYS OPTIMAL [J].
BARAS, JS ;
MA, DJ ;
MAKOWSKI, AM .
SYSTEMS & CONTROL LETTERS, 1985, 6 (03) :173-180
[2]  
Bertsekas D. P., 1996, Neuro Dynamic Programming, V1st
[3]   THE C-MU RULE REVISITED [J].
BUYUKKOC, C ;
VARAIYA, P ;
WALRAND, J .
ADVANCES IN APPLIED PROBABILITY, 1985, 17 (01) :237-238
[4]   Value iteration and optimization of multiclass queueing networks [J].
Chen, RR ;
Meyn, S .
QUEUEING SYSTEMS, 1999, 32 (1-3) :65-97
[5]   PRIORITY QUEUE WITH DISCOUNTED LINEAR COSTS [J].
HARRISON, JM .
OPERATIONS RESEARCH, 1975, 23 (02) :260-269
[6]  
Jaiswal N. K., 1968, MATH SCI ENG, V50
[7]   Assigning a single server to inhomogeneous queues with switching costs [J].
Koole, G .
THEORETICAL COMPUTER SCIENCE, 1997, 182 (1-2) :203-216
[8]  
Koole G, 1998, IEEE DECIS CONTR P, P56, DOI 10.1109/CDC.1998.760589
[9]   OPTIMAL SCHEDULING IN A MACHINE WITH STOCHASTIC VARYING PROCESSING RATE [J].
NAIN, P ;
TOWSLEY, D .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1994, 39 (09) :1853-1855
[10]  
Ott T. J., 1992, Annals of Operations Research, V35, P43, DOI 10.1007/BF02023090