Erlang capacity and uniform approximations for shared unbuffered resources

摘要: We consider a basic teletraffic model, which has applications to integrated multirate services on ATM and wireless systems. In the "finite-sources" version of model an unbuffered resource with C channels is shared by heterogeneous sources alternate between arbitrarily distributed random periods in off states, state require fixed number channels. If source does not find enough free when it turns on, then blocked burst lost. "infinite-sources" requests for connections form Poisson streams hold numbers periods. The stationary distribution system product-form insensitivity property. Our main results finite-sources are asymptotic scaling each type large. central result uniform approximation (UAA) blocking probabilities. It uniformly effective complete range loadings, simple calculate gives accurate even relatively small UAA also specialized overloaded, critical underloaded regimes. For admission control we its Erlang capacity, i.e., set combinations various types such that probabilities all do exceed specified values. first two regimes obtain boundaries admissible sets hyperplanes, thus bandwidths type. regime boundary nonlinear convenient parameterized characterization. Finally, numerical presented. >