在多協定標籤網路中具服務等級的標籤整合效能分析

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：62

、訪客IP：18.189.145.20

姓名

曾硯彬(Yen-Pin Tseng) 查詢紙本館藏

畢業系所

電機工程學系

論文名稱

在多協定標籤網路中具服務等級的標籤整合效能分析
(Performance Analysis of Label Merge with Class of Service Mechanisms in MPLS Network)

相關論文

★ 無線網路上多媒體傳輸服務之效能改善與研究	★ 語音與數據整合環境之無線網路效能分析
★ 下一代電信網路分封電話技術之效能模擬與分析	★ CDMA系統採保留機制作多媒體傳輸時之效能分析
★ CDMA系統下排程法則之研究	★ 改善TCP在無基礎架構無線網路上的效能
★ 速率隨意碼直接序列分碼多工系統之頻道資源配置機制研究	★ 電信級分封電話交換系統之分散控制結構及其效能分析
★ 具服務品質保證的無線寬頻網際網路之研究	★ 具服務品質保證分碼多工多媒體系統之效能改進
★ 以Cellular IP為基礎架構之巨微細胞行動管理機制	★ 標籤交換網路架構下Mobile IP之效能研究
★ 新世代電信網路電信級分封電話信號系統之效能模式及分析	★ 具功率控制下 MCR/DS-CDMA 系統頻道資源配置之效能研究
★ 應用在多重協定標籤交換上之改良式標籤會合法	★ 在異質性網路架構中WLAN允入控制之研究

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

MPLS網路近年已被視為未來有線網路系統之主流。它結合了目前各種交換式路由器技術之優點，提供更具彈性、擴充性以及更高效率之一種 IP 交換技術。MPLS 提供一個能整合 Layer 2 快速標頭交換之效能及 Layer 3 彈性路由選擇之優點，且可廣為各方所接受之標準化的網路傳輸技術。
在MPLS網路中，Label必須越簡單越好，但隨著Internet網路快速膨脹，Label數之飽和問題也已經浮現。為了提高MPLS網路的可擴充性，Label Merge就變成未來非常重要的課題。
目前已經提出許多Label-Merge方法，皆是致力於提高MPLS網路的可擴充性，但又盡量避免它伴隨而來的Payload、Buffer和Delay 的問題。而這些已經提出的Merge機制法，皆沒有加入服務等級的功能，研究論文將進一步加強這些 Merge 機制，增加 CoS 的功能，並且仍然維持 Merge 機制的重要目的：提高網路可擴充性、增加 Payload 使用率、減少 Delay 時間和 Buffer 使用量，而來與 Non-CoS Merge機制互相分析比較，並期盼加入 CoS 功能後的 Merge 機制，可以提高網路傳輸功效和品質保證。

摘要(英)

One key component of traffic engineering is a concept known as constraint based routing. In constraint based routing a topology database is maintained on all participating nodes. This database contains a complete list of all the links in the network that participate in traffic engineering and for each of these links a set of constraints, which those links can meet. Bandwidth, for example, is one essential constraint. Since the bandwidth available changes as new LSPs are established and terminated the topology database will develop inconsistencies with respect to the real network. It is not possible to increase the flooding rates arbitrarily to keep the database discrepancies from growing. A new mechanism is proposed whereby a source node can learn about the successes or failures of its path selections by receiving feedback from the paths it is attempting. This information is most valuable in failure scenarious but is benificial during other path setup functions as well. This fed-back information can be incorporated into subsequent route computations, which greatly improves the accuracy of the overall routing solution by significantly reducing the database discrepancies.
This document describes a mechanism that helps to minimize thenegative effects on MPLS traffic caused by Label Switch Router’’s(LSR’’s) control plane restart, and specifically by the restart of itsLabel Distribution Protocol (LDP) component, on LSRs that are capableof preserving the MPLS forwarding component across the restart.The mechanism described in this document is applicable to all LSRs,both those with the ability to preserve forwarding state during LDPrestart and those without (although the latter need to implement onlya subset of the mechanism described in this document).The mechanism makes minimalistic assumptions on what has to bepreserved across restart - the mechanism assumes that only the actualMPLS forwarding state has to be preserved; the mechanism does notrequire any of the LDP-related state to be preserved across therestart.

關鍵字(中)

★ 多協定標籤網路
★ 標籤整合

關鍵字(英)

★ Multiprotocol Label Switch
★ CoS

論文目次

