一種適用於區域網路與廣域網路之高可靠度群播樹
學年 87
學期 1
發表日期 1998-12-18
作品名稱 一種適用於區域網路與廣域網路之高可靠度群播樹
作品名稱（其他語言） A High Reliability Multicast Tree for LAN/WAN
著者 許獻聰; 方鄒昭聰; 徐武孝; 蕭明欽
作品所屬單位 淡江大學電機工程學系
出版者
會議名稱 一九九八年全國電信研討會=1998 National Symposium on Telecommunications
會議地點 臺北縣, 臺灣
摘要 網路會為群播服務建立一棵樹使得重複性資料可以減少, 但是一旦網路節點或傳輸線出現問題, 下游節點無法再繼續接收資料, 因此如何維持群播服務之品質是一重要之問題。本篇論文提出一種固定最小群播樹演算法去建立備用之群播樹, 此樹可以有效的解決網路中嚴重之損壞並即刻修復。此備用之群播樹建立方法是根據統計方法。模擬結果顯示此備用之群播樹可有效提高群播可靠度。 In a backbone network, a steiner multicast tree (SMT) will be established for multicast members to minimize the traffic load on network. However, a link or node may be failure by some accidental factors during transmission period. Downstream nodes respect to the failure link/node will be forced to leave this tree. To guarantee the quality of service (QoS), it is desirable to have some schemes for the multicast tree so that such termination can be avoided or at least, reduced. In this paper, we propose a fixed SMT algorithm (FSA) to construct the steiner backup multicast tree (SBMT). Based on FSA, for each 'critical' path, an alternate route with enough bandwidth will be reserved such that most fatal failures in network can be recovered immediately. The way to determine critical paths is based on the statistical analysis. The adjustment of the SMBT when nodes dynamically join or leave the SMT is also discussed. The degree of fault tolerance of proposed strategy is evaluated by simulation. Simulation results demonstrate that FAS improve the reliability.
關鍵字 骨幹網路;群播樹;非同步傳輸模式;服務品質;備選路由;可靠度;Backbone Network;Multicast Tree;Asynchronous Transfer Mode;Quality Of Service;Alternate Route;Reliability
語言 en
收錄於
會議性質 國內
校內研討會地點 淡水校園
研討會時間 19981218~19981219
通訊作者
國別 TWN
公開徵稿 Y
出版型式 紙本
出處 一九九八年全國電信研討會論文集=Proceedings of 1998 National Symposium on Telecommunications，頁46-51
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/95964 )

機構典藏連結