Abstract
This paper studies numerically the bulk-arrival queueing model M x / G/1. For a specified service-time distribution, an algorithm for the limiting distribution of the number in the system at random epoch is developed. This is also used to find the limiting distribution of the number in the system at pre-arrival and post-departure epochs. The mean and standard deviation of these distributions are also computed. Four cases of the service-time distribution are discussed: hyperexponential, deterministic, uniform and Erlang.
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.
