Stationary distribution of an infinite-buffer batch-arrival and batch-service queue with random serving capacity and batch-size-dependent service

Abstract

In traditional batch-service queueing systems, the mean service time of batches are generally assumed to be constant. However, in numerous applications this assumption may not be appropriate. In telecommunication networks, the transmission rates depend on the number of packets in the batch which can be framed as batch-size-dependent service queue. The objective of this paper is to focus on both queue and server content distribution in an infinite-buffer batch-arrival and batch-service queue with random serving capacity rule and batch-size-dependent service. After deriving a bivariate probability generating function of queue length and server content distribution at departure epoch of a batch, we extract the complete joint distribution in terms of roots of the characteristic equation. We also obtain the system as well as queue length distribution at arbitrary epoch. Finally, a significant number of numerical examples are appended to show the feasibility of the analytic procedure and results where the occurrence of multiple roots have been dealt without facing any difficulty. At the end, a graphical representation of cost of the system shows that batch-size-dependent service is more significant as compared to batch-size-independent service.

Performance analysis of an infinite-buffer batch-size-dependent bulk service queue with server breakdown and multiple vacation

“…Finally, use of ( 35), (37), and (38) in (33) and some algebraic simplification lead to the bivariate pgf of queue length and server content at the service completion epoch as:…”

“…The application further stretches to the wireless telecommunication systems, recreational devices in amusement parks, chemical processing industries, etc. Recent developments and more applications can be found in Claeys et al [10,11,13], Banerjee et al [4,6,16], Pradhan and Gupta [31,32,33].…”