English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6491/11663
Visitors : 24735032      Online Users : 54
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/9930

Title: Heuristic and Hybrid Methods for Solving Optimal Multiple Multicast Problem on WDM Ring Network
Authors: Din, Der-Rong
Contributors: 資訊工程系
Keywords: Multiple multicast;WDM;Heuristic algorithm;Simulated annealing
Date: 2005
Issue Date: 2012-04-30T04:32:02Z
Publisher: Springer
Abstract: The Optimal Multiple Multicast Problem (OMMP) on wavelength division multiplexing (WDM)
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 such that not
any pair of paths using the same wavelength pass through the same link. In this paper, a formulation of
OMMP is given; this problem is NP-hard since the famous RWA problem which has been proved NP-hard
is a special case of OMMP. In this paper, the OMMP is divided into two subproblems: path routing and
wavelength assignment subproblems. For each subproblem, two heuristic algorithms are proposed to solve
it. Moreover, a hybrid method which combines heuristic and simulated annealing algorithm is proposed to
find the near optimal solution. Experimental results indicate that these algorithms are efficient.
Relation: Telecommunication Systems, 28(2): 245-262
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

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