Abstract
In this paper we examine the distribution of the response time of an arriving customer conditioned on the number of customers present in an M/M/1 processor-sharing queue. We show that the rth moment of the distribution is a polynomial in the number of customers present, and obtain a recursion for its determination. The Laplace-Stieltjes transform of the conditional distribution is also obtained. We find an expansion in powers of the arrival rate, which permits accurate computation when the utilization is not too close to one, and also give an asymptotic expansion when the number of customers in the system is large. This permits assessment of response time in a heavily loaded system. We present numerical results using these methods and discuss their relative merits.
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.
