Heuristic algorithm for optimal design of the two-level wireless ATM network

Der-Rong Din, S. S. Tseng

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

In this paper, we investigate the optimal assignment problem of cells in PCS (Personal Communication Service) to switches in a wireless ATM network. Given cells and switches on an ATM network (whose locations are fixed and known), the problem is grouping cells into clusters and assigning these clusters to the switches in an optimum manner. This problem is modeled as a complex integer programming problem and finding an optimal solution of this problem is NP-complete. A three-phase heuristic algorithm MCMLCF (Maximum cell and minimum local communication first) consisting of Cell Pre-Partitioning Phase, Cell Exchanging Phase, and Cell Migrating Phase, is proposed. First, in the Cell Pre-Partitioning Phase, a three-step procedure (Clustering Step, Packing Step, and Assigning Step) is proposed to group cells into clusters. Second, Cell Exchanging Phase is proposed to greatly improve the result by repeatedly exchanging two cells in different switches. Finally, Cell Migrating Phase is proposed to reduce cost by repeatedly migrating all cells in a used switch to an empty switch. Experimental results indicate that the proposed algorithm runs efficiently. Comparing the results of the algorithm to a naive heuristic called NSF, we have shown that the computation time is reduced by 30.1%. Experimental results show that Cell Exchanging and Cell Migrating phases can reduce the total cost by 34.1% on average. By comparing the results of the proposed algorithm to the genetic algorithm, the heuristic method came close to optimum - on average within 5%.

Original languageEnglish
Pages (from-to)647-665
Number of pages19
JournalJournal of Information Science and Engineering
Volume17
Issue number4
Publication statusPublished - 2001 Jul 1

Fingerprint

Asynchronous transfer mode
Heuristic algorithms
heuristics
Switches
local communication
costs
Personal communication systems
Heuristic methods
grouping
Integer programming
programming
Optimal design
Costs
Computational complexity
Genetic algorithms
communication
Communication
Group

All Science Journal Classification (ASJC) codes

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Library and Information Sciences
  • Computational Theory and Mathematics

Cite this

@article{c40b0da4951545f6ac0584b3e8db5d99,
title = "Heuristic algorithm for optimal design of the two-level wireless ATM network",
abstract = "In this paper, we investigate the optimal assignment problem of cells in PCS (Personal Communication Service) to switches in a wireless ATM network. Given cells and switches on an ATM network (whose locations are fixed and known), the problem is grouping cells into clusters and assigning these clusters to the switches in an optimum manner. This problem is modeled as a complex integer programming problem and finding an optimal solution of this problem is NP-complete. A three-phase heuristic algorithm MCMLCF (Maximum cell and minimum local communication first) consisting of Cell Pre-Partitioning Phase, Cell Exchanging Phase, and Cell Migrating Phase, is proposed. First, in the Cell Pre-Partitioning Phase, a three-step procedure (Clustering Step, Packing Step, and Assigning Step) is proposed to group cells into clusters. Second, Cell Exchanging Phase is proposed to greatly improve the result by repeatedly exchanging two cells in different switches. Finally, Cell Migrating Phase is proposed to reduce cost by repeatedly migrating all cells in a used switch to an empty switch. Experimental results indicate that the proposed algorithm runs efficiently. Comparing the results of the algorithm to a naive heuristic called NSF, we have shown that the computation time is reduced by 30.1{\%}. Experimental results show that Cell Exchanging and Cell Migrating phases can reduce the total cost by 34.1{\%} on average. By comparing the results of the proposed algorithm to the genetic algorithm, the heuristic method came close to optimum - on average within 5{\%}.",
author = "Der-Rong Din and Tseng, {S. S.}",
year = "2001",
month = "7",
day = "1",
language = "English",
volume = "17",
pages = "647--665",
journal = "Journal of Information Science and Engineering",
issn = "1016-2364",
publisher = "Institute of Information Science",
number = "4",

}

Heuristic algorithm for optimal design of the two-level wireless ATM network. / Din, Der-Rong; Tseng, S. S.

In: Journal of Information Science and Engineering, Vol. 17, No. 4, 01.07.2001, p. 647-665.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Heuristic algorithm for optimal design of the two-level wireless ATM network

AU - Din, Der-Rong

AU - Tseng, S. S.

PY - 2001/7/1

Y1 - 2001/7/1

N2 - In this paper, we investigate the optimal assignment problem of cells in PCS (Personal Communication Service) to switches in a wireless ATM network. Given cells and switches on an ATM network (whose locations are fixed and known), the problem is grouping cells into clusters and assigning these clusters to the switches in an optimum manner. This problem is modeled as a complex integer programming problem and finding an optimal solution of this problem is NP-complete. A three-phase heuristic algorithm MCMLCF (Maximum cell and minimum local communication first) consisting of Cell Pre-Partitioning Phase, Cell Exchanging Phase, and Cell Migrating Phase, is proposed. First, in the Cell Pre-Partitioning Phase, a three-step procedure (Clustering Step, Packing Step, and Assigning Step) is proposed to group cells into clusters. Second, Cell Exchanging Phase is proposed to greatly improve the result by repeatedly exchanging two cells in different switches. Finally, Cell Migrating Phase is proposed to reduce cost by repeatedly migrating all cells in a used switch to an empty switch. Experimental results indicate that the proposed algorithm runs efficiently. Comparing the results of the algorithm to a naive heuristic called NSF, we have shown that the computation time is reduced by 30.1%. Experimental results show that Cell Exchanging and Cell Migrating phases can reduce the total cost by 34.1% on average. By comparing the results of the proposed algorithm to the genetic algorithm, the heuristic method came close to optimum - on average within 5%.

AB - In this paper, we investigate the optimal assignment problem of cells in PCS (Personal Communication Service) to switches in a wireless ATM network. Given cells and switches on an ATM network (whose locations are fixed and known), the problem is grouping cells into clusters and assigning these clusters to the switches in an optimum manner. This problem is modeled as a complex integer programming problem and finding an optimal solution of this problem is NP-complete. A three-phase heuristic algorithm MCMLCF (Maximum cell and minimum local communication first) consisting of Cell Pre-Partitioning Phase, Cell Exchanging Phase, and Cell Migrating Phase, is proposed. First, in the Cell Pre-Partitioning Phase, a three-step procedure (Clustering Step, Packing Step, and Assigning Step) is proposed to group cells into clusters. Second, Cell Exchanging Phase is proposed to greatly improve the result by repeatedly exchanging two cells in different switches. Finally, Cell Migrating Phase is proposed to reduce cost by repeatedly migrating all cells in a used switch to an empty switch. Experimental results indicate that the proposed algorithm runs efficiently. Comparing the results of the algorithm to a naive heuristic called NSF, we have shown that the computation time is reduced by 30.1%. Experimental results show that Cell Exchanging and Cell Migrating phases can reduce the total cost by 34.1% on average. By comparing the results of the proposed algorithm to the genetic algorithm, the heuristic method came close to optimum - on average within 5%.

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

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

M3 - Article

VL - 17

SP - 647

EP - 665

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

SN - 1016-2364

IS - 4

ER -