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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
