Method for establishing label switched path of minimized path preemption cost

Abstract

The invention provides an establishing method of label switching path of minimizing path occupy cost in a multi protocol switching network. A link is wiped out when the not-reserved bandwidth is smaller than the bandwidth r of label switching path established by request in network topology. In the residual network topology, the residual bandwidth of each link is used as routing tolerance, and a priority algorithm of shortest path based on obligation is operated to find an optimal path of the said label switching path. For the said selected link on the optimal path, the residual bandwidth is analyzed whether it is more than or equal to the bandwidth r of label switching path established by request if yes the occupation is needless, if not, the occupation is necessary, the occupation formula is Y=alpha* p+ epsilon / |(b-r)|+sigma*n + theta*b. The invention not only establishes a label switching path for a new LSP request in minimal occupy cost, and obtains load balance and effectively increases the level of network resource utilization.

Description

Technical field [0001] The invention relates to the field of data communication, in particular to a method for establishing a label switching path in a multi-protocol label switching network that minimizes the cost of path preemption. Background technique [0002] Provide traffic engineering based on Multi-Protocol Label Switching (MPLS) on IP multi-service bearer networks, especially backbone networks, to maximize network resource utilization, balance network load distribution, and realize multiple services such as voice, video, and data Differentiated services are currently the most active research topic in the field of IP communication networks. The core of MPLS traffic engineering is bandwidth reservation and management. In a network environment where bandwidth resources become scarce and there are a large number of delay-sensitive service flows, preemption can ensure that high-priority services (LSPs) can always be routed to relatively favorable paths to ensure this type of ...

AI Technical Summary

Problems solved by technology

[0012] The disadvantages of the above two path selection solutions that minimize preemption are: the same preemption strategy is used, that is, the LSP with the lowest priority is always preempted first, without considering the bandwidth of the preempted LSP and the optimal selection of these LSPs. The link situation of the path established by the LSP, resulting in non-minimum preemption cost path selection

[0016] Since all service types are limited by a single bandwidth constraint, MPLS-TE cannot provide more refined and differentiated QoS guarantees for various types of services