National Changhua University of Education Institutional Repository : Item 987654321/9957
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6507/11669
Visitors : 30051876      Online Users : 852
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

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

Title: Genetic Algorithms for Multiple Multicast on WDM Ring Network
Authors: Din, Der-Rong
Contributors: 資訊工程系
Keywords: Genetic algorithm;Multiple multicasts;Wavelength division multiplexing rings;Single-hop;Drop and continuous
Date: 2003-10
Issue Date: 2012-04-30T07:13:37Z
Publisher: 國立成功大學
Abstract: The optimal multiple multicast problem (OMMP) on wavelength division multiplexing ring networks without wavelength conversion is considered in this paper. When the physical network and the set of multicast requests are given, OMMP is the problem that selects a suitable path or (paths) and wavelength (or wavelengths) among the many possible choices for each multicast request under the constraint that not any paths using the same wavelength pass through the same link such that the number of used wavelengths is minimized. This problem can be proven to be NP-hard. In the paper, a formulation of OMMP is given and several genetic algorithms (GAs) are proposed to solve it. Experimental results indicate that the proposed GAs are robust for this problem.
Relation: 2003 Symposium on Digital Life and Internet Technologies, Workshop 2:Broadband and Wireless Networks, National Cheng Kung University, Taiwan, Oct. 14-15, 2003
Appears in Collections:[Department and Graduate Institute of Computer Science and Information Engineering] Proceedings

Files in This Item:

File SizeFormat
2050400116002.pdf.pdf12KbAdobe PDF483View/Open


All items in NCUEIR are protected by copyright, with all rights reserved.

 


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