On the MAP/G/1 queue with Lebesgue-dominated service time distribution and LCFS preemptive repeat service discipline

被引:0
|
作者
Breuer, L [1 ]
机构
[1] Univ Trier, Dept Comp Sci, D-54286 Trier, Germany
关键词
MAP; last come first served; preemptive repeat; QBD;
D O I
10.1081/STM-120016446
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
The present paper contains an analysis of the MAP/G/1 queue with last come first served (LCFS) preemptive repeat service discipline and Lebesgue-dominated service time distribution. The transient distribution is given in terms of a recursive formula. The stationary distribution as well as the stability condition are obtained by means of Markov renewal theory via a QBD representation of the embedded Markov chain at departures and arrivals.
引用
收藏
页码:589 / 595
页数:7
相关论文
共 50 条