Abstract
We discuss a numerical method to find the distributions of the waiting time and the idle time for discrete-time queueing systems when inter-arrival or service time distributions have geometric tails. We showed by numerical experiments that our algorithm converges rapidly, and that the execution times for practical problems are negligible.
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 callMore From: INFOR: Information Systems and Operational Research
Disclaimer: 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.
