A study on N-policy BMAP/G/1 queueing system

Abstract

This study presents a simple approach for analyzing the BMAP/G/1 queueing system under N policy. In this policy, the server goes idle at the end of a busy period and the queue length is checked at every arrival moment. The idle server starts serving customers when the queue length reaches or above a predetermined number, namely N, and keeps doing so until the system is completely empty. We first use a simple sequential substitution approach to derive the system length distribution at departure epoch. A comparative study is also conducted to highlight the benefits and strength of our straightforward approach to that of the RG-factorization technique and the roots finding method. We extract the distribution of system length at a random time point by utilizing the remaining service time of a customer who is currently being served as the supplementary variable. The probability density function of the sojourn time distribution for an arbitrary customer of an incoming batch is also computed. We propose an expected linear cost function to estimate the optimal value of N at minimum cost. The validity of our analytic technique has been shown through a variety of numerical examples involving different service time distributions.