Congestion Probabilities in CDMA-Based Networks Supporting Batched Poisson Input Traffic
We propose a new multirate teletraffic loss model for the calculation of time and call congestion probabilities in CDMA-based networks that accommodate calls of different service-classes. The call arrival process follows a batched Poisson process, which is more peaked and bursty than the ordinary Poisson process. The call-admission-control policy is based on the partial batch blocking discipline. This policy accepts a part of the batch (one or more calls) and discards the rest, if the available resources are not enough to accept the whole batch. The proposed model takes into account multiple access interference, both the notion of local (soft) and hard blocking, the users activity, as well as interference cancellation. Although the analysis of the model does not lead to a product form solution of the steady state probabilities, we show that the call-level performance metrics, time and call congestion probabilities can be efficiently calculated based on approximate but recursive formulas. The accuracy of the proposed formulas are verified through simulation and found to be quite satisfactory. Comparison of the proposed model with that of Poisson input shows the necessity of the new model. We also show the consistency of the new model over changes of its parameters.
batched poisson recursive formula cdma time-call congestion call admission