MPLS網路上群播服務之故障回復機制

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：48

、訪客IP：3.16.212.32

姓名

徐嘉宏(Chia-Hung Hsu) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

MPLS網路上群播服務之故障回復機制
(Fault Recovery for Multicast Services in MPLS Networks)

相關論文

★ 無線行動隨意網路上穩定品質服務路由機制之研究	★ 應用多重移動式代理人之網路管理系統
★ 應用移動式代理人之網路協同防衛系統	★ 鏈路狀態資訊不確定下QoS路由之研究
★ 以訊務觀察法改善光突發交換技術之路徑建立效能	★ 感測網路與競局理論應用於舒適性空調之研究
★ 以搜尋樹為基礎之無線感測網路繞徑演算法	★ 基於無線感測網路之行動裝置輕型定位系統
★ 多媒體導覽玩具車	★ 以Smart Floor為基礎之導覽玩具車
★ 行動社群網路服務管理系統－應用於發展遲緩兒家庭	★ 具位置感知之穿戴式行動廣告系統
★ 調適性車載廣播	★ 車載網路上具預警能力之車輛碰撞避免機制
★ 應用於無線車載網路上之合作式交通資訊傳播機制以改善車輛擁塞	★ 智慧都市中應用車載網路以改善壅塞之調適性虛擬交通號誌

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

至系統瀏覽論文 ( 永不開放)

摘要(中)

近年來在MPLS網路上的群播技術漸漸被重視，相關的協定與標準也陸續被提出，未來的網路將會是群播技術架構在MPLS網路上應用的時代，而針對MPLS上群播技術的故障回復機制卻沒有被相對地研究發展，使得群播技術一但發生了節點故障(Node Failure)或鏈路故障(Link Failure)之情形，也只能仰賴第三層的重新繞路(Layer 3 Rerouting)，會耗費大量時間在重覆做header的檢查，這對於需要即時傳輸的服務將是一大挑戰。
MPLS網絡上群播服務預先建立Backup Paths之故障回復機制可分為Global Restoration以及Local Restoration，Global Restoration為群播樹上之根節點與葉節點間任何一節點/鏈路之故障都使用相同之Backup Path，反之則為Local Restoration。
本論文提出一在MPLS骨幹網路上，為群播技術之節點故障/鏈路故障做MPLS 層的快速回復機制，並透過BR因子量化，以選擇在考量頻寬與故障回復時間下之最佳平衡點，其中BR因子之分子項為Backup Path之頻寬使用率，分母項為故障回復時間。經由模擬結果可以發所現提出之演算法經由BR因子量化後，可在現有之Local Restoration演算法中，取得最佳頻寬利用率－故障回復時間比。

摘要(英)

Recently, the technology of multicast services in MPLS networks has been put importance gradually, and the related standards and researches have been proposed continually. In future network, applications of the multicast technology over MPLS networks architecture will be a mainstream, however, the fault recovery mechanism has not been developed relatively. Once nodes failure or links failure occurs, the technique of layer 3 rerouting is the only solution. Nevertheless, it takes too much time to repeat examining header, and this is an obstacle to real time services.
The recovery model, which pre-establishes backup paths and be classified into global restoration and local restoration. In global restoration, recovery of node failures and link failures between the root and the leaf uses the same backup path. On the other hand, local restoration uses different backup paths.
In this paper, we propose quick recovery mechanisms for node failures and link failures of multicasting services on the MPLS networks. In addition, through the transformation of BR factor, we select the balance point, which is faster and waste less bandwidth of pre-established backup paths. In BR factor, the denominator is the bandwidth utilization of backup paths, and the numerator of BR factor is recovery time. Simulation results show that our algorithms can obtain the best ratio between the bandwidth utilization and the recovery time in each local restoration algorithm.

關鍵字(中)

★ 群播技術
★ 多重協定標籤交換網路
★ 故障回復

關鍵字(英)

★ fault recovery
★ BR factor
★ pre-establish
★ multicast
★ MPLS

論文目次

第一章緒論 1
1.1 概要 1
1.2 研究動機 2
1.3 研究目的 3
1.4 章節架構 3
第二章背景知識與相關研究 4
2.1 MPLS網路 4
2.2 Label Distribution 6
2.2.1 LDP 7
2.2.2 CR-LDP 10
2.2.3 RSVP-TE 11
2.3 Multicast 12
2.3.1 Group-Shared Tree 13
2.3.2 Source-Based Trees 13
2.4 現有之MPLS網路上群播服務故障回復架構與演算法之研究 14
第三章網路模型與環境假設 20
3.1 網路模型 20
3.2 環境假設 21
第四章所提出之故障回復機制 24
4.1參數說明 24
4.2 垂直回復演算法 (Vertical Recovery Algorithm, VRA) 26
4.3 水平回復演算法 (Horizontal Recovery Algorithm, HRA) 33
4.4 Backup Paths之頻寬預留 40
第五章模擬結果與討論 41
5.1 模擬環境說明 41
5.2 封包大小之影響 48
5.3 群播要求到達率之影響 51
5.4 複雜度分析 53
5.5 服務時間長短之影響 55
5.6 網路拓樸之影響 56
5.7 BR factor 63
5.8 增加節點之影響 64
第六章結論與未來發展方向 67
6.1結論 67
6.2未來發展方向 68
參考文獻 72

