National Changhua University of Education Institutional Repository : Item 987654321/9942
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6491/11663
造访人次 : 24894711      在线人数 : 56
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/9942

题名: Heuristic Algorithms for Finding Light-Forest of Multicast Routing on WDM Network
作者: Din, Der-Rong
贡献者: 資訊工程系
关键词: Light-forest;Multicast routing;Wavelength division multiplexing (WDM);Heuristic algorithm;Shortest-path based
日期: 2009-01
上传时间: 2012-04-30T04:32:45Z
出版者: Institute of Information Science
摘要: Wavelength Division Multiplexing (WDM) is an important technique to make use of the large amount of bandwidths in optical fibers to meet the bandwidth requirements of applications. In this paper, two new models (MWDCRP and MCRP) of multicast routing on WDM networks are studied. In these models, it is assumed that each switch on WDM network can perform ‘drop,’ ‘continue’ and ‘drop and continue’ operations. In MWDCRP, given the multicast request and the delay constraint, the goal is to find a minimal wavelength light-forest to route the multicast request under the delay constraint. In MCRP, the objective cost of the multicast routing problem has two components: one is the transmitting cost, the other is the number of used wavelengths. Given the WDM network and the multicast request, the goal is to find a minimal cost light-forest to route the multicast request. Since these problems are NP-hard, four heuristic algorithms (named as Maximal-Delay-First (MDF), miNimal-Delay-First (NDF), Farthest-Greedy (FG), and Nearest-Greedy (NG)) are proposed to solve these problems. Simulation results demonstrate that the proposed algorithms can generate good solutions.
關聯: Journal of Information Science and Engineering, 25(1): 83-103
显示于类别:[資訊工程學系] 期刊論文

文件中的档案:

档案 大小格式浏览次数
index.html0KbHTML575检视/开启


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

 


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