光波分割多工光徑光纖網路上流量疏導之研究

Traffic Grooming in Light-trail Optical WDM Networks

莊元曦(Yuan-Xi Zhuang)

指導教授 ： 林華君

國立清華大學/電機資訊學院/資訊工程學系所/博士(2020年)

摘要

光徑是一種單向的節點到節點的全光式波段，主要優點是光徑所經過的中繼節
點也能透過光徑上傳和下載資料，因此在流量疏導上提供了更大的彈性。 流量疏導
技術能夠允許多個小流量的連線需求透過一個高速的通訊通道傳輸，藉此提升頻譜
使用率。 本博士論文將分別研究使用光波分割多工技術的光徑網路下的靜態和動態
流量疏導問題。
首先，我們研究使用光波分割多工技術的光徑網路下的靜態流量疏導問題， 我
們的目標是最大化網路的流通量。我們提出了一個先進的啟發式演算法能夠根據光
徑的有效頻寬使用率來挑選承載連線需求的光徑。 實驗結果顯示我們所提出的演算
法相較先前文獻的演算法有更高的網路的流通量。
接著， 我們研究使用光波分割多工技術的光徑網路下的動態流量疏導問題。 在
以往的研究中，已有數種針對光徑網路下的動態流量疏導問題所提出的輔助圖模型。
我們發現這些輔助圖模型都存在至少一個以上無法反映光徑特性的缺陷。我們著眼
於改善這些舊有輔助圖的缺陷，提出一個能夠完整反映光徑特性的全新的輔助圖模
型。藉由所提出的輔助圖模型，我們設計了兩個有效的動態流量疏導演算法。實驗
結果顯示我們所提出的輔助圖模型和動態流量疏導演算法相較先前文獻的輔助圖和
演算法有更低的連線阻擋率。
最後， 我們研究使用光波分割多工技術的光徑網路下的動態群播流量疏導問題，
研究目標是降低連線阻擋率。 我們提出一個輔助圖以協助進行光徑網路下的繞徑與
流量疏導。 藉由所提出的輔助圖模型， 我們提出了兩個有效的動態群播流量疏導演
算法。實驗結果顯示我們所提出動態群播流量疏導演算法相較先前文獻的動態群播
流量疏導演算法有更低的連線阻擋率。

關鍵字

光纖網路 ； 光波分割多工網路 ； 流量疏導 ； 光徑 ； 輔助圖 ； 單播 ； 群播

並列摘要

A light trail in a wavelength-division multiplexing (WDM) optical network is an optical communication channel that allows intermediate nodes to access the channel providing the flexibility for multiplexing traffic of multiple connections into the optical communication channel at intermediate nodes. Traffic grooming technique is able to multiplex multiple low-rate connections into a single high-speed communication channel in order to increase channel utilization in optical WDM networks. This dissertation studies static and dynamic traffic grooming problems in light-trail optical WDM mesh networks.
First of all, given a set of traffic demands in the network, we study the problem of designing a set of light trails to accommodate as much traffic as possible. We propose a novel heuristic algorithm to select a set of light trails based on effective bandwidth utilization. The proposed heuristic algorithm is shown to yield a high throughput ratio via simulation.
Next, we study the dynamic unicast traffic grooming problem that deals with dynamically arriving and departing connection requests in light-trail optical WDM mesh networks. In the literature, several auxiliary graph models have been developed for traffic grooming in light-trail optical WDM mesh networks. These auxiliary graph models have one or more drawbacks that do not fully reflect the characteristics of a light trail. We develop a novel auxiliary graph model that has none of these drawbacks and can reflect all the characteristics of a light trail. Based on this auxiliary graph model, we propose two effective dynamic unicast traffic grooming algorithms. The proposed dynamic traffic grooming algorithms are shown to yield low request blocking ratios via simulation.
Finally, we study the problem of dynamic multicast traffic grooming in light-trail WDM optical networks. Our objective is to reduce blocking ratio. We propose an auxiliary graph model for light-trail WDM optical networks that can be used for routing and traffic grooming purposes. Based on the auxiliary graph model, two dynamic multicast traffic grooming algorithms are studied. Compared with existing algorithms in the literature, the
two algorithms yield significantly better performance.

並列關鍵字

optical network ； WDM network ； traffic grooming ； light trail ； auxiliary graph ； unicast ； multicast

參考文獻

[1] C. A. Brackett, “Dense wavelength division multiplexing networks: principles and ap-plications,” IEEE J. Sel. Areas Commun., vol. 8, no. 6, pp. 948–964, Aug. 1990.

[2] J. Zheng and H. T. Mouftah, Optical WDM Networks: Concepts and Design Principles. John Wiley & Sons, 2004.

[3] A. K. Dutta, N. K. Dutta, and M. Fujiwara, WDM Technologies: Optical Networks. Elsevier, 2004.

[4] A. Gumaste and I. Chlamtac, “Mesh implementation of light-trails: a solution to IP cen-tric communication,” in Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712), pp. 178–183, Oct. 2003.

[5] A. Gumaste and I. Chlamtac, “Light-trails: an optical solution for IP transport [Invited],” J. Opt. Netw., vol. 3, no. 5, pp. 261–281, May 2004.