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


题名: Genetic algorithm for finding minimal cost light-forest of multicast routing on WDM network
作者: Din, Der-Rong
贡献者: 資訊工程系
日期: 2008-01
上传时间: 2012-04-30T04: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 tap-and-continue (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 NP-hard, two genetic algorithms (GAs) are proposed to solve this problem. In the proposed GAs, a path-oriented encoding chromosome is used to represent the routing paths. These routing paths are used to construct source-based light forests to represent a feasible solution to the multicast request. Moreover, to speed up the convergence of GAs, a farthest-first 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
显示于类别:[資訊工程學系] 期刊論文


档案 大小格式浏览次数



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