Fast proliferation of mobile Internet and high-demand mobile applications necessitates the introduction of different priority classes in next-generation cellular networks. This is especially crucial for efficient use of radio resources in the heterogeneous and virtualized network environments. Despite the fact that many analytical tools have been proposed for capacity and radio resource modelling in cellular networks, only a few of them explicitly incorporate priorities among services. We propose a novel analytical model to analyse the performance of a priority-based cellular CDMA system with finite source population. When the cell load is above a certain level, low-priority calls may be blocked to preserve the quality of service of high-priority calls. The proposed model leads to an efficient closed-form solution that enables fast and very accurate calculation of resource occupancy of the CDMA system and call blocking probabilities, for different services and many priority classes. To achieve them, the system is modelled as a continuous-time Markov chain. We evaluate the accuracy of the proposed analytical model by means of computer simulations and find that the introduced approximation errors are negligible.
Vassilios G. VASSILAKIS
University of Cambridge
Ioannis D. MOSCHOLIOS
University of Peloponnese
Michael D. LOGOTHETIS
University of Patras
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Vassilios G. VASSILAKIS, Ioannis D. MOSCHOLIOS, Michael D. LOGOTHETIS, "Uplink Blocking Probabilities in Priority-Based Cellular CDMA Networks with Finite Source Population" in IEICE TRANSACTIONS on Communications,
vol. E99-B, no. 6, pp. 1302-1309, June 2016, doi: 10.1587/transcom.2015EUP0010.
Abstract: Fast proliferation of mobile Internet and high-demand mobile applications necessitates the introduction of different priority classes in next-generation cellular networks. This is especially crucial for efficient use of radio resources in the heterogeneous and virtualized network environments. Despite the fact that many analytical tools have been proposed for capacity and radio resource modelling in cellular networks, only a few of them explicitly incorporate priorities among services. We propose a novel analytical model to analyse the performance of a priority-based cellular CDMA system with finite source population. When the cell load is above a certain level, low-priority calls may be blocked to preserve the quality of service of high-priority calls. The proposed model leads to an efficient closed-form solution that enables fast and very accurate calculation of resource occupancy of the CDMA system and call blocking probabilities, for different services and many priority classes. To achieve them, the system is modelled as a continuous-time Markov chain. We evaluate the accuracy of the proposed analytical model by means of computer simulations and find that the introduced approximation errors are negligible.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2015EUP0010/_p
Copy
@ARTICLE{e99-b_6_1302,
author={Vassilios G. VASSILAKIS, Ioannis D. MOSCHOLIOS, Michael D. LOGOTHETIS, },
journal={IEICE TRANSACTIONS on Communications},
title={Uplink Blocking Probabilities in Priority-Based Cellular CDMA Networks with Finite Source Population},
year={2016},
volume={E99-B},
number={6},
pages={1302-1309},
abstract={Fast proliferation of mobile Internet and high-demand mobile applications necessitates the introduction of different priority classes in next-generation cellular networks. This is especially crucial for efficient use of radio resources in the heterogeneous and virtualized network environments. Despite the fact that many analytical tools have been proposed for capacity and radio resource modelling in cellular networks, only a few of them explicitly incorporate priorities among services. We propose a novel analytical model to analyse the performance of a priority-based cellular CDMA system with finite source population. When the cell load is above a certain level, low-priority calls may be blocked to preserve the quality of service of high-priority calls. The proposed model leads to an efficient closed-form solution that enables fast and very accurate calculation of resource occupancy of the CDMA system and call blocking probabilities, for different services and many priority classes. To achieve them, the system is modelled as a continuous-time Markov chain. We evaluate the accuracy of the proposed analytical model by means of computer simulations and find that the introduced approximation errors are negligible.},
keywords={},
doi={10.1587/transcom.2015EUP0010},
ISSN={1745-1345},
month={June},}
Copy
TY - JOUR
TI - Uplink Blocking Probabilities in Priority-Based Cellular CDMA Networks with Finite Source Population
T2 - IEICE TRANSACTIONS on Communications
SP - 1302
EP - 1309
AU - Vassilios G. VASSILAKIS
AU - Ioannis D. MOSCHOLIOS
AU - Michael D. LOGOTHETIS
PY - 2016
DO - 10.1587/transcom.2015EUP0010
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E99-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2016
AB - Fast proliferation of mobile Internet and high-demand mobile applications necessitates the introduction of different priority classes in next-generation cellular networks. This is especially crucial for efficient use of radio resources in the heterogeneous and virtualized network environments. Despite the fact that many analytical tools have been proposed for capacity and radio resource modelling in cellular networks, only a few of them explicitly incorporate priorities among services. We propose a novel analytical model to analyse the performance of a priority-based cellular CDMA system with finite source population. When the cell load is above a certain level, low-priority calls may be blocked to preserve the quality of service of high-priority calls. The proposed model leads to an efficient closed-form solution that enables fast and very accurate calculation of resource occupancy of the CDMA system and call blocking probabilities, for different services and many priority classes. To achieve them, the system is modelled as a continuous-time Markov chain. We evaluate the accuracy of the proposed analytical model by means of computer simulations and find that the introduced approximation errors are negligible.
ER -