Abstract
We consider M/G/l queues characterized by the total unfinished work (buffer content) U(t) in the system at time t. We allow the rate of the Poisson arrivals as well as the rate at which the server works, to depend on the instantaneous value of U(t). In addition, the service density depends on the value of U(t) at the instant that the customer enters the system. We consider systems with a large arrival rate and small mean service times. We then construct asymptotic approximations to the probability that U(t) reaches the level K before completing the current busy period and we also compute the distribution of the maximum of U(t) during a busy period.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.