A genetic algorithm for solving dual-homing cell assignment problem of the two-level wireless ATM network

In this paper, we investigate the optimal assignment problem, which assigns cells in Personal Communication Service to switches on Asynchronous Transfer Mode network in an optimum manner. The cost has two components: one is the cost of handoffs that involve two switches, and the other is the cost of...

Full description

Saved in:
Bibliographic Details
Published in:Computer communications Vol. 25; no. 17; pp. 1536 - 1547
Main Authors: Din, D.-R., Tseng, S.S.
Format: Journal Article
Language:English
Published: Elsevier B.V 01.11.2002
Subjects:
Asynchronous transfer mode
Cell assignment
Design of algorithm
Dual-homing
Genetic algorithm
Genetic algorithms
Networks
Wireless ATM
Dual-homing
Design of algorithm
Cell assignment
Genetic algorithm
Wireless ATM
ISSN:0140-3664, 1873-703X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we investigate the optimal assignment problem, which assigns cells in Personal Communication Service to switches on Asynchronous Transfer Mode network in an optimum manner. The cost has two components: one is the cost of handoffs that involve two switches, and the other is the cost of cabling. This problem is model as dual-homing cell assignment problem, which is a complex integer programming problem. Since finding an optimal solution of this problem is NP-hard, a stochastic search method, based on a genetic approach, is proposed to solve this problem. In this paper, domain-dependent heuristics are encoded into crossover operations, mutations of genetic algorithm (GA) to solve this problem. Simulation results show that GA is robust for this problem.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0140-3664
1873-703X
DOI:10.1016/S0140-3664(02)00086-5