A Novel Computational Procedure for the Waiting-Time Distribution (In the Queue) for Bulk-Service Finite-Buffer Queues with Poisson Input

被引:3
|
作者
Chaudhry, Mohan [1 ]
Banik, Abhijit Datta [2 ]
Barik, Sitaram [2 ]
Goswami, Veena [3 ]
机构
[1] Royal Mil Coll Canada, Dept Math & Comp Sci, STN Forces, POB 17000, Kingston, ON K7K 7B4, Canada
[2] Indian Inst Technol Bhubaneswar, Sch Basic Sci, Permanent Campus Argul, Jatni 752050, Khurda, India
[3] Kalinga Inst Ind Technol, Sch Comp Applicat, Bhubaneswar 751024, India
关键词
Poisson input; batch service (a; b)-rule; finite-buffer queue; roots; SIZE; SYSTEMS;
D O I
10.3390/math11051142
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper, we discuss the waiting-time distribution for a finite-space, single-server queueing system, in which customers arrive singly following a Poisson process and the server operates under (a,b)-bulk service rule. The queueing system has a finite-buffer capacity 'N' excluding the batch in service. The service-time distribution of batches follows a general distribution, which is independent of the arrival process. We first develop an alternative approach of obtaining the probability distribution for the queue length at a post-departure epoch of a batch and, subsequently, the probability distribution for the queue length at a random epoch using an embedded Markov chain, Markov renewal theory and the semi-Markov process. The waiting-time distribution (in the queue) of a random customer is derived using the functional relation between the probability generating function (pgf) for the queue-length distribution and the Laplace-Stieltjes transform (LST) of the queueing-time distribution for a random customer. Using LSTs, we discuss the derivation of the probability density function of a random customer's waiting time and its numerical implementations.
引用
收藏
页数:26
相关论文
共 40 条