| Summary: | 碩士 === 元智大學 === 資訊工程學系 === 93 === In general, the multicast routing and wavelength assignment (MC-RWA) can be subdivided as routing and wavelength assignment issues in WDM mesh networks. Previous studies on WDM multicast have mainly focused on the WDM multicast routing. The multicast wavelength assignment problem is studied in this paper. A unicast routing path can be established by a lightpath in an all-optical network. However, in multicasting case, a multicast routing tree can be established by a single light tree or several lightpaths, or a combination of several light trees and lightpaths. We propose a wavelength assignment algorithm to find an optimal combination of lightpaths and light trees to construct a new arrival multicast session. First of all, two cost functions are given to evaluate the establishing cost for each feasible wavelength, and then find a set of wavelength which covers all destinations with the minimal cost using Integer Linear Program (ILP) formulation. We focus on maximizing the total number of users served in a multicast session and the network capacity. The simulation results show that the proposed algorithm can improve system resource utilization and reduce the blocking probability, compared with the First-Fit algorithm.
|
|---|
