Maximization of Carried Traffic by Prioritizing New Call Attempts in a CDMA Base Station with Finite Receiver Processors

Insook KIM; Dongwoo KIM; Sehun KIM

doi:10.1093/ietcom/e89-b.6.1879

Maximization of Carried Traffic by Prioritizing New Call Attempts in a CDMA Base Station with Finite Receiver Processors

Insook KIM, Dongwoo KIM, Sehun KIM

Full Text Views

0

Cite this

Summary :

If a certain number of receiver processors (RPs) are reserved exclusively for new calls, some decrease in the probability of blocking new calls (P_n) can be obtained at the expense of increase in dropping handoff calls (P_h). This kind of prioritization has been often considered for handoff calls. Since soft handoff in CDMA systems results in sufficiently low P_h, an idea of prioritizing new calls is interesting when admitting more originating traffic into the system is relatively beneficial, which will be further investigated in this paper. An obvious constraint of the above idea is that P_h should be maintained below a given requirement. We formulate the proposed scheme as a mathematical programming problem and prove it improves the performance in terms of weighted carried traffic. As a result of this work, the prioritization of new calls is shown to possibly improve the traffic-carrying performance of a CDMA base station (BS) while maintaining an acceptable level of P_h, which can be prespecified by a system engineer.

Publication: IEICE TRANSACTIONS on Communications Vol.E89-B No.6 pp.1879-1882

Publication Date: 2006/06/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e89-b.6.1879

Type of Manuscript: LETTER

Category: Switching for Communications

Cite this

Copy

Insook KIM, Dongwoo KIM, Sehun KIM, "Maximization of Carried Traffic by Prioritizing New Call Attempts in a CDMA Base Station with Finite Receiver Processors" in IEICE TRANSACTIONS on Communications, vol. E89-B, no. 6, pp. 1879-1882, June 2006, doi: 10.1093/ietcom/e89-b.6.1879.
Abstract: If a certain number of receiver processors (RPs) are reserved exclusively for new calls, some decrease in the probability of blocking new calls (P_n) can be obtained at the expense of increase in dropping handoff calls (P_h). This kind of prioritization has been often considered for handoff calls. Since soft handoff in CDMA systems results in sufficiently low P_h, an idea of prioritizing new calls is interesting when admitting more originating traffic into the system is relatively beneficial, which will be further investigated in this paper. An obvious constraint of the above idea is that P_h should be maintained below a given requirement. We formulate the proposed scheme as a mathematical programming problem and prove it improves the performance in terms of weighted carried traffic. As a result of this work, the prioritization of new calls is shown to possibly improve the traffic-carrying performance of a CDMA base station (BS) while maintaining an acceptable level of P_h, which can be prespecified by a system engineer.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.6.1879/_p

Copy

@ARTICLE{e89-b_6_1879,
author={Insook KIM, Dongwoo KIM, Sehun KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={Maximization of Carried Traffic by Prioritizing New Call Attempts in a CDMA Base Station with Finite Receiver Processors},
year={2006},
volume={E89-B},
number={6},
pages={1879-1882},
abstract={If a certain number of receiver processors (RPs) are reserved exclusively for new calls, some decrease in the probability of blocking new calls (P_n) can be obtained at the expense of increase in dropping handoff calls (P_h). This kind of prioritization has been often considered for handoff calls. Since soft handoff in CDMA systems results in sufficiently low P_h, an idea of prioritizing new calls is interesting when admitting more originating traffic into the system is relatively beneficial, which will be further investigated in this paper. An obvious constraint of the above idea is that P_h should be maintained below a given requirement. We formulate the proposed scheme as a mathematical programming problem and prove it improves the performance in terms of weighted carried traffic. As a result of this work, the prioritization of new calls is shown to possibly improve the traffic-carrying performance of a CDMA base station (BS) while maintaining an acceptable level of P_h, which can be prespecified by a system engineer.},
keywords={},
doi={10.1093/ietcom/e89-b.6.1879},
ISSN={1745-1345},
month={June},}

Copy

TY - JOUR
TI - Maximization of Carried Traffic by Prioritizing New Call Attempts in a CDMA Base Station with Finite Receiver Processors
T2 - IEICE TRANSACTIONS on Communications
SP - 1879
EP - 1882
AU - Insook KIM
AU - Dongwoo KIM
AU - Sehun KIM
PY - 2006
DO - 10.1093/ietcom/e89-b.6.1879
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2006
AB - If a certain number of receiver processors (RPs) are reserved exclusively for new calls, some decrease in the probability of blocking new calls (P_n) can be obtained at the expense of increase in dropping handoff calls (P_h). This kind of prioritization has been often considered for handoff calls. Since soft handoff in CDMA systems results in sufficiently low P_h, an idea of prioritizing new calls is interesting when admitting more originating traffic into the system is relatively beneficial, which will be further investigated in this paper. An obvious constraint of the above idea is that P_h should be maintained below a given requirement. We formulate the proposed scheme as a mathematical programming problem and prove it improves the performance in terms of weighted carried traffic. As a result of this work, the prioritization of new calls is shown to possibly improve the traffic-carrying performance of a CDMA base station (BS) while maintaining an acceptable level of P_h, which can be prespecified by a system engineer.
ER -