博碩士論文 etd-0826104-204917 詳細資訊


[回到前頁查詢結果 | 重新搜尋]

姓名 陳永昌(Yung-chang Chen) 電子郵件信箱 E-mail 資料不公開
畢業系所 電機工程學系研究所(Electrical Engineering)
畢業學位 碩士(Master) 畢業時期 92學年第2學期
論文名稱(中) 在MPLS網路中具有負載分享以優先權為基礎的多重式資料流侵佔機制
論文名稱(英) Priority-based Multiple Flow-Preemption for Load-Sharing on MPLS Networks
檔案
  • etd-0826104-204917.pdf
  • 本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
    請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
    論文使用權限

    電子論文:校內立即公開,校外一年後公開

    論文語文/頁數 中文/65
    統計 本論文已被瀏覽 5051 次,被下載 1929 次
    摘要(中) MPLS為新一代骨幹網路的架構,其利用標籤快速交換的方式,讓封包可以更快速地送達目的地,然而,當LSP所經路徑陷入壅塞狀態,原本由該LSP傳送的資料流就會因此而變差,使得傳輸率下降、封包遺失,除非重新指定傳送路徑,否則會一直持續。所以MPLS中對LSP有所謂的頻寬保留機制,保障LSP的頻寬,同時也有侵佔機制,讓高優先權的LSP能侵佔低優先權的LSP,以取得所需的資源。
    本論文主要提出Multiple Flow Preemption機制,當我們在Ingress與Egress之間有數條已建立的LSP,有多條資料流由該LSP群所傳送,這些資料流中有具QoS要求的高優先權的資料流。當Egress量測到高優先權的資料流無法達到他的要求時,立即向Ingress回授資料流的平均Throughput,讓Ingress決定該侵佔哪一資料流,將該資料流移到同一LSP群組的其他LSP傳送,而空出的頻寬則由Ingress送出頻寬保留訊息,為該高優先權的資料流作保留,之後該LSP的該EXP等級的資料流封包便會由頻寬保留的佇列所處理,讓該資料流能達到它所要求的要求,對於其他沒有QoS保障要求的資料流,則仍以原本的方式傳送,不予任何保障。這樣不但不需一開始便作大量的頻寬保留,也可以減少為了頻寬保留而只為該資料流建立的LSP。我們在MNS(MPLS Network Simulator)模擬器上增加了論文機制的模組,並以之進行實驗模擬。
    最後經由實驗證明,我們提出的方法,可不需事先為資料流做頻寬保留,可以在當達不到原本要求時,迅速進行頻寬保留,不使其他資料流搶走被侵佔資料流所空出的頻寬,而讓有保障的資料流達到其原本的要求。
    摘要(英) MPLS, the next-generation backbone architecture, can speed up packet forwarding via label switching. However, if the traversed LSPs (Label Switching Paths) are in congestion, traffic may encounter serious throughput degradation due to packet loss. This performance degradation may become worse and worse unless another forwarding LSP for these traffic flows are allocated. Moreover, in this Thesis, we propose a preemption mechanism for higher-priority flows to obtain necessary resources (the bandwidth of a LSP) by preempting low-priority traffic flows.
    In the multiple-flow preemption mechanism, several LSPs between Ingress router and Egress router are established to forward traffic flows. Some of these traffic flows are higher priority with stringent QoS requirements. If no satisfactory throughput can be met, Egress router would have to feedback average throughput values to Ingress router, which in turn decides how many lower-priority traffic flows should be preempted and moved to another LSP. Consequently, Ingress router has to send bandwidth reservation messages to reserve bandwidth just released by those lower-priority flows. After that, every core router can process these MPLS packets with specified traffic class to meet their QoS requirements. Finally, for the purpose of demonstration, we embed multiple flow preemption modules into MNS simulator and use it to run some experiments. Since in our scheme, it is not necessary to reserve bandwidth for higher-priority traffic flows in advance, the overall bandwidth utilization can be increased. Furthermore, the higher-priority flows can meet their QoS requirements by preempting the lower-priority flows whenever it is needed.
    關鍵字(中)
  • Bandwidth Reservation
  • MPLS
  • Traffic Engineering
  • Multiple Flow Preemption
  • 關鍵字(英)
  • Bandwidth Reservation
  • MPLS
  • Traffic Engineering
  • Multiple Flow Preemption
  • 論文目次 第一章 導論………………………..…………………………………………………1
    1.1 研究動機…………….………………………………………………………1
    1.2 研究方向與方法…………………………………………………………….1
    1.3 章節介紹…………………………………………………………………….4
    第二章 MPLS網路的相關研究………………………………………………..5
    2.1 MPLS網路的相關名詞介紹……………………………………………5
    2.2 MPLS網路的負載分享(Load Sharing)相關討論…...…………………7
    2.2.1 Traffic filtering and distribution……………………........…….……8
    2.2.2在建立LSP時考慮負載平衡………………………………………9
    2.2.3 Ingress與Egress端對端的負載平衡控制機制……………….10
    2.3 MPLS網路的侵佔(Preemption)機制相關討論……………………....11
    2.3.1原始的MPLS網路的侵佔機制…………………………………12
    2.3.2 MPLS網路侵佔機制的改進………………………………………14
      2.3.2.1 Bandwidth Preemption with Negotiation Mechanism…..……14
      2.3.2.2 Soft Preemption……………………………………………….15
      2.3.2.3 Preemption Policy with Adaptive rate scheme……..…….15
      2.3.2.4 Preemption Avoidance………………………………….….…17
      2.4 對於一些Preemption機制的比較與說明……………………………..…18
    第三章 以優先權為基礎的多重式資料流侵佔機制的架構………………..……19
    3.1基本的架構說明….…..…………………………………………………19
    3.1.1 架構說明……………………………………………………………19
    3.1.2 Edge Node溝通訊息與所需之表格…………………………….….21
      3.1.2.1 通知Ingress LSR的Flow Request訊息格式與機制………...21
      3.1.2.2 在Ingress LSR與Egress LSR的資訊紀錄表………………..22
    3.2 Throughput回授機制與回授訊息…………………………………………22
    3.2.1 回傳訊息的格式………………………………………………….23
    3.2.2 Throughput回授機制………………………………………………24
    3.3 Multiple Flow Preemption機制………..………………………………26
    3.3.1 Priority的設定……………………………………………………27
    3.3.2 選擇Flow轉移的LSP……………..…………………………27
    3.3.3 頻寬保留機制………………………………………………………28
    3.3.3.1 保留的頻寬………………………………………….………..29
    3.3.3.2 以LSP的EXP為Class的頻寬保留…………………………29
    3.4 LSR的工作流程..………………………………………………………32
    3.4.1 LSR工作流程說明………………………………………………32
    3.4.2 Multiple Flow Preemption的演算法…………………………34
    第四章 模擬與結果分析……………………………………………………………36
    4.1 MNS模擬器………………………………………………………………36
    4.1.1 具Multiple Flow Preemption功能的相關擴充模組……………36
    4.2模擬架構與模擬環境的介紹………………………………………………42
    4.2.1 Topology與參數設定……………………………………………….42
    4.3 實驗數據及分析討論……………………………...……..…………….….44
    4.3.1 有QoS保障的資料流的Throughput變化………………………44
    4.3.2 未保障資料流受到LSP變換的影響……………………………46
    4.3.2.1 所轉移的LSP沒有充足的頻寬時的影響…………………....46
    4.3.2.2 所轉移的LSP有充足的頻寬時的影響....................................48
    4.3.3 被侵佔資料流的傳輸情形…………………………………………50
    4.3.4 在不同負載下的throughput變化情形.............................................52
    4.3.5 使用VBR Traffic於Multiple Flow Preemption………….……....53
    4.3.6 Multiple Flow Preemption的Processing Overhead.........................55
    第五章 結論與未來工作方向………………………………………………………57
    5.1 結論………………………………………………………………………57
    5.2 未來工作方向……………………………………………………………58
    參考文獻……………………………………………………………………………60
    索引…………………………………………………………………………………63
    參考文獻 [1] Rosen, E., Viswanathan, A. and R. Callon, “Multiprotocol label switching architecture,” Internet RFC 3031, January2001.
    [2] B. Jamoussi, Ed., 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,” RFC 3212, January 2002.
    [3] J. Ash, M. Girish, E. Gray, B. Jamoussi, G. Wright, “Applicability Statement for CR-LDP,” RFC 3213, January 2002.
    [4] J. Ash, Y. Lee, P. Ashwood-Smith, B. Jamoussi, D. Fedyk, D. Skalecki, L. Li, “LSP Modification Using CR-LDP,” RFC 3214, January 2002
    [5] D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, G. Swallow, “RSVP-TE: Extensions to RSVP for LSP Tunnels,” RFC 3209, December 2001
    [6] E. Rosen, D. Tappan, G. Fedorkow, Y. Rekhter, D. Farinacci, T. Li, A. Conta, “MPLS Label Stack Encoding,” RFC 3032, January 2001
    [7] Keping Long, Zhongshan Zhang, Shiduan Cheng, “Load balancing algorithms in MPLS traffic engineering”, 2001 IEEE Workshop on High Performance Switching and Routing, May 2001, pp. 175 –179
    [8] R. Casellas, J.L.Rougier, D. Kofman, “Packet based load sharing schemes in MPLS networks,” 2nd European Conference on Universal Multiservice Networks, 2002 (ECUMN 2002) , April 2002, pp.18 – 28
    [9] Stefan Butenweg, “Two Distributed Reactive MPLS Traffic Engineering Mechanisms for Throughput Optimization in Best Effort MPLS Networks,” ISCC 2003, July 2003, vol.1, pp. 379 - 384
    [10] T. Saad , Tingzhou Yang , D. Makrakis , V. Groza , “Inter-domain adaptive traffic engineering for IP differentiated services MPLS-based networks” , IEEE CCECE 2002, May 2002, vol.3, pp. 1527 - 1531
    [11] J.F. Chiu, Y.B. Miao, C.W. Lo, Z.P. Huang, W.S. Hwang, C.K. Shieh, “A New Preemption Avoidance and Load Balancing Policy for Traffic Engineering in MPLS Networks,” CCN 2002, November 2002, pp. 234 - 239
    [12] Pin-Han Ho, H.T. Mouftah, “Capacity-balanced alternate routing for MPLS traffic engineering,” Proceedings. ISCC 2002. Seventh International Symposium on Computers and Communications, July 2002, pp. 927 –932
    [13] E. Dinan, D. Awduche, B. Jabbari, “Analytical framework for dynamic traffic partitioning in MPLS networks”, IEEE ICC00, June 2000, pp.1604-1608
    [14]G. Armitage, “MPLS:the magic behind the myths”, IEEE Communications Magazine, Jan. 2000, Vol. 38, No. 1, pp. 124 – 131.
    [15] Deyun Gao, Yantai Shu, Shuo Liu, Yang, O.W.W., “Delay-based adaptive load balancing in MPLS networks”, 2002. IEEE International Conference on Communications, May 2002, Volume: 2 , pp. 1184 –1188
    [16] J. Schormans, T.Timotijevic, “Bandwidth overhead of probe technology guaranteeing QoS in packet networks,” Electronics Letters , May 2003, Volume: 39, Issue: 10, pp. 816 -818
    [17] A. Elwalid , Jin Cheng, S. Low, I. Widjaja, “MATE:MPLS adaptive traffic engineering”, IEEE INFOCOM 2001, April 2001, Vol. 3, pp. 1300 – 1309.
    [18] F. Blanchy, L. Melon,G.. Leduc, “Routing in a MPLS network featuring preemption mechanisms,” ICT 2003, Feb 2003, Vol.1 pp. 253 - 260
    [19] Sung-eok Jeon, R.T. Abler, A.E. Goulart, “The optimal connection preemption algorithm in a multi-class network,” IEEE International Conference on Communications 2002( ICC 2002.), May 2002, Volume: 4 ,pp. 2294 – 2298
    [20] D. Awduche, et al., “Requirements for traffic engineering over MPLS,” RFC 2702, September 1999.
    [21] 陳慶源, “A CR-LDP Based Bandwidth Preemption with Negotiation Mechanismin MPLS Networks,” 國立中山大學電機工程研究所碩士論文, July 2001
    [22] M.R. Meyer, D. Maddux, Jean-Philippe Vasseur, C. Villamizar, A. Birjandi, “MPLS Traffic Engineering Soft preemption,” IETF Internet-Draft <draft-ietf-mpls-soft-preemption-02.txt>, March 2004
    [23] J. C. de Oliveira, C. Scoglio, I. F. Akyildiz, G. Uhl, “A New Preemption Policy for DiffServ-Aware Traffic Engineering to Minimize Rerouting,” IEEE INFOCOM 2002, June 2002, Volume: 2 , pp. 695 - 704
    [24] Gaeil Ahn, Woojik Chun, “Design and implementation of MPLS network simulator (MNS) supporting QoS”, 15th International Conference on Information Networking,(ICOIN 2001), Proceedings, pp. 694 – 699.
    [25] LBL, Xerox PARC, UCB, and USC/ISI, “Network Simulator:Contributed Code”, http://www.isi.edu/nsnam/ns/ns-contributed.html
    [26] Gaeil Ahn,”MPLS Network Simulator”,
    http://flower.ce.cnu.ac.kr/~fog1/mns/index.htm
    口試委員
  • 賴威光 - 召集委員
  • 吳承崧 - 委員
  • 黃仁竑 - 委員
  • 許蒼嶺 - 指導教授
  • 口試日期 2004-07-15 繳交日期 2004-08-26

    [回到前頁查詢結果 | 重新搜尋]


    如有任何問題請與論文審查小組聯繫