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.
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.