目錄……………………………………………...Ⅰ
圖目…………………………………………...…Ⅲ
第一章序論
1.1 前言…………………………………………….1
1.2 研究目的……………………………………….2
1.3 論文組織架構………………………………….4
第二章背景及相關研究簡介
2.1 非同步傳輸模式 (ATM) ...……………………6
2.1.1網路結構與特性….……………………………6
2.1.2 Cell 細胞格式………………………………....8
2.1.3 ATM 調節層 (AAL)…………………………...9
2.2 MPLS 網路……………………………………10
2.2.1 MPLS 網路的演進…………………………...11
2.2.2 MPLS 的傳送架構…………………………...14
2.2.3 MPLS 網路的相關元件和協定介紹…………..17
2.2.4 MPLS 提供的服務…………………………...18
2.2.5 MPLS 網路的優點…………………………...19
2.3 VC-Merge 機制的介紹……………………….20
2.3.1 使用 FLI 方式……………………………....22
2.3.2 使用 SID Merge 方式……………………….24
2.3.3 使用 RM Cell Merge 方式…………………...25
2.3.4 使用 New RM Cell Merge 方式……………...27
2.3.5 使用 Snooper Cell Merge 方式………………31
2.4工作排程簡介－WRR…………………………34
第三章系統架構及模擬機制之描述
3.1 前言…………………………………………...36
3.2 系統架構……………………………………...36
3.3 模擬機制研究方向…………………………...40
第四章模擬分析及數據討論
4.1 前言…………………………………………...42
4.2 Merge 系統之 Cell Overhead 模擬數據…….47
4.3 Merge 系統之 Cell Delay Time 模擬數據…..57
4.4 Merge 系統之 Cell Loss Rate 模擬數據……67
4.5 Merge 系統之 Cell Loss Rate V.S Peak Rate 模擬比較….74
第五章結語 77
參考文獻……………………………………………..79
圖目
圖1-1 MPLS Network的Label分配示意圖…………………..4
圖2-1 ATM網路的架構圖……………………………………..6
圖2-2 UNI Cell和NNI Cell的格式…………………………...9
圖2-3 IP Switch的概念圖…………………………………….11
圖2-4 LDP處理步驟流程圖…………………………………15
圖2-5 MPLS網路執行Label-Swapping的說明圖…………..16
圖2-6 Shim Header的格式圖………………………………...18
圖2-7 傳統路由技術與MPLS不同傳送方式的比較………20
圖2-8 具VC-Merge與不具VC-Merge的比較……………...23
圖2-9 Use SID Merge的示意圖……………………………...25
圖2-10 Use RM Cell Merge的示意圖………………………..26
圖2-11 New RM Cell格式……………………………………28
圖2-12 Use New RM Cell Merge的示意圖………………….30
圖2-13三種Merge方式在Cell利用率的比較圖……………30
圖2-14 Use Snooper Cell Merge機制的整體架構圖………..31
圖2-15 Use Snooper Cell Merge的示意圖…………………..32
圖2-16 Round Robin處理方式……………………………….35
圖2-17 WRR處理方式……………………………………….35
圖3-1 一般雙階層選序的Merge機制………………………37
圖3-2 具CoS雙階層選序的Merge機制……………………37
圖3-3 使用在SEQ的兩種Merge機制………………………40
圖4-1 系統模擬參數預設值………………………………...43
圖4-2 具CoS的Merge機制模擬架構圖(情況一)………… .44
圖4-3 具CoS的Merge機制模擬架構圖(情況二)…………..44
圖4-4 具CoS的Merge機制模擬架構圖(情況三)…………..45
圖4-5 不具CoS的Merge機制模擬架構圖…………………47
Cell Overhead 模擬數據圖
圖4-A1 Class A在情況一的模擬結果……………………….48
圖4-A2 Class A在情況二的模擬結果……………………….48
圖4-A3 Class A在情況三的模擬結果……………………….49
圖4-B1 Class B在情況一的模擬結果……………………….49
圖4-B2 Class B在情況二的模擬結果……………………….50
圖4-B3 Class B在情況三的模擬結果……………………….50
圖4-C1 Class C在情況一的模擬結果……………………….51
圖4-C2 Class C在情況二的模擬結果……………………….51
圖4-C3 Class C在情況三的模擬結果……………………….52
Cell Delay Time 模擬數據圖
圖4-DA1 Class A在情況一的模擬結果……………………..57
圖4-DA2 Class A在情況二的模擬結果……………………..58
圖4-DA3 Class A在情況三的模擬結果……………………..58
圖4-DB1 Class B在情況一的模擬結果……………………..59
圖4-DB2 Class B在情況二的模擬結果……………………..59
圖4-DB3 Class B在情況三的模擬結果……………………..60
圖4-DC1 Class C在情況一的模擬結果……………………..60
圖4-DC2 Class C在情況二的模擬結果……………………..61
圖4-DC3 Class C在情況三的模擬結果……………………..61
Cell Loss Rate 模擬數據圖
圖4-LA Class A的模擬結果………………………………….68
圖4-LB Class B的模擬結果………………………………….68
圖4-LC Class C的模擬結果………………………………….69
不同 Peak Rate 模擬比較圖
圖4-PR1 針對機制一所產生的影響比較…………………...75
圖4-PR2 針對機制二所產生的影響比較…………………...75

參考文獻

