跳到主要內容

臺灣博碩士論文加值系統

(18.97.9.169) 您好!臺灣時間:2025/03/20 16:01
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:吳誌軒
研究生(外文):Chih-Hsuan Wu
論文名稱:支援 IP 群播樹區域快速重新繞送機制之設計與效能分析
論文名稱(外文):Design and Performance Evaluation of Local Fast Reroute Scheme for IP Multicast Tree
指導教授:蘇暉凱
指導教授(外文):Hui-kai Su
學位類別:碩士
校院名稱:國立虎尾科技大學
系所名稱:電機工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2012
畢業學年度:100
語文別:中文
論文頁數:55
中文關鍵詞:PIM-SM群播保護多點群播服務品質共享樹即時性
外文關鍵詞:Multicast protectionShare treeQoSReal time
相關次數:
  • 被引用被引用:0
  • 點閱點閱:361
  • 評分評分:
  • 下載下載:1
  • 收藏至我的研究室書目清單書目收藏:0
近年來,因網路的快速發展,即時性多媒體的應用服務越來越多,如:IPTV、MoD 與 Video Conference,使得網際網路群播服務可使用性 (Network Availability) 越來越受重視,因此也成為網路服務業者 (Internet Service Provider, ISP) 的重要服務品質參數。目前,IP 網路處理網路中斷有兩種類型:IP Restoration 與 IP Protection。IP Multicast Restoration 是一種事後處理方法,當錯誤發生後,網路設備透過路由協定相互交換新的網路狀態,並學習新的路由資訊,在有其他存活路徑的情況下,恢復傳輸服務。而另一種,IP Multicast Protection 是一種事先主動分析網路路由方法,在網路設備損壞或線路中斷前,事先準備好各種處理方式,一旦網路中斷發生,立即將受影響的封包快速繞送到不受影響的節點上。我們以 PIM-SM (Protocol Independent Multicast – Spares Mode) 群播路由協定為基礎,Router 會根據所建立的 Multicast Tree 結構將 Multicast Packets 傳送至每一個 End User,一旦中間有連線斷線或 Router 損壞,下游所有 End User 將直接受到影響,損壞的部份如果越靠近 RP,受影響的程度越大。所以我們提出 Tree-Based 方法在 IP Multicast 的環境下來對於群播樹做區域的快速路由,並利用 ns2 模擬此機制與分析效能。我們將觀察封包遺失和控制訊息量,來分析比較與原本的群播路由協定傳輸效能的差異性,最後模擬數據部分在第五章節會說明成果。

Recently, more and more real-time multimedia application services are provided over Internet, such as IPTV, MoD, Video Conference, etc. For the real-time multimedia applica-tions that network availability is one of the important QoS (Quality of Service) parameters in IP multicast transport networks. The two types of approaches to improve network resilience in the IP layer are IP restoration and IP protection. IP restoration attempts to find a new route by which to restore connectivity once a failure has occurred, e.g., Interior Gateway Protocol (IGP) routing recovery. IP protection, the intention of which is to achieve rapid recovery from failure (in just a few milliseconds), is based on fixed and predetermined failure recovery, where the selection of the next-hop is performed in conjunction with the identification of a backup for the next-hop. In IP multicast, they were very serious affected of real-time services when the failure happened in the multicasting tree of link or node. While the upper node or link in multicast tree has failure, it would affect all of downstream end-user. In this thesis, we pro-pose a Tree-Based Local Fast Reroute scheme for IP multicast tree with two algorithms for share-tree node protection and link protection in the intra-area multicast routing. Finally, the network simulator ns2 was used to demonstrate the performances of packet loss and control overhead.

