二次節點碰觸於多波長分割光纖網路群撥回復演算法

A novel multicast restoration scheme with 2-tuple domination core node selection algorithm in DWDM mesh networks

陳寬蓬(Kung-Peng Chen)

指導教授 ： 黃依賢

元智大學/資訊學院/資訊工程學系/碩士(2008年)

https://doi.org/10.6838/YZU.2008.00273

摘要

本文提出了全心二次節點碰觸演算法用於群撥容錯多波長分割網路，2-DS 的定義為每個在群撥群組裡面的節點至少一次碰觸再樹外面，另一次的碰觸為樹裡面，這篇論文主要的目標在於藉由核心節點的選擇提供快速有效而且穩定的容錯能力。每個核心節點。無線通訊資源管理方法可重新分配突發屬性及動態調整各使用者的頻寬分配以增進資源的使用率。而所提出的階層式優先權佇列排程演算法使用階層式之排程架構，並針對各別的資料流型態使用適當的排程演算法。更進一步來說，此方法獨立針對多點傳播之服務品質保證來探討。模擬結果顯示所提出的方法可以得到較低的延遲時間，較好的頻寬使用率和較高的吞吐量。

關鍵字

二次節點碰觸，核心節點選擇，兩棵樹，多重環容錯

並列摘要

This paper describes a novel 2-tuple domination core node selection algorithm for the multicast restoration scheme in WDM mesh networks. The 2-tuple dominating set (2-DS) is defined as each node in multicast tree session must be directly connected to at least one core node in multicast tree session and also has to be directly connected to at least one core node out of multicast tree session. The primary aim of this work is to provide the fast and steady local survivability based on the information from the selected core nodes. The core nodes are responsible for searching the routing path and wavelength assignment, and each core node has a routing table, core routing table (CRT), which records the updated information between current core node and destination core nodes. When fault occurs, the upstream node adjacent to the failed link or the failed node needs to find the recovery paths for each affected destination node which includes three paths: (1) the path from upstream node of the failed link or the parent node of the failed node to the dominating core node, Score, (2) the path between the dominating core node, Score, near the fault and core node dominates the affected destination nodes, Dcore, (3) and the path from the dominating core node, Dcore to the affected destination nodes. Simulation results show that the proposed algorithm outperforms the Dual-tree and MRLR algorithms in terms of total hop counts needed for all recovery paths, blocking probability and restoration time for different network topologies.

並列關鍵字

2-tuple domination core node selection algorithm, multicast restoration scheme, Dual-tree, MRLR

參考文獻

[2] A. Karaman and H. Hassanein, “Core-selection algorithms in multicast routing - comparative and complexity analysis”, Computer Communications, Vol. 29, Issue 8, pp. 998-1014, May 2006.

[3] S.W. Tan, G. Waters and J. Crawford, “A multiple shared trees approach for application layer multicasting”, IEEE International Conference on Communications, Vol. 3, pp. 1456-1460, June 2004.

[4] H. Cancelaa and L. Petingib, “Properties of a generalized source-to-all-terminal network reliability model with diameter constraints”, International Journal of Management Science, Vol. 35, Issue 6, pp. 659-670, Aug 2006.

[5] L. Sahasrabubuddhe and B. Mukherjee, “Light trees optical multicasting for improved performance in wavelength routed networks”, IEEE Communication Magazine, Vol. 37, No. 2, pp. 67-73, 1999.

[9] J. Moy, “Multicast extensions to OSPF”, technical memo, RFC 1584, Mar. 1994.