Title page for etd-0821101-155833


[Back to Results | New Search]

URN etd-0821101-155833
Author Ching-Yuan Chen
Author's Email Address No Public.
Statistics This thesis had been viewed 4716 times. Download 1773 times.
Department Electrical Engineering
Year 2000
Semester 2
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title A CR-LDP Based Bandwidth Preemption with Negotiation Mechanism in MPLS Networks
Date of Defense 2001-07-26
Page Count 70
Keyword
  • CR-LDP
  • Bandwidth Preemption
  • QoS
  • MPLS
  • Abstract In MPLS networks, CR-LDP (Constraint-Based Routed Label Distribution Protocol) provides traffic engineering and QoS (Quality of Service) by distributing labels along the path. One of the innovative ideas in CR-LDP is right in the capability of bandwidth preemption. Bandwidth preemption allows a high-priority traffic flow to pre-empt the low-priority traffic flow when there is not enough bandwidth for conveying the high-priority flow. However, it is not effective in assuring QoS by simply pre-empting the low-priority flow.
    Therefore, in the thesis, we present a bandwidth preemption with negotiation (BPN) architecture for MPLS networks. In BPN, a high-priority flow will have to negotiate the bandwidth with Ingress Switch Router (ISR) before it can actually pre-empt the bandwidth being used by the low-priority flow. A network link-state database in ISR is designed to record the remaining bandwidth for each priority class. ISR determines whether a high-priority flow can pre-empt a low-priority flow based on the condition that the low-priority flow is possible to switch to other paths with an equal bandwidth along the path.
    In order to evaluate the performance of our proposed BPN mechanisms, we modify the MNS (MPLS Network Simulator) by adding a bandwidth negotiation module. For the comparisons, we design two topologies for simulating the proposed BPN and the traditional bandwidth preemption with force mode. It is observed that the BPN have exhibited better performance in average throughput and packet loss rate than the traditional bandwidth preemption, not matter either a complex or a regular topology is used.
    Finally, we analyze the BPN algorithm complexity by some network parameters, and compare the complexity with that of traditional bandwidth preemption
    Advisory Committee
  • Wei-Kuang Lai - chair
  • Cheng-Shong Wu - co-chair
  • Shie-Jue Lee - co-chair
  • Wen-shyen Chen - co-chair
  • Tsang-Ling Sheu - advisor
  • Files
  • etd-0821101-155833.pdf
  • indicate in-campus access immediately and off_campus access in a year
    Date of Submission 2001-08-21

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys