Abstract
This paper presents a new algorithm to simulate multiple vacations Geo / G / 1 queue with Bernoulli gate service model. Firstly, we deduce the probability generating function (P.G.F.) of stationary queue length by using regeneration cycle method, and get the (P.G.F.) of stationary waiting time according to the service order FCFS. Then we get the (P.G.F.) of mean service cycle and the probability of various system state. The simulation results demonstrate that the new algorithm is relatively efficient and realized in real system.
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.
