A solution model of integrating cells of PCS to switches in wireless ATM network

Der Rong Din, Shian Shyong Tseng

Research output: Contribution to journalArticle

5 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)1533-1541
Number of pages9
JournalIEICE Transactions on Communications
VolumeE85-B
Issue number8
Publication statusPublished - 2002 Jan 1

Fingerprint

Personal communication systems
Asynchronous transfer mode
Switches
Integer programming
Computational complexity
Costs

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{6c2fd24db149481ea4839b6614de32a6,
title = "A solution model of integrating cells of PCS to switches in wireless ATM network",
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.",
author = "Din, {Der Rong} and Tseng, {Shian Shyong}",
year = "2002",
month = "1",
day = "1",
language = "English",
volume = "E85-B",
pages = "1533--1541",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "8",

}

A solution model of integrating cells of PCS to switches in wireless ATM network. / Din, Der Rong; Tseng, Shian Shyong.

In: IEICE Transactions on Communications, Vol. E85-B, No. 8, 01.01.2002, p. 1533-1541.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A solution model of integrating cells of PCS to switches in wireless ATM network

AU - Din, Der Rong

AU - Tseng, Shian Shyong

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

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.

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

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

M3 - Article

VL - E85-B

SP - 1533

EP - 1541

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 8

ER -