National Changhua University of Education Institutional Repository : Item 987654321/9924
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6507/11669
造访人次 : 29732386      在线人数 : 464
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/9924

题名: Hybrid Algorithm for Dual-Homing Cell Assignment Problem in Wireless ATM
作者: Din, Der-Rong
贡献者: 資訊工程系
关键词: Cell assignment;Dual-homing;Heuristic algorithm;NP-hard;Simulated annealing;Wireless ATM
日期: 2004-07
上传时间: 2012-04-30T04:31:11Z
出版者: Oxford University Press
摘要: 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.
關聯: IEICE Transaction on Fundamentals of Electronics, Communications and Computer Sciences, E87-A(7): 1664-1671
显示于类别:[資訊工程學系] 期刊論文

文件中的档案:

档案 大小格式浏览次数
2050400110002.pdf.pdf13KbAdobe PDF545检视/开启


在NCUEIR中所有的数据项都受到原著作权保护.

 


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