Open AccessA Note on the Waiting-Time Distribution in an Infinite-Buffer G I [ X ] / C - M S P / 1
Author(s) -
Abhijit Datta Banik,
M. L. Chaudhry,
James J. Kim
Publication year - 2018
Publication title -
journal of probability and statistics
Language(s) - English
Resource type - Journals
eISSN - 1687-9538
pISSN - 1687-952X
DOI - 10.1155/2018/7462439
Subject(s) - algorithm , markovian arrival process , computer science , function (biology) , distribution (mathematics) , mathematics , markov chain , machine learning , mathematical analysis , evolutionary biology , biology
This paper deals with a batch arrival infinite-buffer single server queue. The interbatch arrival times are generally distributed and arrivals are occurring in batches of random size. The service process is correlated and its structure is presented through a continuous-time Markovian service process ( C - M S P ). We obtain the probability density function (p.d.f.) of actual waiting time for the first and an arbitrary customer of an arrival batch. The proposed analysis is based on the roots of the characteristic equations involved in the Laplace-Stieltjes transform (LST) of waiting times in the system for the first, an arbitrary, and the last customer of an arrival batch. The corresponding mean sojourn times in the system may be obtained using these probability density functions or the above LSTs. Numerical results for some variants of the interbatch arrival distribution (Pareto and phase-type) have been presented to show the influence of model parameters on the waiting-time distribution. Finally, a simple computational procedure (through solving a set of simultaneous linear equations) is proposed to obtain the “ R ” matrix of the corresponding G I / M / 1 -type Markov chain embedded at a prearrival epoch of a batch.