ON the GI/M(n)/1/K queue-an alternative approach

Abstract

This paper presents a recursive method for computing steady-state probabilities at random and prearrival epochs of the single server finite buffer queue, general interarrival and exponential service time with service rates dependent on the number of customers present in the system. The model lis referred to as GI/M(N)/1/K and has wide application in several areas. The method is based on the supplementary variable technique and works efficiently for all the interarrival time distributions. Some comparative studies have been shown in the form of tables and graph. An algorithm along with its comlexity is given in the appendix.