National Changhua University of Education Institutional Repository : Item 987654321/9939

English | 正體中文 | 简体中文 | Items with full text/Total items : 6507/11669
Visitors : 29910718 Online Users : 351

RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope Adv. Search

Login ‧ Upload ‧ Help ‧ About ‧ Administer

NCUEIR > College of Engineering > Department and Graduate Institute of Computer Science and Information Engineering > Periodical Articles > Item 987654321/9939

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/9939

Title:	Genetic algorithm for finding minimal cost light-forest of multicast routing on WDM network
Authors:	Din, Der-Rong
Contributors:	資訊工程系
Date:	2008-01
Issue Date:	2012-04-30T04:32:42Z
Publisher:	Hindawi Publishing Corp
Abstract:	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.
Relation:	Journal of Artificial Evolution and Applications Volume 2008, Article ID 536913, 20 pages
Appears in Collections:	[Department and Graduate Institute of Computer Science and Information Engineering] Periodical Articles

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	591	View/Open

Loading...