Performance analysis of the single server queue with state-dependent service

Abstract

Abstract In this paper we discuss the performance analysis of a single server queue with Poisson arrivals and arbitrary service times which are conditioned on the number of customers (units) in the system at the beginning of the service of a customer. The system has a finite capacity K. The model is denoted by M/Gn/K, and has wide applications in computer-communication systems. An algorithm has been developed to compute the steady-state probabilities at departure and arbitrary epochs. Numerical results have been presented for various special cases: two-state service rates; two-state mixed service; and many-state service rates. The algorithm is computationally efficient, accurate and reliable for both high and low values of the model parameters and works for all the service time distributions including the non-phase type. Some comparative studies have been presented in the form of tables and graphs. Notes Tel: +(91) 3222 2221 EXTN 4877; Fax: +(91) 3222 2303.