数据加载中.....

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

题名:  Genetic algorithm for finding minimal cost lightforest of multicast routing on WDM network 
作者:  Din, DerRong 
贡献者:  資訊工程系 
日期:  200801

上传时间:  20120430T04:32:42Z

出版者:  Hindawi Publishing Corp 
摘要:  Wavelength division multiplexing (WDM) is an important technique to make use of the large amount of bandwidth in optical fibers to meet the bandwidth requirements of applications. Multicast is the transmission of information from one source to multiple destinations simultaneously. Given a multicast request in a WDM network, the goal is to find a set of light trees, the assigned wavelengths of light trees, and construct a light forest. In this paper, the minimal cost multicast routing problem (MCMRP) on WDM networks with tapandcontinue (TaC) nodes is defined and studied. A new cost model which consists of the wavelength usage and communication cost is defined. The objective is to minimize the sum of the cost of used wavelengths and the communication cost of the light forest. Specifically, the formulation for the WDM multicast routing problem is given. Because the MCMRP is NPhard, two genetic algorithms (GAs) are proposed to solve this problem. In the proposed GAs, a pathoriented encoding chromosome is used to represent the routing paths. These routing paths are used to construct sourcebased light forests to represent a feasible solution to the multicast request. Moreover, to speed up the convergence of GAs, a farthestfirst greedy heuristic algorithm is proposed and used to generate one of the initial chromosomes. Simulation results demonstrate that the proposed GAs can run efficiently. 
關聯:  Journal of Artificial Evolution and Applications Volume 2008, Article ID 536913, 20 pages 
显示于类别:  [資訊工程學系] 期刊論文

文件中的档案:
档案 
大小  格式  浏览次数 
index.html  0Kb  HTML  582  检视/开启 

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