Dynamic Load Balance Algorithm with Priority in MPLS Traffic Engineering

• Main Authors: Tsung-Shi Pu, 蒲聰喜
• Other Authors: Che-Ho Wei
• Format: Others
• Language: zh-TW
• Published: 2004
• Online Access: http://ndltd.ncl.edu.tw/handle/04921728904775440933

碩士 === 國立交通大學 === 電機資訊學院碩士在職專班 === 92 === MPLS (Multi-Protocol Label Switching) technique not only reserves the high connectivity of traditional IP network, but speeds up IP packet forwarding in a router. Especially, its powerful capability of traffic engineering improves the network resource utilization and Quality of Service. The main key point of this thesis is to use the CR-LDP (Constraint-Based Routed Label Distribution Protocol) technique of MPLS to search for an algorithm, which can fairly distribute resource for a traffic flow according to its priority ,and makes use of the network resource more efficiently . In the DLBP (Dynamic Load Balance Algorithm with Priority) mechanism we propose, when Ingress LSR receives a new traffic flow, it will select a route whose length is the shortest and Free-capacity is larger than or equal to the bandwidth request of the new traffic flow ,and then along the selected route to create an LSP in the MPLS network for the traffic flow . If the Ingress LSR fails to find such a route ,in our mechanism ,it will do its best to reroute some existing smaller traffic flows to another appropriate routes so as to reserve a high capacity route for the new traffic flow. Once the Ingress LSR still fails to find a sufficient bandwidth for the new traffic flow ,we allow the new traffic flow to preempt the reserved bandwidth of another one with lower priority. When selecting which one will be preempted, we need to consider how it can make the use of network resource and the transportation quality optimized. Our results of simulation prove that DLBP indeed makes network resource used effectively and the transportation quality optimized.