[1] I.Widjaja, A.Elwalid, ”Performance Issues in VC-Merge Capable MPLS Switches”, IETF Internet Draft , July 1997
[2] M.Grossglauser,K. Ramakrishnan, “SEAM：Scalable and Efficient ATM Multicast”, in Proc. INFOCOM’98,April 1997
[3] M. Baldi,D. Bergamasco, S. Gai,D. Malagrino,”AAL5X：ATM Adaptation Layer 5 eXtension for Efficient VC Merging over ATM Networks”, in Proc. INFOCOM’98,April 1998
[4] S.Komandur,D.Mosse,”SPAM：A Data Forwarding Model for Multipoint-to-Multipoint Connect Support in ATM Networks”, in Proc. ICCCN’97,Sept. 1997
[5] J.Crowcroft, S.Komandur,D.Mosse,”CRAM：Cell Re-labeling at Merge-points for ATM Multicast”, in Proc. ATM’98,May 1998
[6] Hungkei Keith Chow and Alberto Leon-Garcia, “VC-Merge Capable Scheduler Design,” ATM Workshop,1999.IEEE Proceedings ,pp. 153-160,24-27 May 1999
[7] J.Bennett, H. Zhang, “Hierarchical Packet Fair Queueing Algorithms”, in Proc. ACM SIGCOMM’96
[8] S. Floyl, V. Jacobson, ”Link-sharing and Resource Management Models for Packet Networks”, IEEE/ACM Transactions on Networking, 3(4), August 1995
[9] Wang, J,; Levy, Y. ,”Managing performance using weighted round- robin”, IEEE, pp.785-792, 2000
[10] Katevenis, M.; Sildiropoulos, S.; Courcoubetis, C.,”Weighted round- robin cell multiplexing in a general-purpose ATM switch chip”, IEEE, pp.1265-1279, Oct. 1991
[11] Indra Widjaja and Anwar I. Elwalid, “Performance Issue in VC-Merge Capable Switches for Multiprotocol Label Switching,” IEEE journal on selected area in communications, Vol. 17,pp. 1178-1189, June 1999
[12] Peifang Zhou; Yang, O.W.W., “Reducing buffer requirement for VC- merge capable ATM switches” Global Telecommunications Conference, 1999. GLOBECOM’99 , Volume：1a, 1999 Page(s)：44 –48 vol.1a
[13] I.Widjaja and A. Elwalid, “Performance Issue in VC-Merge Capable ATM LSRs” RFC2682, September 1999
[14] D.Awduche, J. Malcolm, J. Agogbua, M. O’Dell, J. McManus. “Requirements for Traffic Engineering Over MPLS” RFC2702, September 1999
[15] T.Li, Y. Rekhter. ”A Provider Architecture for Differentiated Services and Traffic Engineering (PASTE).” RFC2430, October 1998
[16] E.Rosen, Y.Rekhter. “BGP/MPLS VPNs.” RFC2547 , March 1999
[17] P.Newman, T.Lyon, and G. Minshall, “Flow labeled IP：Connectionless ATM under IP,” in Proc. INFOCOM’96, San Francisco, CA, pp.1251-1266
[18] Y.Rekhter, B.Davie, D.Katz, E.Rosen, and G.Swallow, “Cisco systems’ tag switching architecture overview,” RFC2105, Feb. 1997
[19] Y.Katsube, K.Nagami, and H.Esaki, “Toshiba’s router architecture extensions for ATM：Overview,” RFC2098, Feb. 1997
[20] A.Viswanathan, N.Feldman, R.Boivie, and R.Woundy, “ARIS：Aggregate route-based IP switching,” Internet Draft draft- viswanathanaris-overview-00.txt, Mar.1997
[21] R.Callon, P.Doolan, N.Feldman, A.Fredette, G.Swallow, and A.Viswanathan, “A framework for multiprotocol label switching,” Internet Draft draft-ietf-mpls-framework-02.txt, Nov.1997
[22] I. Widjaja, M.Neuts, and J.M.Li, “Conditional overflow probability and profile curve for congestion detection in ATM network,” in Proc. INFOCOM’96, San Francisco, CA, pp.970-977
[23] J.Henanen, “Multiprotocol encapsulation over ATM adaptation layer 5,” RFC 1483, July 1993
[24] P.Jacobs and P.Lewis, “Discrete time series generated by mixtures III：Autoregressive processes,” Naval Postgraduate School, Tech. Rep. NPS55-78-022, 1978
[25] A.Romanow and S. Floyd, “Dynamics of TCP traffic over ATM networks,” IEEE J.Select.Areas Commun., vol.13, pp.633-641, May 1995
[26] R.Awdeh and H.Mouftah, “Survey of ATM switch architectures,” Computer Networks and ISDN Systems, vol.27, pp.1567-1613, Nov. 1995
[27] 國立中興大學資訊科學研究所八十八年度,碩士論文論文題目“在MPOA上的改良式資料流合併“
[28] 傅昌五,李運欽 “A Study on the MPLS Technology” 電信研究雙月刊第29卷第五
期, 民國八十八年十月

指導教授

吳中實(Jung-Shyr Wu)

審核日期

2002-6-26

推文