We consider a single circuit-switched communication link, depicted by a Erlang multi-class loss queue, where a customer may vary its required bandwidth during its service. We obtain approximately the steady-state blocking probability of each class of customer. Comparisons with simulation results show that the approximation solution has a good accuracy. For the proposed model, we also provide an efficient capacity provisioning algorithm.
Wenhong Tian, Harry G. Perros