A large deviations approach to the transient of the Erlang loss model

This paper deals with the transient behavior of the Erlang loss model. Afte r scaling both arrival rate and number of trunks, an asymptotic analysis of the blocking probability is given. Apart from that, the most likely path t o blocking is given. Compared to Shwartz and Weiss [Large Deviations for Pe rformance Analysis, Queues, Communication, and Computing, Chapman & Hall, N ew York, 1995], more explicit results are obtained by using probabilistic a rguments. The computation method is applied to the problem of (real-time) d imensioning of virtual paths in ATM networks, and to the problem of integra ting scheduled and switched connections in a single network. (C) 2001 Elsev ier Science B.V. All rights reserved.