Computing waiting-time probabilities in the discrete-time queue:: GIX/G/1

被引：6
|
作者：
Chaudhry, ML
Gupta, UC
机构：
[1] Royal Mil Coll Canada, Dept Math & Comp Sci, Kingston, ON K7K 7B4, Canada
[2] Indian Inst Technol, Dept Math, Kharagpur 721302, W Bengal, India
来源：
PERFORMANCE EVALUATION | 2001年 / 43卷 / 2-3期
基金：
加拿大自然科学与工程研究理事会;
关键词：
discrete time; bulk arrival; waiting time;
D O I：
10.1016/S0166-5316(00)00038-9
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we consider the discrete-time bulk-arrival GI(X)/G/1 queue and propose a simple procedure for computing waiting-time probabilities of the first and the random customers. As can be seen from our analysis that even analytic procedure is simpler than the one discussed by Murata and Miyahara [Perf. Eval. 13 (1991) 87]. Further, the procedure discussed here works for both finite and specialized infinite support interarrival-/service-time distributions such as geometric and negative binomial. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：123 / 131
页数：9
相关论文
共 50 条
12345