ASIA unversity:Item 310904400/4725
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 90429/105609 (86%)
造访人次 : 10285878      在线人数 : 133
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


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


    题名: Heuristic Algorithm for Optimal Design of the Two-Level Wireless ATM Network
    作者: D. R. Din;S. S. Tseng
    贡献者: Department of Information Science and Applications
    日期: 2001-07
    上传时间: 2009-11-30 16:03:17 (UTC+8)
    出版者: Asia University
    摘要: 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%. ? 2001 Institute of Information Science, Academia Sinica.
    關聯: Journal of Information Science and Engineering 17(4):647-666
    显示于类别:[行動商務與多媒體應用學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    0KbUnknown253检视/开启
    310904400-4725.doc38KbMicrosoft Word313检视/开启


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


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