Resource channel joint optimization P-cycle configuration method

Abstract

The invention discloses a resource channel joint optimization P-cycle configuration method, and belongs to an integer linear programming (ILP) algorithm. The method comprises: firstly estimating the number of P-cycle sets by combining working capacity with network topology; taking minimum idle capacity as an optimization target, and setting node gradient value distribution of the P-cycle, in which a tail node of a vector is larger than a head node, confliction cycle exclusion, and root node and reverse node unique existence as a constraint conditions; and finally solving. The resource channel joint optimization P-cycle configuration method cancels an alternative P-cycle set construction step, implements unification of P-cycle construction and idle capacity distribution so as to greatly shorten system solving time, and meanwhile maintains the same resource utilization rate as the traditional two-step linear programming algorithm.

Description

technical field [0001] The present invention relates to the field of network technology, in particular to a resource channel joint optimization P circle configuration method. Background technique [0002] With the widespread adoption of optical fiber communication technology, due to the high-speed and large-capacity characteristics of optical fiber, the harm caused by network failure to society and economy is very serious. Therefore, it is necessary to study the survivability technology of optical network. P circle is a kind of protection of mesh network. This method can provide one protection path for the ring link and two protection paths for the crossover link. It combines the advantages of fast recovery speed of the ring network and high resource utilization efficiency of the mesh network, and can achieve 50ms-level protection . At present, the research on P circle configuration methods can be divided into two categories: heuristic algorithm and linear programming algor...

AI Technical Summary

Problems solved by technology

At present, the research on P circle configuration methods can be divided into two categories: heuristic algorithm and linear programming algorithm. The heuristic algorithm takes less time and obtains an optimal solution, while the linear programming algorithm obtains an optimal solution. , but time-consuming

How to find a P circle configuration method that consumes less time and has high resource utilization efficiency is the mainstream direction of P circle configuration research. However, no matter what kind of method, the P circle configuration method is divided into two steps: high-quality candidate P circle collection The calculation of the calculation and the allocation of free capacity, the calculation of the set of candidate P circles needs to consume a lot of time

Images