Some algorithms for discrete time queues with finite capacity

被引:2
|
作者
Sharma, V [1 ]
Gangadhar, ND [1 ]
机构
[1] INDIAN INST SCI,DEPT ELECT ENGN,BANGALORE 560012,KARNATAKA,INDIA
关键词
finite capacity queue; discrete time queue; algorithms; overflow time; regeneration cycle length; probability of overflow; Markov modulated arrivals;
D O I
10.1023/A:1019196100207
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider a discrete time queue with finite capacity and i.i.d. and Markov modulated arrivals, Efficient algorithms are developed to calculate the moments and the distributions of the first time to overflow and the regeneration length, Results are extended to the multiserver queue. Some illustrative numerical examples are provided.
引用
收藏
页码:281 / 305
页数:25
相关论文
共 50 条