A Solution Model of Integrating Cells of PCS to Switches in Wireless ATM Network

Der-Rong DIN; Shian-Shyong TSENG

A Solution Model of Integrating Cells of PCS to Switches in Wireless ATM Network

Der-Rong DIN, Shian-Shyong TSENG

Full Text Views

0

Cite this

Summary :

In this paper, we investigate the optimal assignment problem of cells in PCS (Personal Communication Service) to switches on a ATM (Asynchronous Transfer Mode) network. Given cells and switches on an ATM network (whose locations are fixed and known), the problem is to group cells into clusters and assign these clusters to switches in an optimum manner. This problem is modeled as a complex integer programming problem. Since finding an optimal solution of this problem is NP-hard, a heuristic solution model consists of three phases (Cell Pre-Partitioning Phase, Cell Exchanging Phase, and Cell Migrating Phase) is proposed. Experimental results show that Cell Exchanging and Cell Migrating Phases can really reduce total cost near 44% on average.

Publication: IEICE TRANSACTIONS on Communications Vol.E85-B No.8 pp.1533-1541

Publication Date: 2002/08/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Terrestrial Radio Communications

Cite this

Copy

Der-Rong DIN, Shian-Shyong TSENG, "A Solution Model of Integrating Cells of PCS to Switches in Wireless ATM Network" in IEICE TRANSACTIONS on Communications, vol. E85-B, no. 8, pp. 1533-1541, August 2002, doi: .
Abstract: In this paper, we investigate the optimal assignment problem of cells in PCS (Personal Communication Service) to switches on a ATM (Asynchronous Transfer Mode) network. Given cells and switches on an ATM network (whose locations are fixed and known), the problem is to group cells into clusters and assign these clusters to switches in an optimum manner. This problem is modeled as a complex integer programming problem. Since finding an optimal solution of this problem is NP-hard, a heuristic solution model consists of three phases (Cell Pre-Partitioning Phase, Cell Exchanging Phase, and Cell Migrating Phase) is proposed. Experimental results show that Cell Exchanging and Cell Migrating Phases can really reduce total cost near 44% on average.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_8_1533/_p

Copy

@ARTICLE{e85-b_8_1533,
author={Der-Rong DIN, Shian-Shyong TSENG, },
journal={IEICE TRANSACTIONS on Communications},
title={A Solution Model of Integrating Cells of PCS to Switches in Wireless ATM Network},
year={2002},
volume={E85-B},
number={8},
pages={1533-1541},
abstract={In this paper, we investigate the optimal assignment problem of cells in PCS (Personal Communication Service) to switches on a ATM (Asynchronous Transfer Mode) network. Given cells and switches on an ATM network (whose locations are fixed and known), the problem is to group cells into clusters and assign these clusters to switches in an optimum manner. This problem is modeled as a complex integer programming problem. Since finding an optimal solution of this problem is NP-hard, a heuristic solution model consists of three phases (Cell Pre-Partitioning Phase, Cell Exchanging Phase, and Cell Migrating Phase) is proposed. Experimental results show that Cell Exchanging and Cell Migrating Phases can really reduce total cost near 44% on average.},
keywords={},
doi={},
ISSN={},
month={August},}

Copy

TY - JOUR
TI - A Solution Model of Integrating Cells of PCS to Switches in Wireless ATM Network
T2 - IEICE TRANSACTIONS on Communications
SP - 1533
EP - 1541
AU - Der-Rong DIN
AU - Shian-Shyong TSENG
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2002
AB - In this paper, we investigate the optimal assignment problem of cells in PCS (Personal Communication Service) to switches on a ATM (Asynchronous Transfer Mode) network. Given cells and switches on an ATM network (whose locations are fixed and known), the problem is to group cells into clusters and assign these clusters to switches in an optimum manner. This problem is modeled as a complex integer programming problem. Since finding an optimal solution of this problem is NP-hard, a heuristic solution model consists of three phases (Cell Pre-Partitioning Phase, Cell Exchanging Phase, and Cell Migrating Phase) is proposed. Experimental results show that Cell Exchanging and Cell Migrating Phases can really reduce total cost near 44% on average.
ER -