TY - GEN

T1 - A heuristic algorithm for solving the network expanded problem on wireless ATM environment

AU - Din, Der Rong

PY - 2007

Y1 - 2007

N2 - In this paper, the network expanded problem (NEP) which optimally assigns new adding and splitting cells in PCS (Personal Communication Service) network to switches in an ATM (Asynchronous Transfer Mode) network is studied. In NEP, the locations of all cells (or Base Station, BS) in PCS network are fixed and known, but new switches should be installed to ATM network and the topology of the backbone network may be changed. Given some potential sites of new switches, the problem is to determine how many switches should be added to the backbone network, the locations of new switches, the topology of the new backbone network, and the assignments of new adding and splitting cells in the PCS to switches on the new ATM backbone network in an optimum manner. The goal is to do the expansion in as attempt to minimize the total communication cost under budget and capacity constraints. The NEP is modeled as a complex integer programming problem and finding an optimal solution to this problem is NP-hard. A heuristic algorithm is proposed to solve this problem. The proposed heuristic algorithm consists of four phases: Remaining Capacities Pre-assigning Phase (RCPP), Cell Clustering Phase (CCP), Switch Selection Phase (SSP), and Backbone Design Phase (BDP). Experimental results indicate that the proposed algorithm can find good solution.

AB - In this paper, the network expanded problem (NEP) which optimally assigns new adding and splitting cells in PCS (Personal Communication Service) network to switches in an ATM (Asynchronous Transfer Mode) network is studied. In NEP, the locations of all cells (or Base Station, BS) in PCS network are fixed and known, but new switches should be installed to ATM network and the topology of the backbone network may be changed. Given some potential sites of new switches, the problem is to determine how many switches should be added to the backbone network, the locations of new switches, the topology of the new backbone network, and the assignments of new adding and splitting cells in the PCS to switches on the new ATM backbone network in an optimum manner. The goal is to do the expansion in as attempt to minimize the total communication cost under budget and capacity constraints. The NEP is modeled as a complex integer programming problem and finding an optimal solution to this problem is NP-hard. A heuristic algorithm is proposed to solve this problem. The proposed heuristic algorithm consists of four phases: Remaining Capacities Pre-assigning Phase (RCPP), Cell Clustering Phase (CCP), Switch Selection Phase (SSP), and Backbone Design Phase (BDP). Experimental results indicate that the proposed algorithm can find good solution.

UR - http://www.scopus.com/inward/record.url?scp=38049079230&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38049079230&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-74472-6_69

DO - 10.1007/978-3-540-74472-6_69

M3 - Conference contribution

AN - SCOPUS:38049079230

SN - 9783540744689

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 846

EP - 859

BT - Computational Science and Its Applications - ICCSA 2007 - International Conference, Proceedings

PB - Springer Verlag

T2 - International Conference on Computational Science and its Applications, ICCSA 2007

Y2 - 26 August 2007 through 29 August 2007

ER -