Abstract
In this paper, we present an efficient numerical method for calculating the waiting time and idle time distributions of the arithmetic GI/G/1 queue. Our method is based on the Wiener-Hopf factorization, which is briefly reviewed. Compared to the related methods suggested in the literature, our method seems to perform very well, and it is often faster by several orders of magnitude. A number of numerical examples conclude the paper.
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.
