A dynamic priority queue model for simultaneous service of two traffic types

被引:15
作者
Knessl, C
Choi, DI
Tier, C
机构
[1] Univ Illinois, Chicago, IL 60607 USA
[2] Halla Univ, Dept Appl Math, Kangwon Do, South Korea
关键词
dynamic priority queue; integral representation; asymptotic approximation;
D O I
10.1137/S0036139901390842
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We consider a priority queue with a dynamic, queue-length-threshold scheduling policy. Customers are classed into two types (type-1 and type-2), and the service order of the two classes depends on the queue length of the type-1 queue. The high priority ( type-2) class ( e. g., voice) is served until the low priority ( e. g., data) queue exceeds the threshold L, at which time service is given to the low priority class until its queue length decreases to L. The arrivals of the two classes follow independent Poisson processes, and the service time of each customer has an exponential distribution with parameter mu. We derive the balance equations in the steady state, and explicitly obtain the joint probability generating function for the queue lengths of the two customer classes. This gives the joint queue length distribution as an integral. We then obtain detailed asymptotic results for the joint distribution. In particular, we study the tail behavior. We also discuss heavy traffic diffusion approximations for this model.
引用
收藏
页码:398 / 422
页数:25
相关论文
共 11 条
[1]  
[Anonymous], 1975, Asymptotic Expansions of Integrals
[2]  
CHIPALKATTI R, 1989, P IEEE INFOCOM 89, P774
[3]  
Choi BD, 1998, IEICE T COMMUN, VE81B, P13
[4]   THE MARKOV-MODULATED POISSON-PROCESS (MMPP) COOKBOOK [J].
FISCHER, W ;
MEIERHELLSTERN, K .
PERFORMANCE EVALUATION, 1993, 18 (02) :149-171
[5]  
Fratini S., 1990, COMMUN STATIST STOCH, V6, P415, DOI DOI 10.1080/15326349908807155
[6]  
Jaiswal N. K., 1968, MATH SCI ENG, V50
[7]   Queueing Analysis of a Threshold Based Priority Scheme For ATM Networks [J].
Lee, Duan-Shin ;
Sengupta, Bhaskar .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1993, 1 (06) :709-717
[8]  
Lee JY, 1998, IEEE INFOCOM SER, P1470, DOI 10.1109/INFCOM.1998.662965
[9]   ANALYSIS OF A NONPREEMPTIVE PRIORITY QUEUE WITH SPP ARRIVALS OF HIGH-CLASS [J].
SUGAHARA, A ;
TAKINE, T ;
TAKAHASHI, Y ;
HASEGAWA, T .
PERFORMANCE EVALUATION, 1995, 21 (03) :215-238
[10]   PRIORITY-QUEUES [J].
TAKACS, L .
OPERATIONS RESEARCH, 1964, 12 (01) :63-&