跳到主要內容

簡易檢索 / 詳目顯示

研究生: 范吉慶
Chi-Ching Fan
論文名稱: 標籤交換虛擬網路下端點對端點服務品質保證之研究
A Study of End-to-End QoS Guarantee in the MPLS Virtual Network
指導教授: 陳彥文
Yen-Wen Chen
口試委員:
學位類別: 碩士
Master
系所名稱: 資訊電機學院 - 資訊工程學系
Department of Computer Science & Information Engineering
畢業學年度: 93
語文別: 中文
論文頁數: 68
中文關鍵詞: 虛擬網路服務品質
外文關鍵詞: QoS, Virtual Network
相關次數: 點閱:15下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 近年來,隨著網際網路的迅速發展以及使用人數的增多,使得網路服
    務品質的需求變成是不可獲缺的,另外,在面對越來越複雜的網路資源,
    如何有效地管理網路資源,也變成是網路管理者所必須面臨的重要議題之
    一。
    由網際網路標準制訂組織(Internet Engineering Task Force,IETF)所制
    訂的兩種服務品質的架構:整合式服務架構(IntServ Architecture)以及差異
    式服務架構(DiffServ Architecture),以及近年來用於寬頻網路的多重協定
    標籤交換技術(Multi-Protocol Label Switching,MPLS),以MPLS 的明確
    路由,可以使整體網路資源的利用更加地有效率,並且可以達到服務品質
    的保證。
    在本論文中,由實體網路所分割出來的元件(Components),組成虛擬
    網路(Virtual Networks),使得網路管理者便可輕易地從較實體網路簡化的
    虛擬網路,分配網路資源給使用者所需求的連線,並可將網路管理者分
    成:「管理網路服務效能」以及「管理網路元件」兩類,簡化網路管理者
    管理網路資源的複雜度,本論文中,採用覆蓋模型(Overlay Model):差異
    式服務建構在負載控制服務(CLS)上,此模型將可達到上述所說目的。而
    從實體網路所分割出的虛擬網路,可視為提供負載控制服務的元件,若兩
    元件內有重複的點,則此兩元件可視為互連。服務品質元件亦可依據流量
    的狀況,做彈性地安排。另外,在建置元件以及虛擬網路上選路徑則採用
    Worst-shortest Path Algorithm (WSP )方式 以及 Best-fit Shortest Path
    Algorithm (BSP )方式。模擬結果也說明,我們論文中的架構,可應用在網
    路服務品質的管理上。


    In recent years, with rapid deployment of the Internet and the increasing of
    the number of people of use, the need for the quality of service has become an
    essential requirement of network services. In addition, facing more and more
    complicated network resources, how to manage the network resources
    effectively is one of the most important issues for the network administrator.
    The two kinds of quality of service Architectures: Integrated Services
    Architecture (IntServ Architecture) and Differentiated Service Architecture
    (DiffServ Architecture) made by Internet Engineering Task Force (IETF) for
    the provisioning of QoS in internet. And the Multi-Protocol Label Switching
    (MPLS) is adopted for broadband internet recently. By using the MPLS explicit
    route, it can make the utilization of network resources more efficient , and can
    get the guarantee of quality of service .
    In this thesis, the concept of QoS components, which are formed from
    physical network to make up the Virtual Networks, can make network
    administrator easily to allocate network resources to connections. By using this
    approach, the works of network management can be divided into the
    management of network quality of service and the management of network
    QoS components so ,that the management works can be simplified. In this
    thesis, the overlay model, differential services over control load service, is
    applied to achieve the above goal. Each virtual network, formed from the
    physical network, is regarded as a control load QoS component and QoS
    components are interconnected, if there exists overlapped nodes, into a higher
    layer network topology for providing connections. QoS components are
    considered to be flexible arrangement according to traffic condition. Both of
    Worst-shortest Path Algorithm (WSP ) and Best-fit Shortest Path Algorithm
    (BSP ) are applied for the establishment of QoS components and the selection
    of QoS paths. Simulations are also performed to illustrate that our approach is
    applicable for the QoS management in internet.

    第一章 緒論…………………….…………………………….…… 1 1.1. 簡介………………………………………………… 1 1.2. 研究動機…………………………………………… 2 1.3. 論文架構介紹……………………………………… 2 第二章 相關研究背景…………………………………………….......... 4 2.1. 多重協定標籤交換(MPLS)技術之簡介…………………. 4 2.1.1. 多重協定標籤交換技術………………………….. 4 2.1.2. MPLS 基本運作…………………………….......... 6 2.1.3. MPLS 流量管理工程..……………………………. 9 2.2. 端點對端點服務品質保證之探討…………………... 11 2.2.1. IntServ 與DiffServ 比較…………………………. 11 2.2.2. 頻寬分享與負載平衡路由之探討……………….. 14 2.3. 虛擬網路資源管理之相關探討…………………….......... 16 2.3.1. 虛擬網路簡介…………………………………….. 16 2.3.2. 虛擬網路架構…………………………………….. 17 第三章 演算法及模擬架構……………………………………….......... 20 3.1. 端點對端點服務品質保證使用建置在整合式服務架構 上的差異式服務架構模型……………………………….. 20 II 3.1.1. 覆蓋模型(Overlay Model)…………..………… 20 3.1.2. 虛擬網路架構概觀………………………………... 21 3.2. LSP 路由安排演算法…………………………………….. 22 3.2.1. Worst-shortest path algorithm (WSP)………… 22 3.2.2. Best-Fit-shortest path algorithm (WSP)……… 25 3.2.3. BSP 與WSP 之探討…………………………… 27 3.3.4. M/M/1 Queueing Model…………………………... 28 3.3. 建構/ 拆除服務品質網路元件之演算法 (Construct/Destroy QoS Components)…………………… 28 3.3.1. 建構及拆除網路元件之範例…………………….. 34 3.4. 模擬架構…………………………………………….......... 38 3.4.1. 模擬參數定義……………………………………… 38 3.4.2. 模擬方案…………………………………………… 40 第四章 模擬結果與討論………………………………………….......... 43 4.1. 模擬結果分析……………………………………….......... 43 4.2. 模擬方案一之討論………………………………….......... 45 4.3. 模擬方案二之討論……………………………………….. 50 4.4. 模擬方案三之討論……………………………………….. 54 4.5. 模擬方案四之討論……………………………………….. 60 第五章 結論與未來研究…………………………………………... 65 參考文獻…………………………………………………………….. 67

    [1] “DiffServ-The Scalable End-to-End QoS Model”, Cisco Systems White
    Paper,2001.
    http://www.cisco.com/warp/public/cc/pd/iosw/prodlit/difse_wp.pdf
    [2] Thomas, Stephen A., “IP switching and routing essential: understanding
    RIP, OSPF, BGP, MPLS,CR-LDP, and RSVP-TE”. John Wiley & Sons,
    Inc. 2001, ISBN:0-471-03466-5.
    [3] Awduche, D. et al., “Requirements for Traffic Engineering over MPLS”,
    IETF RFC 2702, Sept. 1999.
    [4] Awduche, D. et al., “Overview and Principles of Internet Traffic
    Engineering”, IETF RFC 3272, May. 2002.
    [5] Le Faucheur, F. et al., “Multi-Protocol Label Switching(MPLS) Support of
    Differentiated Services”, IETF RFC 3270, May. 2002.
    [6] Shenker, S., Partridge, C. and Guerin, R., "Specification of Guaranteed
    Quality of Service", IETF RFC 2212, September 1997.
    [7] Wroclawski, J., "Specification of the Controlled Load Network Element
    Service", IETF RFC 2211, September 1997.
    [8] Garg, R., Saran, H., “Fair bandwidth sharing among virtual networks: a
    capacity resizing approach”INFOCOM 2000, Nineteenth Annual Joint
    Conference of the IEEE Computer and Communications Societies,
    Proceedings, Volume 1, 26-30 March 2000 Page(s):255 - 264 vol.1.
    68
    [9] Gopalan, K., Tzi-cker Chiueh, Yow-Jian Lin, “Load balancing routing
    with bandwidth-delay guarantees”, Communications Magazine, IEEE
    Volume 42, Issue 6, June 2004 Page(s):108 – 113.
    [10] Leon-Garcia, A., Mason L. G., “Virtual network resource management
    for next-generation networks”, Communications Magazine, IEEE
    Volume 41, Issue 7, July 2003 Page(s):102 – 109.
    [11] Jun A.D.-S., Leon-Garcia, ”Virtual network resources management: a
    divide-and-conquer approach for the control of future networks” Global
    Telecommunications Conference, 1998, The Bridge to Global Integration.
    IEEE Volume 2, 8-12 Nov. 1998 Page(s):1065 - 1070 vol.2.
    [12] Zhu, K., Zang, H., Mukherjee, B., “A Comprehensive Study on
    Next-Generation Optical Grooming Switches”, IEEE Journal on Selected
    Areas in Communication, vol. 21, no. 7, Sep. 2003, Page(s): 1173-1186.
    [13] Guo, L., Matta, I., “On state aggregation for scalable QoS routing”
    ATM Workshop Proceedings, 1998 IEEE 26-29 May 1998 Page(s):306 –
    314.
    [14] Swaminathan, S., Manimaran, G., ”A QoS multicast routing protocol
    for resource-intensive groups”, Communications, 2002, ICC 2002. IEEE
    International Conference on Volume 2, 28 April-2 May 2002,
    Page(s):1295 - 1299 vol.2.

    QR CODE
    :::