A Study on Dynamic Multicast-Routing Algorithms in WDM Networks

• Main Authors: Hyin-Yu Lee, 李欣育
• Other Authors: Jieh-Chian Wu
• Format: Others
• Language: zh-TW
• Published: 2002
• Online Access: http://ndltd.ncl.edu.tw/handle/35333493330455826752

碩士 === 國立高雄第一科技大學 === 電腦與通訊工程所 === 90 === This thesis is to consider the dynamic multicast routing in WDM networks with sparse light splitting. The objective of this thesis is to solve the routing problem of WDM multicast routing with the constraints that (i) the capabilities of power splitting in the network are sparse, and (ii) the multicast sessions (including unicast and broadcast) dynamically possess network resources. We propose employing the concept of light-forest to construct a multicast routing with the guideline that the network resources must be dynamic allocated effectively and the overall network performance is maintained. To achieve this objective, we propose the four link-cost function, namely, Pack, Spread, Available wavelengths (AW) and Total wavelengths and Available wavelengths (TAW),defined the cost of using a particular network resource based on the availability of the resources. We also evaluate the performance in term of blocking probability, average power loss, and average network delay in dynamic multicast sessions with sparse light splitting in WDM network. In simulation data result show that in performance of blocking and power-loss, Spread, AW and TAW with distributive use of network resource can achieve better performance than Pack with collective use of network resource in WDM network with sparse light splitting. In overall performance, TAW has the best performance.