English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6507/11669
Visitors : 30718651      Online Users : 344
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/9924

Title: Hybrid Algorithm for Dual-Homing Cell Assignment Problem in Wireless ATM
Authors: Din, Der-Rong
Contributors: 資訊工程系
Keywords: Cell assignment;Dual-homing;Heuristic algorithm;NP-hard;Simulated annealing;Wireless ATM
Date: 2004-07
Issue Date: 2012-04-30T04:31:11Z
Publisher: Oxford University Press
Abstract: In this paper, the optimal assignment problem which assigns cells in PCS (Personal Communication Service) to switches on ATM (Asynchronous Transfer Mode) network is investigated. The cost considered in this paper has two components: one is the cost of handoff that involves two switches, and the other is the cost of cabling. This problem assumes that each cell in PCS can be assigned to two switches in ATM network. This problem is modelled as dual-homing cell assignment problem, which is a complex integral linear programming (ILP) problem. Since finding an optimal solution of this problem is NP-hard, a hybrid method which combines several heuristics and a stochastic search method (based on a simulated annealing(SA) approach) is proposed to solve this problem. The solution method consists of three phases: Primary Assignment Decision Phase (PADP), Secondary Assignment Decision Phase (SADP) and Refinement Phase (RP). The PADP and SADP are used to find good initial assignment, then domain-dependent heuristics are encoded into perturbations of SA in Refinement Phase to improve the result. Simulation results show that the proposed hybrid method is robust for this problem.
Relation: IEICE Transaction on Fundamentals of Electronics, Communications and Computer Sciences, E87-A(7): 1664-1671
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File SizeFormat
2050400110002.pdf.pdf13KbAdobe PDF558View/Open

All items in NCUEIR are protected by copyright, with all rights reserved.


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback