A method and system for checking and optimizing single point fault of electric power communication service
An optimization method and power communication technology, applied in the field of network communication, can solve the problems of hidden danger of single node failure, long time-consuming inspection and maintenance, low degree of automation, etc., and achieve the effect of eliminating hidden danger of single point failure, saving manpower and material resources, and high degree of automation
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0045] like figure 1 , figure 2 As shown, the method for checking and optimizing a single point of failure of a power communication service of the present invention includes the following steps:
[0046] (1) Establish a physical link model of the communication network, including all network element equipment of the entire communication network, as well as the name of the optical cable segment interconnected between each network element, the length of the optical cable, and the occupied optical core resources;
[0047] (2) Analyze the full amount of service information of the communication network management server, obtain service type information and service logic channel routing information according to the keywords in the service configuration information, and establish a service set to be checked, wherein the service set to be checked can be divided into the following according to service types Business subsets: protection, security control, automation, dispatch telephone...
Embodiment 2
[0100] On the basis of Embodiment 1, the difference is that: the principle of setting route optimization selects the principle of minimum transit, setting k1=1, k2=k3=0; in the physical independent route set, the total weight of each route is calculated, that is, The sum of the weights of each section of the entire route defines the total weight W=∑Pi,j; according to the minimum transit principle selected by the user, the optimal route for the user's needs is calculated.
Embodiment 3
[0102] On the basis of Embodiment 1, the difference is that: the reachable route search uses a depth-first algorithm, traverses the adjacency matrix, stops when it encounters an end node or branches into a loop from the starting point, and reaches the target node for recording. Thereby, the path of reachable routes is obtained, and a set of reachable routes is established.
[0103] Using the depth-first algorithm, the nodes are not fully retained, and the expanded nodes are popped and deleted from the database. Generally, the number of nodes stored in the database is the depth value, which takes up less space. When there are many nodes in the search tree, other methods are used. It is easy to generate memory overflow, and it is more convenient to use the depth-first algorithm to solve.
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com