摘要.....................i
Abstract................ii
誌謝.....................iii
目錄.....................iv
表目錄...................vi
圖目錄...................vii
第一章 緒論.............1
1.1 研究背景.....................1
1.2 研究動機與目的................2
1.3 論文架構.....................3
第二章 相關研究與知識................4
2.1 IP Multicast................4
2.2 多點群播路由協定與群播樹種類.......5
2.2.1 CBT (Core Base Tree)..........7
2.2.2 PIM-DM (Protocol Independent Multicast - Dense Mode).............8
2.2.3 PIM-SM (Protocol Independent Multicast - Sparse Mode).............9
2.3 網路單播保護 (IP Unicast Protection) 與群播保護 (IP Multicast Protection) 機制.....................12
2.3.1 Loop-Free Alternate Path (LFAP).............12
2.3.2 Equal-Cost Multi Path (ECMP).....................15
2.3.3 IP Fast Reroute Using Not-via Addresses.............15
第三章 系統架構.....................17
3.1 於群播環境中對單一鏈結保護之機制設計...............17
3.2 於群播環境中對單一節點保護之機制設計...............21
第四章 案例說明.....................26
4.1 網路環境拓樸.....................26
4.2 Tree-Based 機制對於群播環境之鏈結與節點保護.............27
4.2.1 Tree-Based 機制於群播網路之鏈結保護..............27
4.2.2 Tree-Based 機制於群播網路之節點保護..............29
4.3 LFAP 機制對於群播環境之鏈結與節點保護..............31
4.3.1. LFAP 機制於群播網路之鏈結保護.....................31
4.3.2. LFAP 機制於群播網路之節點保護.....................32
4.4 LFAP 與 Tree-Based 機制的比較.....................33
第五章 環境模擬與效能分析.....................36
5.1 模擬環境.....................36
5.2 封包遺失 (Packet Loss).....................37
5.3 控制訊息 (Control Overhead).....................38
第六章 結論與未來研究方向.....................40
參考文獻.....................41
附錄一.......................44
附錄二.......................47
Extended Abstract...........49
簡歷(CV).....................55

