國立臺灣大學電機工程學系暨研究所廖婉君2006-07-252018-07-062006-07-252018-07-062004-07-31http://ntur.lib.ntu.edu.tw//handle/246246/7985本年度計畫主要研究分波長多工全光 網路(WDM all-optical networks)中群播樹 之路由演算法的設計。我們所針對的環境 是網路中僅有部分的光交換機具有分光器 (power splitter)， 因此只有部分的網路節 點可作為群播樹的分叉點。目前相關研究 大都是結合史坦爾樹(Steiner tree)演算法以 及重新路由(rerouting)機制，這類作法的 主要缺點是其所產生的群播樹會使用較多 的網路連結(link)，因而較浪費網路資源。 在本年計畫中我們提出演算法改進此缺 點，藉由模擬驗證，我們所提出的演算法 使用較少網路資源。此外，我們亦分析所 提出的演算法在壞情況下之效能，並討論 延申此演算法以支援動態群組的可能性。In this project, we formulate an optimization problem for the design of light-tree based logical topology in Wavelength Division Multiplexing (WDM) networks. The problem is comprised of two parts: (1) multicast routing and wavelength assignment of lighttrees, and (2) the design of light-tree based logical topology for multicast streams. In the first part, we use Mixed Integer Linear Programming (MILP) to solve the optimal routing and wavelength assignment problem of light-trees with an end-to-end delay bound, and obtain the optimal placement of power splitters and wavelength converters. The numerical results show that networks with just a few power splitters and wavelength converters can efficiently carry multicast data. In the second part, we extend the above formulation to design the logical topology based on light-trees for multicast streams. In our approach, a light-tree can carry data of multiple multicast streams, and data of a multicast stream may traverse multiple lighttrees to reach a receiver. The numerical results show that our approach use network resources more efficiently, as compared to the approach with a separate light-tree for a multicast stream and to the approach of transporting multicast streams over logical networks.application/pdf180824 bytesapplication/pdfzh-TW國立臺灣大學電機工程學系暨研究所分波長多工光纖網路全光網 路群播Mixed Integer linear programming (MILP)WDMmulticaslight treelogical topologyreporthttp://ntur.lib.ntu.edu.tw/bitstream/246246/7985/1/922213E002064.pdf