Abstract
We consider the sojourn time V in the M/D/1 processor sharing (PS) queue and show that P(V > x) is of the form Ce−γx as x becomes large. The proof involves a geometric random sum representation of V and a connection with Yule processes, which also enables us to simplify Ott's [21] derivation of the Laplace transform of V. Numerical experiments show that the approximation P(V > x) ≈ Ce−γx is excellent even for moderate values of x.
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: Probability in the Engineering and Informational Sciences
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.
