The search functionality is under construction.

The search functionality is under construction.

We investigate traffic performance of CBWL schemes with multimedia services on non-homogeneous cellular network in which cut-off priority is given to handoff calls. Two generic routing schemes are analyzed: one is the randomized routing and the other is the least loaded routing. The performance measures that we focus on are the new call blocking probabilities and the handoff failure probabilities. To evaluate blocking probabilities of interest, we construct a generalized access network whose blocking probabilities are same as ones for CBWL systems. For analysis of generalized access network, we apply the reduced load approximation. The computational complexity and memory requirements of proposed algorithm are linear so that we can use this algorithm to approximate blocking probabilities of CBWL systems of large size. The proposed approximations are tested on a number of simple examples. Numerical results for 12 cells and 36 cells networks are given. The comparison between approximation and simulation results shows that the proposed approximation method is quite accurate.

- Publication
- IEICE TRANSACTIONS on Communications Vol.E83-B No.9 pp.2077-2086

- Publication Date
- 2000/09/25

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- PAPER

- Category
- Wireless Communication Switching

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

Bong Dae CHOI, Gyoung Il CHAE, Jinmin CHUNG, "Performance Analysis for Channel Borrowing without Locking Schemes with Multimedia Services and Cut-off Priority" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 9, pp. 2077-2086, September 2000, doi: .

Abstract: We investigate traffic performance of CBWL schemes with multimedia services on non-homogeneous cellular network in which cut-off priority is given to handoff calls. Two generic routing schemes are analyzed: one is the randomized routing and the other is the least loaded routing. The performance measures that we focus on are the new call blocking probabilities and the handoff failure probabilities. To evaluate blocking probabilities of interest, we construct a generalized access network whose blocking probabilities are same as ones for CBWL systems. For analysis of generalized access network, we apply the reduced load approximation. The computational complexity and memory requirements of proposed algorithm are linear so that we can use this algorithm to approximate blocking probabilities of CBWL systems of large size. The proposed approximations are tested on a number of simple examples. Numerical results for 12 cells and 36 cells networks are given. The comparison between approximation and simulation results shows that the proposed approximation method is quite accurate.

URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_9_2077/_p

Copy

@ARTICLE{e83-b_9_2077,

author={Bong Dae CHOI, Gyoung Il CHAE, Jinmin CHUNG, },

journal={IEICE TRANSACTIONS on Communications},

title={Performance Analysis for Channel Borrowing without Locking Schemes with Multimedia Services and Cut-off Priority},

year={2000},

volume={E83-B},

number={9},

pages={2077-2086},

abstract={We investigate traffic performance of CBWL schemes with multimedia services on non-homogeneous cellular network in which cut-off priority is given to handoff calls. Two generic routing schemes are analyzed: one is the randomized routing and the other is the least loaded routing. The performance measures that we focus on are the new call blocking probabilities and the handoff failure probabilities. To evaluate blocking probabilities of interest, we construct a generalized access network whose blocking probabilities are same as ones for CBWL systems. For analysis of generalized access network, we apply the reduced load approximation. The computational complexity and memory requirements of proposed algorithm are linear so that we can use this algorithm to approximate blocking probabilities of CBWL systems of large size. The proposed approximations are tested on a number of simple examples. Numerical results for 12 cells and 36 cells networks are given. The comparison between approximation and simulation results shows that the proposed approximation method is quite accurate.},

keywords={},

doi={},

ISSN={},

month={September},}

Copy

TY - JOUR

TI - Performance Analysis for Channel Borrowing without Locking Schemes with Multimedia Services and Cut-off Priority

T2 - IEICE TRANSACTIONS on Communications

SP - 2077

EP - 2086

AU - Bong Dae CHOI

AU - Gyoung Il CHAE

AU - Jinmin CHUNG

PY - 2000

DO -

JO - IEICE TRANSACTIONS on Communications

SN -

VL - E83-B

IS - 9

JA - IEICE TRANSACTIONS on Communications

Y1 - September 2000

AB - We investigate traffic performance of CBWL schemes with multimedia services on non-homogeneous cellular network in which cut-off priority is given to handoff calls. Two generic routing schemes are analyzed: one is the randomized routing and the other is the least loaded routing. The performance measures that we focus on are the new call blocking probabilities and the handoff failure probabilities. To evaluate blocking probabilities of interest, we construct a generalized access network whose blocking probabilities are same as ones for CBWL systems. For analysis of generalized access network, we apply the reduced load approximation. The computational complexity and memory requirements of proposed algorithm are linear so that we can use this algorithm to approximate blocking probabilities of CBWL systems of large size. The proposed approximations are tested on a number of simple examples. Numerical results for 12 cells and 36 cells networks are given. The comparison between approximation and simulation results shows that the proposed approximation method is quite accurate.

ER -