Analysis of BMAP/G/1 queue with reservation of service

被引:4
|
作者
Kazimirsky, Arseniy V. [1 ]
机构
[1] Belarusian State Univ, Dept Appl Math & Comp Sci, Lab Appl Probabilist Analysis, Minsk 220050, BELARUS
关键词
Batch Markovian Arrival Process; queues with reservation of service;
D O I
10.1080/07362990600751803
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this article, we study BMAP/G /1 queue with service time distribution depending on number of processed items. This type of queue models the systems with the possibility of preliminary service. For the considered system, an efficient algorithm for calculating the stationary queue length distribution is proposed, and Laplace-Stieltjes transform of the sojourn time is derived. Little's law is proved. An optimization problem is considered.
引用
收藏
页码:703 / 718
页数:16
相关论文
共 50 条