English  |  正體中文  |  简体中文  |  Items with full text/Total items : 78111/78111 (100%)
Visitors : 30629796      Online Users : 249
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/9371

    Title: 在多協定標籤網路中具服務等級的標籤整合效能分析;Performance Analysis of Label Merge with Class of Service Mechanisms in MPLS Network
    Authors: 曾硯彬;Yen-Pin Tseng
    Contributors: 電機工程研究所
    Keywords: 多協定標籤網路;標籤整合;Multiprotocol Label Switch;CoS
    Date: 2002-06-25
    Issue Date: 2009-09-22 11:46:22 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 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.
    Appears in Collections:[電機工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明