Analyzing an infinite buffer batch arrival and batch service queue under batch-size-dependent service policy

被引:0
|
作者
S. Pradhan
U. C. Gupta
S. K. Samanta
机构
[1] Indian Institute of Technology,Department of Mathematics
[2] National Institute of Technology,Department of Mathematics
关键词
primary 60G05; secondary 60K25; Batch-arrival; Batch-service; Batch-size-dependent service; Multiple roots; Queueing; Random capacity;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, we investigate an infinite-buffer queue with batch-arrival and batch-service wherein a single server operates under random serving capacity rule with service time dependent on the size of the batch under the service. First, we derive the probability generating function of state probabilities at service completion epoch, from which an entire spectrum regarding queue-length at various epochs is extracted. Using the departure epoch probabilities, we establish a stable relationship between departure and random epochs probabilities based on ‘rate in = rate out’ approach. Further, random epoch probabilities are used to obtain pre-arrival epoch probabilities. Finally, we illustrate our analytical results by means of numerical computation which includes the case of multiple roots.
引用
收藏
页码:137 / 148
页数:11
相关论文
共 50 条