[1]W. Fenner, "Internet Group Management Protocol, Version 2," RFC 2236, Nov. 1997.
[2]D. Waitzman, S. Deering and C. Partridge, "Distance Vector Multicast Routing Protocol," RFC 1075, Nov. 1988.
[3]J. Moy, "Multicast Extensions to OSPF," RFC 1584, March 1994.
[4]C. Metz, "IP protection and restoration," IEEE Internet Comput., vol. 4, no. 2, pp. 97-102, Mar-Apr 2000.
[5]G. Iannaccone, C.-N. Chuah, S. Bhattacharyya, and C. Diot, "Feasibility of IP restoration in a tier 1 backbone," IEEE Network, vol. 18, no. 2, pp. 13-19, Mar-Apr 2004.
[6]G. Suwala and G. Swallow, "SONET/SDH-like resilience for IP networks: a survey of traffic protection mechanisms," IEEE Network, vol. 18, no. 2, pp. 20-25, Mar-Apr 2004.
[7]P. Pan, G. Swallow, and A. Atlas, "Fast reroute extensions to RSVP-TE for LSP tunnels," RFC 4090, May 2005.
[8]M. Cotton, L. Vegoda, ICANN, D. Meyer, "IANA Guidelines for IPv4 Multicast Address Assignments," RFC 5771, March 2010.
[9]S.E. Deering, "Host Extensions for IP Multicast," RFC 1112, Aug 1989.
[10]B. Cain, S. Deering, I. Kouvelas, B. Fenner and A. Thyagarajan, "Internet Group Management Protocol, Version 3, " RFC 3376
[11]A. Ballardie, "Core Based Trees Multicast Routing – Protocol Specifica-tion," RFC 2189, Sep. 1997.
[12]A. Adams, J. Nicholas, and W. Siadak, "Protocol independent multicast - dense mode (PIM-DM): Protocol specification (revised), " RFC 3973, Jan. 2005.
[13]B. Fenner, M. Handley, H. Holbrook, and I. Kouvelas, "Protocol inde-pendent multicast - sparse mode (PIM-SM): Protocol specification (revised), " RFC 4601, Aug. 2006.
[14]M. Shand, "IP fast reroute framework," IETF Draft, June 2004, draft-ietf-rtgwg-ipfrr-framework-00.txt.
[15]A. Atlas and A. Zinin, "Basic specification for IP fast reroute: Loop-free alternates," RFC 5286, 2008.
[16]G. Retvari, J. Tapolcai, G. Enyedi, and A. Csaszar, "IP fast ReRoute: Loop Free Alternates revisited, " in Proceedings of INFOCOM, 2011.
[17]S. Bryant, S. Previdi and M. Shand, "IP Fast Reroute Using Not-via Addresses," IETF Draft, Dec. 21, 2011, draft-ietf-rtgwg-ipfrr-notvia-addresses-08.txt.
[18]G. Enyedi, P. Szilagyi, G. Retvari and A. Csaszar, "IP Fast ReRoute: Lightweight Not-Via without Additional Addresses," IEEE INFOCOM 2009, pp.2771-2775, 19-25 April 2009.
[19]A. Atlas and R. Torvi and G. Choudhury and D. Fedyk, "OSPFv2 extensions for link capabilities to support u-turn alternates for IP/LDP fast-reroute," IETF Draft, Feb. 2006, draft-atlas-ospf-local-protect-cap-02.txt.
[20]S. Bryant, C. Filsfils, S. Previdi and M. Shand, "IP Fast Reroute using tunnels,"IETF Draft, November 16, 2007, draft-bryant-ipfrr-tunnels-03.txt.
[21]C. Hopps, "Analysis of an Equal-Cost Multi-Path Algorithm," RFC 2992, Nov. 2000.
[22]Yiqun Cai, Liming Wei, Heidi Ou, "Protocol Independent Multicast ECMP Redirect," April 2012, draft-ietf-pim-ecmp-03.txt.
[23]M. Shand and S. Bryant, "IP Fast Reroute Framework," RFC 5714, January 2010.
[24]A. Fei, J.-H. Cui, M. Gerla, and D. Cavendish, "A dual-tree scheme for fault-tolerant multicast," in Proc. ICC, 2001.
[25]M. Medard, S. Finn, R. Barry, and R. Gallager, "Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs," IEEE/ACM Trans. Netw., vol. 7, no. 5, 1999.
[26]R. Doverspike, G. Li, K. Oikonomou, K. K. Ramakrishnan, and D. Wang, "IP backbone design for multimedia distribution: Architecture and performance," in Proceedings of INFOCOM, 2007.
[27]Luebben, R., Guangzhi Li, Dongmei Wang, Doverspike and R., Xiaoming Fu, “Fast rerouting for IP multicast in managed IPTV networks", 17th International Quality of Service, 13-15 July 2009.
[28]W. D. Grover and D. Stamatelakis, "Cycle-oriented distributed preconfiguration: Ring-like speed with mesh-like capacity for self-planning network restoration, " in Proc. ICC, 1998.
[29]D. Stamatelakis and W. D. Grover, "IP layer restoration and network planning based on virtual protection cycles, " J. Sel. Areas Comm., vol. 18, no. 10, 2000.
[30]G. Shen and W. D. Grover, "Extending the p-cycle on concept to path segment protection for span and node failure recovery, " J. Sel. Areas Comm., vol. 21, no. 8, 2003.
[31]J. Doucette, W. D. Grover, and P. A. Giese, "Physical-layer p-cycles adapted for router-level node protection: A multi-layer design and operation strategy, " J. Sel. Areas Comm., vol. 25, no. 5, 2007.
[32]A. S. W. Tam, X. Kang and H. J. Chao, "A fast reroute scheme for ip multicast", in Proc. of IEEE Global Telecommunications Conference (GLOBECOM 2009), pp. 1-7, 2009.
[33]Ning Wang and Binbin Dong, "Fast failure recovery for reliable mul-ticast-based content delivery, " International Conference on Network and Service Management (CNSM), 2010.
[34]H.-K. Su and C.-S. Wu, "Local link protection scheme in IP networks," LNCS 4490, May 2007.
[35]H.-K. Su, C.-S. Wu, and Y.-S. Chu, "IP local node protection," in Proc. of the Second International Conference on Systems and Networks Communications (ICSNC 2007), 25-31 Aug 2007.
[36]Shang Wang, Chun He, Yide Zhang and Gang Feng, "Construction of Multicast Protection Tree Based on Single Node Failure", International Conference on Communications and Mobile Computing (CMC), 12-14 April 2010.
[37]UCB/LBNL/VINT ns note and documentation, http://www.isi.edu/nsnam/ns, Page accessed on Nov. 1,2007.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top