Abstract
We consider a single-server queue with a deterministic reneging time motivated by the timeout mechanism used in application servers in distributed computing environments. We have employed a Volterra integral equation to study the M / G / 1 queue with reneging using level crossing analysis. An analytical solution is given for the M / H 2 / 1 queue with deterministic reneging times and a numerical approach is presented for the more general M / G / 1 queue. The numerical approach is verified via simulation and the results reveal that predictions are highly accurate with errors that are in general below 0.5%.
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.
