A polynomial factorization approach for the discrete time GIX/G/1/K queue

被引:1
|
作者
Linwong, P [1 ]
Kato, N [1 ]
Nemoto, Y [1 ]
机构
[1] Tohoku Univ, Grad Sch Informat Sci, Aoba Ku, Sendai, Miyagi 9808579, Japan
关键词
discrete time GI(X)/G/1/K; root finding algorithm; queue length distribution;
D O I
10.1023/B:MCAP.0000026560.42106.7a
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
This paper proposes a polynomial factorization approach for queue length distribution of discrete time GI(x) /G/1 and GI(x) /G/1/K queues. They are analyzed by using a two-component state model at the arrival and departure instants of customers. The equilibrium state-transition equations of state probabilities are solved by a polynomial factorization method. Finally, the queue length distributions are then obtained as linear combinations of geometric series, whose parameters are evaluated from roots of a characteristic polynomial.
引用
收藏
页码:277 / 291
页数:15
相关论文
共 50 条