參考文獻

[1] Virtual Network on Top of Internet, http://www.ascc.net/nl/86/1321/03.txt.
[2] E. Rosen, A. Viswanathan and R. Callon, “Multiprotocol Label Switching Architecture,” RFC3031, Jan. 2001.
[3] ATM Forum, http://www.atmforum.com/.
[4] Introduction to MPLS, http://eservice.seed.net.tw/class/class0801c.html.
[5] Seednet MPLS VPN, http://product.seed.net.tw/vpn/mplsvpn-index.shtml.
[6] V. Sharma, F. Hellstrand, “Framework for Multi-Protocol Label Switching (MPLS)-based Recovery,” RFC3469, Feb. 2003.
[7] L. Andersson, P. Doolan, N. Feldman, A. Fredette, B. Thomas, “LDP Specification,” RFC3036, Jan. 2001.
[8] Multiprotocol Label Switching (MPLS) Charter, http://www.ietf.org/ html.charters/mpls-charter.html.
[9] Chuck Semeria, “Multiprotocol Label Switching- Enhancing Routing in the New Public Network,” White Paper, Juniper, Sep. 2000.
[10] F. L. Faucheur, L. Wu, B. Davie, S. Davari, P. Vaananen, R. Krishnan, P. Cheval, J. Heinanen, “Multi-Protocol Label Switching (MPLS) Support of Differentiated Services,” RFC3270, May 2002.
[11] Uyless Black, “MPLS and Label Switching Networks,” Prentice Hall PTR, 2001.
[12] B. Jamoussi, L. Andersson, R. Callon, R. Dantu, L. Wu, P. Doolan, T. Worster, N. Feldman, A. Fredette, M. Girish, E. Gray, J. Heinanen, T. Kilty, A. Malis, “Constraint-Based LSP Setup using LDP,” RFC3212, Jan. 2002.
[13] D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, J. McManus, “Requirements for Traffic Engineering Over MPLS,” RFC2702, Sept. 1999.
[14] D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, G. Swallow, “RSVP-TE: Extensions to RSVP for LSP Tunnels,” RFC3209, Dec. 2001.
[15] 宋萬鵬, “多協定標記交換(MPLS)流量工程－標記分配協定的選擇,” 專業版-計算機互動網, http://www.china-pub.com/computers /eMook/1534/info.htm. May 2002.
[16] P. Brittain, A.n Farrel, “MPLS Traffic Engineering: A Choice of Signaling Protocols,” Jan. 2000.
[17] S. Deering, “Host Extensions for IP Multicasting,” RFC1112, Aug. 1989.
[18] Multicast related references, http://www.dante.net/mbone/refs/drafts.html.
[19] Y. Pointurier, “Link Failure Recovery for MPLS Networks with Multicasting,” Master thesis, Department of Computer Science, University of Virginia, Aug. , 2002.
[20] M. Kodialam, T. V. Lakshman, “Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup,” Proceedings of the 10th IEEE International Conference on Network Protocol, Paris, France, Nov. 2002.
[21] N. K. Singhal, L. H. Sahasrabuddhe, and B. Mukherjee, “Protecting a Multicast Session Against Single Link Failure in a Mesh Network,” Proceedings of IEEE International Conference on Communications, Anchorage Alaska, USA, May 2003.
[22] A. Ballardie, “Core Based Trees (CBT) Multicast Routing Architecture,” RFC2201, Sep. 1997.
[23] A. Ballardie, “Core Based Trees (CBT version 2) Multicast Routing Architecture,” RFC2189, Sep. 1997.
[24] G. Baneriee and D. Sidhu, “Label Switched Path Restoration under Two Random Failure,” Proceedings of IEEE GLOBECOM, San Antonio, USA, Nov. 2001.
[25] Y. A. Kim, J. K. Choi, “Analysis of the End-to-End Protection and Restoration Algorithm in the IP over WDM Network,” Proceedings of the 16th International Conference on Information Networking, Cheju Island, Korea, Feb. 2002.
[26] L. Li, M. M. Buddhikot, C. Chekuri, K. Guo, “Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks,” Proceedings of the 10th IEEE International Conference on Network Protocol, Paris, France, Nov. 2002.
[27] The Network Simulator – ns-2, http://www.isi.edu/nsnam/ns/
[28] Sub-100ms Convergence, http://www.ripe.net/ripe/meetings/archive/ripe-41/ presentations/eof-mpls-frr/sld001.html.
[29] Y. Lee and J. M. Tien, “Static and Dynamic Approaches to Modeling End-to-End Routing in Circuit-Switched Networks,” IEEE/ACM Transactions on Networking, Vol. 10, No.5, Oct. 2002.

指導教授

周立德(Li-Der Chou)

審核日期

2003-7-20

推文