Method for minimizing priority seizing cost

Abstract

The utility model relates to a method for realizing minimum priority preemption cost in the multiprotocol marking flow exchange, which comprises the following steps: defining a preemption cost function named as H-PREPT, that is, F(z)=Alpha(z x yT)+Beta(z x 1T)+Gamma(z x bT-r). When the condition z x bT is more than or equal to r is meet, the value of Z is solved when the F(z) in the formula reaches the minimum value, so as to ascertain which marked exchange paths are to be preempted. The utility model overcomes the problem in the prior art that the priority method only considers the total bandwidth of the preempted LSP but gives no consideration to the compatibility between the total bandwidth of the preempted LSP and the bandwidth r to be preempted. Compared with the heuristic method of U-PREPT in the prior art, the heuristic method of H-PREPT is put forth, and greatly enhances the accuracy of choices while with equally low complexity for computation.

Description

technical field [0001] The present invention relates to the field of data communication, in particular to a method for minimizing the cost of priority preemption by an Internet router or a network management entity in Multi-Protocol Label Switching Traffic Engineering (MPLS-TE). Background technique [0002] Provide traffic engineering based on Multi-Protocol Label Switching (MPLS) on the IP multi-service bearer network, especially the backbone network, to maximize network resource utilization, balance network load distribution, and implement multiple services such as voice, video and data. Differentiated service is the most active research topic in the field of IP communication network. 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 traffic flows, preemption can ensure that high-priority traffic (label-switched path LSPs) can alway...

AI Technical Summary

Problems solved by technology

[0019] One of the purposes of the present invention is to overcome the problem that the preemption optimization function V-PREPT in the prior art only takes into account the total bandwidth of the preempted LSPs and does not consider the adaptability between the total bandwidth of the preempted LSPs and the bandwidth r that needs to be preempted The problem is to propose a minimum preemption cost optimization function that takes the adaptability between the total bandwidth of the actually preempted LSP and the bandwidth r that needs to be preempted as a component of the preemption optimization function, named H-PREPT, so that this The improved preemption optimization function is more reasonable

[0020] The second purpose of the present invention is to solve the problem that although the V-PREPT heuristic method can reduce the calculation time, it brings low selection accuracy, and the accuracy decreases with the increase of the number of selected LSPs, thus proposing a An improved method mainly aimed at the preemption strategy V-PREPT heuristic method, the improved method can greatly reduce the complexity and calculation time, and can select the preempted LSP in real time online or offline, and has the same function as the optimization function V-PREPT or The improved optimization function H-PREPT has the same selection accuracy (using the exhaustive method to search for the LSP with the minimum preemption cost)

Images