Congestion probabilities in CDMA-based networks supporting batched Poisson traffic

Moscholios, Ioannis, Kallos, Georgios, Vassilakis, Vassilios and Logothetis, Michael (2014) Congestion probabilities in CDMA-based networks supporting batched Poisson traffic. Wireless Personal Communications, 79 (2). pp. 1163-1186. ISSN 0929-6212

[thumbnail of WPC_2016_manuscript.pdf]
WPC_2016_manuscript.pdf - Accepted Version

Download (822kB) | Preview


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 serviceclasses whose arrival follows a batched Poisson process. The latter is more "peaked" and "bursty" than the ordinary Poisson process. The acceptance of calls in the system 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 the multiple access interference, the notion of local (soft) blocking, user’s activity and the 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 calculation of the call-level performance metrics, time and call congestion probabilities, can be based on approximate but recursive formulas. The accuracy of the proposed formulas are verified through simulation and found to be quite satisfactory.

Item Type: Article
Identifier: 10.1007/s11277-014-1923-8
Additional Information: © Springer Science+Business Media New York 2014. The final publication is available at via
Keywords: CDMA; time-call congestion; batched Poisson; recursive formula; call admission.
Subjects: Computing
Depositing User: Vasileios Vasilakis
Date Deposited: 29 Jun 2016 20:41
Last Modified: 06 Feb 2024 15:50


Downloads per month over past year

Actions (login required)

View Item View Item