Abstract
Time delays in queueing networks are assuming increasing importance with the proliferation of transaction processing and time-critical real time systems. Mean values are insufficient and it is necessary to estimate time intervals that are not exceeded with a specified probability, i.e. quantiles. This paper presents results on time delay distributions in single server queues of various types and extends these to networks of queues. In particular, the class of Jackson networks that permit exact solution are analysed in both the open and closed cases, and approximation techniques for more general networks are proposed.
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.
