KJCKorea
Journal Central

@article{ART002076673},
author={Sang-Un, Lee},
title={Minimum Network Connection Cost Algorithm for Partially Survivable Networks Problem of Cellular Telecommunication Systems},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2016},
volume={21},
number={1},
pages={59-64}

TY - JOUR
AU - Sang-Un, Lee
TI - Minimum Network Connection Cost Algorithm for Partially Survivable Networks Problem of Cellular Telecommunication Systems
JO - Journal of The Korea Society of Computer and Information
PY - 2016
VL - 21
IS - 1
PB - The Korean Society Of Computer And Information
SP - 59
EP - 64
SN - 1598-849X
AB - This paper suggests heuristic algorithm with   polynomial time complexity using Excel for partially survivable networks optimization problem of cellular telecommunication systems with  cells and  hubs. This problem only can be get the solution using linear programming or LINGO software package. The proposed algorithm connects the cell to hubs in ring network with minimum cost as the connection diversity of each cell. If the traffic of ring network (T) is    for ring capacity (K), we adjust the maximum cost hub to MTSO that has a ascending order of   cell with each cell traffic demand (D) and   (MTSO cost-maximum cost hub) than we get the  ≤  . Finally, we adjust MTSO to the removed maximum cost hub for the cell with   ≥   and max . While we using like this simple method, the proposed algorithm can be get the same optimal solution for experimental data as linear programing and LINGO software package.
KW - Hub;MTSO;Connection diversity;Traffic demand;Ring network capacity
DO -
UR -
ER -

Sang-Un, Lee. (2016). Minimum Network Connection Cost Algorithm for Partially Survivable Networks Problem of Cellular Telecommunication Systems. Journal of The Korea Society of Computer and Information, 21(1), 59-64.

Sang-Un, Lee. 2016, "Minimum Network Connection Cost Algorithm for Partially Survivable Networks Problem of Cellular Telecommunication Systems", Journal of The Korea Society of Computer and Information, vol.21, no.1 pp.59-64.

Sang-Un, Lee "Minimum Network Connection Cost Algorithm for Partially Survivable Networks Problem of Cellular Telecommunication Systems" Journal of The Korea Society of Computer and Information 21.1 pp.59-64 (2016) : 59.

Sang-Un, Lee. Minimum Network Connection Cost Algorithm for Partially Survivable Networks Problem of Cellular Telecommunication Systems. 2016; 21(1), 59-64.

Sang-Un, Lee. "Minimum Network Connection Cost Algorithm for Partially Survivable Networks Problem of Cellular Telecommunication Systems" Journal of The Korea Society of Computer and Information 21, no.1 (2016) : 59-64.

Sang-Un, Lee. Minimum Network Connection Cost Algorithm for Partially Survivable Networks Problem of Cellular Telecommunication Systems. Journal of The Korea Society of Computer and Information, 21(1), 59-64.

Sang-Un, Lee. Minimum Network Connection Cost Algorithm for Partially Survivable Networks Problem of Cellular Telecommunication Systems. Journal of The Korea Society of Computer and Information. 2016; 21(1) 59-64.

Sang-Un, Lee. Minimum Network Connection Cost Algorithm for Partially Survivable Networks Problem of Cellular Telecommunication Systems. 2016; 21(1), 59-64.

Sang-Un, Lee. "Minimum Network Connection Cost Algorithm for Partially Survivable Networks Problem of Cellular Telecommunication Systems" Journal of The Korea Society of Computer and Information 21, no.1 (2016) : 59-64.