Abstract
This paper gives a transient analysis of blocking in Erlang's traffic model, the classic N-server model of a trunk group. Our results are asymptotic as N becomes large. We give expressions for E(t;N, -y) and R(t;N, -y), which are the blocking probabilities at time t where the system starts empty (for E) or full (for R), and N-y is the Poisson arrival rate. The results are based on the theory of large deviations and integral asymptotic expansions of Laplace transforms, and compare well with some exact (numerical) calculations.
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.
