Computing steady state probabilities in lambda(n)/G/1/K queue

In this paper a recursive method is developed to obtain the steady state probability distribution of the number in system at arbitrary and departure time epochs of a single server state-dependent arrival rate queue lambda(n)/G/1/K in which the arrival process is Markovian with arrival rates lambda(n) which depend on the number of customers n in the system and general service time distribution. It is assumed that there exists an integer K such that lambda(n)>0 for all 0 less than or equal to n < K and lambda(n) = 0 for all n greater than or equal to K. Numerical results have been presented for many queueing models by suitably defining the function lambda(n). These include machine interference model, queues with balking, queues with finite waiting space and machine interference model with finite waiting space. These models have wide application in computer/communication networks.