English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6481/11653
Visitors : 23383073      Online Users : 284
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/9942

Title: Heuristic Algorithms for Finding Light-Forest of Multicast Routing on WDM Network
Authors: Din, Der-Rong
Contributors: 資訊工程系
Keywords: Light-forest;Multicast routing;Wavelength division multiplexing (WDM);Heuristic algorithm;Shortest-path based
Date: 2009-01
Issue Date: 2012-04-30T04:32:45Z
Publisher: Institute of Information Science
Abstract: 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.
Relation: Journal of Information Science and Engineering, 25(1): 83-103
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File SizeFormat
index.html0KbHTML536View/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