A method for computing best route of multiple constraints service in optical network

Abstract

The invention relates to a method of calculating optical network multi-restriction shortest service route, including the steps and contents as follows: firstly setting up a logic port route list in network cell; then according to the terms in the route list, deriving topology charts; finally applying Dijkstra to search the shortest path in each chart, comparing the results and taking the shortest as the final solution; it is applied to the shortest route calculation and cross linking allocation of TDM end-to-end service in optical network management.

Description

Technical field: [0001] The invention relates to the calculation of the shortest route of business under various constraints of optical network transmission bandwidth. Background technique: [0002] In optical network management, end-to-end services usually require the least network resources to be occupied, that is, the shortest path or the least number of passing network elements. A complete service is formed by the cross-connection of network elements on the path. There are several constraints that must be considered: [0003] First, the line itself has limited resources, such as STM-1 and STM-4. Each service will occupy the bandwidth specified by the user, such as VC12 and VC3, and the bandwidth between different services cannot be shared. [0004] Second, the optical network supports self-healing protection, such as MSP and SNCP. The business should be able to use the resources that can be protected first, and the dedicated protection channel cannot be configured wi...

AI Technical Summary

Problems solved by technology

Traditional methods are basically derived from Dijkstra's algorithm, but the third requirement destroys Dijkstra's precondition