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


    题名: Dynamic multicast routing under delay constraints in WDM networks with heterogeneous light splitting capabilities
    作者: M. T. Chen;S. S. Tseng;B. M. T. Lin
    贡献者: Department of Information Science and Applications
    关键词: RWA;Multicast request;WDM network;Delay bound;Light splitting capacity;Multicast cost
    日期: 2005-05
    上传时间: 2009-11-30 16:03:27 (UTC+8)
    出版者: Asia University
    摘要: Because optical WDM networks will be realized as network backbone in the near future, multicasting in WDM networks needs to be supported for various network applications. In this paper, we propose a new dynamic multicast routing problem under delay constraints (DMR-DC) for finding an optimal light-forest with the minimum multicast cost from these links with available wavelengths for routing a multicast request that arrives in random with a given delay bound in a WDM network with heterogeneous light splitting capabilities, where a light-forest is a set of light-trees used to set up switches to route the request. Multicast cost is defined by communication cost ratio and wavelength consumption ratio. The problem is to determine a light-forest with less wavelength consumption and less communication cost. This problem is NP-hard because it can be reduced from the minimum Steiner tree problem. In this paper, we propose an efficient three-phase (generation, refinement, and conversion) solution model to find approximate solutions in a reasonable time.
    關聯: Computer Communications 29(9):1492-1503
    显示于类别:[行動商務與多媒體應用學系] 期刊論文


    档案 描述 大小格式浏览次数
    310904400-4760.doc40KbMicrosoft Word269检视/开启


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