Abstract
We develop an asymptotic technique for analyzing the transient behavior of queues and other stochastic models. As an example we consider the Erlang loss model which is the M/M/m/m queue. Asymptotic expansions are constructed for systems with a large number of servers and a large arrival rate that is O(m). We give formulas for the probability p n(t) that n servers are occupied at time t. We treat several cases of initial conditions and several regions in the (n, t) plane. Our approach is based on applying the ray method to a scaled form of the forward Kolmogorov equation which describes the time evolution of p n(t).
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.