CN109344975A - A kind of the verification optimization method and its system of energy communication service Single Point of Faliure - Google Patents
A kind of the verification optimization method and its system of energy communication service Single Point of Faliure Download PDFInfo
- Publication number
- CN109344975A CN109344975A CN201810970241.7A CN201810970241A CN109344975A CN 109344975 A CN109344975 A CN 109344975A CN 201810970241 A CN201810970241 A CN 201810970241A CN 109344975 A CN109344975 A CN 109344975A
- Authority
- CN
- China
- Prior art keywords
- routing
- logical links
- physical link
- route
- faliure
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000004891 communication Methods 0.000 title claims abstract description 47
- 238000005457 optimization Methods 0.000 title claims abstract description 30
- 238000000034 method Methods 0.000 title claims abstract description 29
- 238000012795 verification Methods 0.000 title claims abstract description 22
- 238000004364 calculation method Methods 0.000 claims abstract description 5
- 239000011159 matrix material Substances 0.000 claims description 23
- 230000003287 optical effect Effects 0.000 claims description 11
- 230000007717 exclusion Effects 0.000 claims description 9
- 238000004422 calculation algorithm Methods 0.000 claims description 7
- 238000012546 transfer Methods 0.000 claims description 7
- 239000000284 extract Substances 0.000 claims description 4
- 238000007363 ring formation reaction Methods 0.000 claims description 3
- 239000000463 material Substances 0.000 abstract description 3
- 230000009286 beneficial effect Effects 0.000 abstract 1
- 238000007726 management method Methods 0.000 description 6
- 230000004224 protection Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 238000013024 troubleshooting Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000004888 barrier function Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000010835 comparative analysis Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/20—Administration of product repair or maintenance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Tourism & Hospitality (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
- Telephonic Communication Services (AREA)
Abstract
The invention discloses the verification optimization methods of energy communication service Single Point of Faliure, establish communication network physical link model；Logical full dose business information is parsed, collection of services to be checked is established；Service logic channel routing iinformation is obtained according to business information to be checked, obtains business physical channel routing iinformation, searches Single Point of Faliure hidden danger point；Communication network logical links model is rebuild, light path resource occupation proportion information is added, the case where there are physical links with routing in logical links is marked, establishes the same route set of logical links；Routing optimality is carried out to Single Point of Faliure hidden danger point.The beneficial effects of the invention are as follows quick identifications to find out single node failure hidden danger, by optimal routing calculation module, the Optimizing Suggestions of optimal routing is provided for the demand of different user, accurately to eliminate Single Point of Faliure hidden danger；The case where its Optimizing Suggestions can provide reference, avoid the occurrence of under-enumeration to staff, saves a large amount of manpower and material resources, improves work efficiency, high degree of automation.
Description
Technical field
The invention belongs to network communication technology field, the verification more particularly, to a kind of energy communication service Single Point of Faliure is excellent
Change method and its system.
Background technique
Infrastructure of the power telecom network as power grid carries the important industry such as relay protection, automation, dispatching telephone
Business, is the basic guarantee of electric power netting safe running, is the important support that IT application in enterprises continues to develop.As global energy interconnects
The fast development of the technologies such as net, the continuous construction of smart grid and big data, energy communication service becomes increasingly abundant, to electric power
More stringent requirements are proposed for the robustness and reliability of communication network.
Currently, power communication transmission generallys use the protections sides such as SNCP (subnet connection protection), MSP (multiplex section protection)
Formula realizes the redundancy protecting of important energy communication service by configuring mutually independent standby usage channel, when master channel event
Alternate channel can be switched to when barrier in time, ensures that business runs without interruption.For standby usage passway by selection, usually by
Network management produces automatically or technical staff's human configuration, and the routing automatically generated in network management system is the routing of logic-based level
The principle of mutual exclusion can not identify the routing condition in physical link level channel, and customer service is caused standby usage routing occur in object
Manage link layer exist with routing, same to optical cable, with website or with equipment the case where, if this section of interruption of optical cables or equipment fault
It will cause the failure of power telecom network, that is, there is single node failure hidden danger, seriously affect the safety and stability fortune of power telecom network
Row.
Currently, for single node failure investigation and routing optimization method depend on technical staff experience, need manually into
Row statistical analysis, the degree of automation is low, and needs to expend a large amount of manpower and material resources, and troubleshooting accuracy rate is low, maintenance and inspection
Time-consuming, checks that speed is slow, maintenance cost is high.
Summary of the invention
The object of the present invention is to provide a kind of structures simply, troubleshooting accuracy rate is high, it is hidden to rapidly find out single node failure
Suffer from and propose the verification optimization method of Optimizing Suggestions, the degree of automation and the energy communication service Single Point of Faliure that work efficiency is high.
It is a further object to provide a kind of systems of the verification optimization of energy communication service Single Point of Faliure.
Technical scheme is as follows:
A kind of verification optimization method of energy communication service Single Point of Faliure, comprising the following steps:
(1) communication network physical link model is established；
(2) the full dose business information for parsing communication network management server extracts the service configuration information of configuration standby usage routing,
And establish collection of services to be checked；
(3) service logic channel routing iinformation, invocation step (1) are obtained according to the business information to be checked in step (2)
The physical link model of foundation obtains service channel physical link routing iinformation, analyzes the master channel under same business one by one
The physics routing passed through respectively with alternate channel, searches and records identical network element device or optical cable that primary, spare channel is passed through
Section, obtains Single Point of Faliure hidden danger point；
(4) communication network logical links model is rebuild, light path resource occupation proportion information is added, marks in logical links
The case where there are physical links with routing, and the same route set of logical links is established with the case where routing according to physical link；
(5) routing optimality is carried out for the business of Single Point of Faliure hidden danger point, specific as follows:
(5-1) establishes network element adjacent relation matrix；
The reachable routing of (5-2) between search starting point and end device is established up to route set；
(5-3) decision logic link separated rout ing, establishes logical links separated rout ing set；
(5-4) determines physical link separated rout ing, is established according to the logical links separated rout ing set and step (4)
Logical links is compared with route set and is screened, and removes the link being logically present with routing, obtains the road of the complete mutual exclusion of physical link
By establishing physical link separated rout ing set；
(5-5) calculates optimal routing: setting routing optimum principle calculates in the physical link separated rout ing set
The weight in path calculates and obtains optimal routing.
In the above-mentioned technical solutions, when logical links separated rout ing set and logical links in route set comprising same
When logical links is with the element in subset is routed, then found out in above-mentioned both links there are the same routing condition of physical link
Physical link separated rout ing.
In the above-mentioned technical solutions, the communication network physical link model of the step (1) includes the whole of communication network
Optical cable name section, optical cable degree information and the occupancy light core resource interconnected between network element and network element.
In the above-mentioned technical solutions, the collection of services to be checked is obtained according to the keyword in service configuration information
Service type information, service logic channel routing iinformation.
In the above-mentioned technical solutions, excellent by breadth first algorithm or depth up to route set in the step (5-2)
First algorithm traversal adjacent relation matrix obtains.
In the above-mentioned technical solutions, search establishes and uses breadth first algorithm up to route set in the step (5-2)
Calculating search is carried out, when starting point sets out successively traversal adjacent relation matrix, endpoint node is encountered or a upper node layer then stops
Only and next branch is turned to, encounters destination node and then record path and turn to next branch.
In the above-mentioned technical solutions, search establishes and uses depth-priority-searching method up to route set in the step (5-2)
Calculating search is carried out, sets out when starting point and traverses adjacent relation matrix, endpoint node is encountered or branch's cyclization then stops, reaching
Destination node then records.
In the above-mentioned technical solutions, decision logic link separated rout ing in the step (5-3), according to main standby route mutual exclusion
Principle.
In the above-mentioned technical solutions, the routing optimum principle uses minimum transfer principle, minimal distance principle or average
One of most abundant principle of resource redundancy or multiple combinations.
A kind of system of verification optimization method that realizing energy communication service Single Point of Faliure, comprising:
Physical link model building module, for establishing communication network physical link according to communication network physical link information
Model；
Business information parsing module extracts configuration for parsing the full dose business information exported in communication network management server
The service configuration information of standby usage routing, establishes collection of services to be checked；
Single Point of Faliure hidden danger determination module, for searching and master channel and spare in Record Comparison collection of services to be checked
Same routing between channel or with equipment situation；
Logical links Model Reconstruction module, the real physical links for being passed through according to logical links rebuild logical links
Model, and mark a plurality of logical links to be that logic is same by same section of physical link and route, and establish the same set of routes of logical links
Close, wherein there are the two or more pieces logical links of identical routing be the logical links with a son in route set
Collection；
Route optimization module, for calculating and obtaining routing optimality suggestion side according to routing optimum principle set by user
Case, wherein route optimization module includes following submodule:
Adjacent relation matrix establishes module, for according to logical links model foundation syntople and according to physical link
Model obtains linkage length and value information, establishes adjacent relation matrix；
Reachable path search module, it is reachable between the Origin And Destination in the adjacent relation matrix for traversing and recording
The communication line of routing, and establish up to route set；
Logical links separated rout ing determination module, for passing through intermediate node and logic line in the reachable route set
Road compares, and finds out the mutually independent routing of logical links, and establish logical links separated rout ing set；
Physical link separated rout ing determination module, in the logical links separated rout ing set, by with it is described
Logical links compares one by one with the data of route set, finds out physical link separated rout ing；
Optimal routing calculation module, for calculating optimal routing and joining for user according to routing optimum principle set by user
It examines.
The advantages and positive effects of the present invention are: due to the adoption of the above technical scheme, quickly identifying power telecom network
The case where standby usage routing of whole business is with the presence or absence of the same routing of physical link or with equipment is run, single node is found out
Potential faults, and by optimal routing calculation module, the Optimizing Suggestions of optimal routing are provided for the demand of different user, with
It is accurate to eliminate Single Point of Faliure hidden danger；The case where its Optimizing Suggestions can provide reference, avoid the occurrence of under-enumeration to staff, section
A large amount of manpower and material resources have been saved, have been improved work efficiency, high degree of automation.
Detailed description of the invention
Fig. 1 is the logical flow chart of the verification optimization method of energy communication service Single Point of Faliure of the invention；
Fig. 2 is the structure chart of the verification optimization system of energy communication service Single Point of Faliure of the invention；
Fig. 3 is the structural schematic diagram of embodiment 1 in the present invention；
Fig. 4 is the schematic diagram of the adjacent relation matrix of embodiment 1 in the present invention.
Specific embodiment
Below in conjunction with specific embodiment, invention is further described in detail.It should be appreciated that described herein specific
Embodiment is used only for explaining the present invention, is not intended to limit the present invention, is never limited in protection scope of the present invention.
Embodiment 1
As shown in Figure 1 and Figure 2, the verification optimization method of energy communication service Single Point of Faliure of the invention, including following step
It is rapid:
(1) communication network physical link model is established, whole network element devices and each net including entire communication network
The optical cable name section that interconnects between member, occupies light core resource situation at cable length information；
(2) the full dose business information for parsing communication network management server obtains industry according to the keyword in service configuration information
Service type information, service logic channel routing iinformation, and collection of services to be checked is established, wherein collection of services to be checked can press
Following business subset is divided into according to type of service: respectively being protected, is pacified control, automation, dispatching telephone, administration telephone, meeting electricity
Depending on, data communication network service, and can emphasis for single business subset carry out hidden troubles removing and optimization；
(3) according to the collection of services to be checked of setting or single business subset, pay attention to the business in analysis set, according to
Service logic channel routing iinformation, invocation step (1) physical link model obtain above-mentioned service channel physical link routing letter
Breath, compares and records network element device, the optical cable segment information that master channel and alternate channel under same business pass through respectively, when
Identical network element device or optical cable segment are passed through in primary, spare channel, i.e., there are Single Point of Faliure hidden danger in above-mentioned business, record places an order
Point failure hidden danger point；
(4) communication network logical links model is rebuild, adds light path resource occupation proportion information, and mark logical links
In there are physical link with route the case where, and according to physical link with route the case where establish the same route set of logical links,
There are the two or more pieces logical links of identical routing as above-mentioned logical links with a subset in route set；
(5) routing optimality is carried out for the business of Single Point of Faliure hidden danger point, specific as follows:
(5-1) establishes network element adjacent relation matrix, network element Vi, Vj (i, j=1-n), and Vi or Vj indicate element name, n table
Show that NE quantity, P indicate weight between two network elements, defines weight P (i, j)=k1M1+k2M2+k3M3.Wherein, M1 is two nodes
Adjacent value, the adjacent M1 of two nodes are equal to 1, and the non-conterminous M1 of two nodes is equal to infinity；M2 line length, unit between two nodes
km；M3 has used resource accounting between being equal to two nodes, between 0 to 1；K1, k2, k3 are M1, the weight coefficient of M2, M3, three it
Be 1, wherein diagonal line P=0, if between two network elements without link if P be equal to infinity；
The reachable routing of (5-2) between search starting point and end device traverses network element syntople using breadth first algorithm
Matrix finds the reachable routing between beginning and end equipment, establishes up to route set；
(5-3) is passing through intermediate node and logic one by one up in route set according to main standby route mutual exclusion principle
Comparative analysis finds out the simultaneously mutually independent routing of decision logic link, establishes logical links separated rout ing set；
(5-4) determines physical link separated rout ing, in the step (5-3) logical links separated rout ing set, calls
Logical links rebuilds the logical links in module with the data of route set, carries out comparing screening one by one, removes and be logically present together
The link of routing obtains the routing of the complete mutual exclusion of physical link, establishes physical link separated rout ing set；
K3=1, k1=k2=0 is arranged using the average most abundant principle of redundant resource in (5-5) setting routing optimum principle；
Every routing total weight value is calculated in physics separated rout ing set, i.e., whole every section of weights sum being routed across defines total power
Value W=∑ Pi, j, average resource occupancy situation can be described by routing total weight value divided by route segment number.Total weight value calculated result
Smaller expression transfer quantity is less, line length is smaller or resource redundancy is more, and the weight in calculated path as obtains
Optimal routing selects routing to provide reference for technical staff.
A kind of verification optimization system of energy communication service Single Point of Faliure, comprising:
Physical link model building module, for establishing physical link model according to communication network physical link information；
Business information parsing module extracts configuration for parsing the full dose business information exported in communication network management server
The service configuration information of standby usage routing, establishes collection of services to be checked；
Single Point of Faliure hidden danger determination module, for searching and master channel and spare in Record Comparison collection of services to be checked
Same routing between channel or with equipment situation；
Logical links Model Reconstruction module, the real physical links for being passed through according to logical links rebuild logical links
Model, and mark a plurality of logical links to be that logic is same by same section of physical link and route, and establish the same set of routes of logical links
Close, wherein there are the two or more pieces logical links of identical routing be logical links with a subset in route set；
Route optimization module, for calculating and obtaining routing optimality suggestion side according to routing optimum principle set by user
Case, wherein route optimization module includes following submodule:
Adjacent relation matrix establishes module, for according to logical links model foundation syntople and according to physical link
Model obtains linkage length and value information, establishes adjacent relation matrix；
Reachable path search module, for traversing and recording the reachable routing between the Origin And Destination in adjacent relation matrix
Communication line, and establish up to route set；
Logical links separated rout ing determination module, for passing through intermediate node and logic ratio in reachable route set
It is right, the mutually independent routing of logical links is found out, and establish logical links separated rout ing set；
Physical link separated rout ing determination module, in logical links separated rout ing set, by with logical links
Data with route set compare one by one, find out physical link separated rout ing；
Optimal routing calculation module, for calculating optimal routing and joining for user according to routing optimum principle set by user
It examines.
As shown in figure 3, being V1 with starting point, process (the Vi representative of route optimization module is illustrated for the routing that terminal is V5
Element name):
Wherein, light path resource service condition:
V1-V5 has occupied 80%；
V1-V3, V3-V4, V4-V5 occupy 10%；
V1-V2, V2-V5, V3-V2, V2-V4 occupy 30%.
(1) adjacent relation matrix is first established, defining weight P (i, j)=k1M1+k2M2+k3M3, (P is indicated between two network elements
Weight, M1 are two node adjacency values, M2 line length (unit km) between two nodes；M3 is accounted for resource between being equal to two nodes
Than between 0 to 1；K1, k2, k3 are M1, and the weight coefficient of M2, M3,1) the sum of three is；
According to minimum transfer principle (K1=1, K2=K3=0)
| V1 | V2 | V3 | V4 | V5 | |
| V1 | 0 | 1 | 1 | ∞ | 1 |
| V2 | 1 | 0 | 1 | 1 | 1 |
| V3 | 1 | 1 | 0 | 1 | ∞ |
| V4 | ∞ | 1 | 1 | 0 | 1 |
| V5 | 0 | 1 | ∞ | 1 | 0 |
According to minimal distance principle (K1=K3=0, K2=1)
| V1 | V2 | V3 | V4 | V5 | |
| V1 | 0 | 10 | 10 | ∞ | 40 |
| V2 | 10 | 0 | 20 | 20 | 10 |
| V3 | 10 | 20 | 0 | 10 | ∞ |
| V4 | ∞ | 20 | 10 | 0 | 10 |
| V5 | 40 | 10 | ∞ | 10 | 0 |
According to the most abundant principle (K1=K2=0, K3=1) of average resource redundancy
| V1 | V2 | V3 | V4 | V5 | |
| V1 | 0 | 0.3 | 0.1 | ∞ | 0.8 |
| V2 | 0.3 | 0 | 0.3 | 0.3 | 0.3 |
| V3 | 0.1 | 0.3 | 0 | 0.1 | ∞ |
| V4 | ∞ | 0.3 | 0.1 | 0 | 0.1 |
| V5 | 40 | 10 | ∞ | 10 | 0 |
(2) adjacent relation matrix is traversed using breadth first algorithm, successively searches adjacent node；
As shown in figure 4, obtaining following 7 up to route set:
V1-V5；
V1-V2-V3-V4-V5；
V1-V2-V4-V5；
V1-V2-V5；
V1-V3-V2-V4-V5；
V1-V3-V2-V5；
V1-V3-V4-V5
(3) up to mutual exclusion routing is found out in route set, the routing of the mutual exclusion between Origin And Destination is found out in comparison one by one, is obtained
To following result:
V1-V5；
V1-V2-V5；
V1-V3-V4-V5
(4) it is calculated by routing metric and chooses optimal routing:
Wherein, the most abundant principle weight ∑ P of average resource redundancy4=∑ P3/∑P1, i.e.,
V1-V5=0.8
V1-V2-V5=0.3
V1-V3-V4-V5=0.1
In conclusion selecting V1-V5 routing according to minimum transfer principle；According to minimum length principle, V1-V2-V5 is selected
Routing；According to the most abundant principle of average resource redundancy, V1-V3-V4-V5 routing is selected.
Embodiment 2
On the basis of embodiment 1, be different from place to be: the principle that routing optimality is arranged selects minimum transfer former
Then, k1=1, k2=k3=0 are set；Every routing total weight value is calculated in physics separated rout ing set, i.e., it is whole to be routed across
Every section of weights sum, define total weight value W=∑ Pi, j；According to the minimum transfer principle that user selects, it is calculated for use
The optimal routing of family demand.
Embodiment 3
On the basis of embodiment 1, it is different from place to be: using depth-priority-searching method, traversal up to route search
Adjacent relation matrix, the stopping when encountering endpoint node or branch's cyclization from starting point, reaches destination node and is remembered
Record.To obtain the path up to routing, and establish up to route set.
Using depth-priority-searching method, all risk insurance does not stay node, and the node extended is popped up from database leaves out, generally in number
It is exactly depth value according to the nodal point number stored in library, occupied space is few, when the node of search tree is more, uses other methods
It is also easy to produce memory spilling, is solved using depth-priority-searching method is more convenient.
One embodiment of the present invention has been described in detail above, but the content is only preferable implementation of the invention
Example, should not be considered as limiting the scope of the invention.It is all according to equivalent variations made by the present patent application range and improve
Deng should still be within the scope of the patent of the present invention.
Claims (10)
1. a kind of verification optimization method of energy communication service Single Point of Faliure, which comprises the following steps:
(1) communication network physical link model is established；
(2) the full dose business information for parsing communication network management server, extracts the service configuration information of configuration standby usage routing, and builds
Found collection of services to be checked；
(3) service logic channel routing iinformation is obtained according to the business information to be checked in step (2), invocation step (1) is established
Physical link model, obtain service channel physical link routing iinformation, analyze master channel under same business and standby one by one
The physics routing passed through respectively with channel, searches and records identical network element device or optical cable segment that primary, spare channel is passed through, obtain
To Single Point of Faliure hidden danger point；
(4) communication network logical links model is rebuild, light path resource occupation proportion information is added, marks in logical links and exist
Physical link establishes the same route set of logical links with the case where routing with the case where routing, and according to physical link；
(5) routing optimality is carried out for the business of Single Point of Faliure hidden danger point, specific as follows:
(5-1) establishes network element adjacent relation matrix；
The reachable routing of (5-2) between search starting point and end device is established up to route set；
(5-3) decision logic link separated rout ing, establishes logical links separated rout ing set；
(5-4) determines physical link separated rout ing, the logic established according to the logical links separated rout ing set and step (4)
Link is compared with route set and is screened, and removes the link being logically present with routing, is obtained the routing of the complete mutual exclusion of physical link, is built
Vertical physical link separated rout ing set；
(5-5) calculates optimal routing: setting routing optimum principle calculates path in the physical link separated rout ing set
Weight, calculate and obtain optimal routing.
2. verification optimization method according to claim 1, it is characterised in that: when logical links separated rout ing set and logic
When link with including the element in the same routing subset of same logical links in route set, then there are physics in above-mentioned both links
The same routing condition of link, that is, find out physical link separated rout ing.
3. verification optimization method according to claim 2, it is characterised in that: the communication network physics chain of the step (1)
Road model includes the optical cable name section, optical cable degree information and the occupancy that interconnect between the whole network elements and network element of communication network
Light core resource.
4. verification optimization method according to claim 3, it is characterised in that: the collection of services to be checked is according to business
The service type information of keyword acquisition in configuration information, service logic channel routing iinformation.
5. verification optimization method according to claim 4, it is characterised in that: up to route set in the step (5-2)
Adjacent relation matrix is traversed by breadth first algorithm or depth-priority-searching method to obtain.
6. verification optimization method according to claim 5, it is characterised in that: search is established reachable in the step (5-2)
Route set carries out calculating search using breadth first algorithm, when starting point sets out successively traversal adjacent relation matrix, encounters end
End node or a upper node layer then stop and turn to next branch, encounter destination node and then record path and turn to next point
Branch.
7. verification optimization method according to claim 5, it is characterised in that: search is established reachable in the step (5-2)
Route set carries out calculating search using depth-priority-searching method, sets out when starting point and traverses adjacent relation matrix, encounters endpoint node
Or branch's cyclization then stops, and reaches destination node and then records.
8. verification optimization method described in people's any one in -7 according to claim 1, it is characterised in that: the step (5-3)
Middle decision logic link separated rout ing, according to main standby route mutual exclusion principle.
9. verification optimization method according to claim 8, it is characterised in that: the routing optimum principle uses minimum transfer
One of principle, minimal distance principle or the most abundant principle of average resource redundancy or multiple combinations.
10. a kind of system for the verification optimization method for realizing energy communication service Single Point of Faliure described in claim 1, feature
It is, comprising:
Physical link model building module, for establishing communication network physical link mould according to communication network physical link information
Type；
It is active and standby to extract configuration for parsing the full dose business information exported in communication network management server for business information parsing module
With the service configuration information of routing, collection of services to be checked is established；
Single Point of Faliure hidden danger determination module, for searching master channel and alternate channel in simultaneously Record Comparison collection of services to be checked
Between same routing or with equipment situation；
Logical links Model Reconstruction module, the real physical links for being passed through according to logical links rebuild logical links model,
And mark a plurality of logical links to be that logic is same by same section of physical link and route, and establish the same route set of logical links,
In, it is the logical links with a subset in route set there are the two or more pieces logical links of identical routing；
Route optimization module, for calculating and obtaining routing optimality proposed projects according to routing optimum principle set by user,
Middle route optimization module includes following submodule:
Adjacent relation matrix establishes module, for according to logical links model foundation syntople and according to physical link model
Linkage length and value information are obtained, adjacent relation matrix is established；
Reachable path search module, for traversing and recording the reachable routing between the Origin And Destination in the adjacent relation matrix
Communication line, and establish up to route set；
Logical links separated rout ing determination module, for passing through intermediate node and logic ratio in the reachable route set
It is right, the mutually independent routing of logical links is found out, and establish logical links separated rout ing set；
Physical link separated rout ing determination module, in the logical links separated rout ing set, by with the logic
Link compares one by one with the data of route set, finds out physical link separated rout ing；
Optimal routing calculation module, for it is for reference to calculate optimal routing according to routing optimum principle set by user.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810970241.7A CN109344975B (en) | 2018-08-24 | 2018-08-24 | Method and system for checking and optimizing single-point fault of power communication service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810970241.7A CN109344975B (en) | 2018-08-24 | 2018-08-24 | Method and system for checking and optimizing single-point fault of power communication service |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109344975A true CN109344975A (en) | 2019-02-15 |
| CN109344975B CN109344975B (en) | 2021-07-23 |
Family
ID=65292084
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810970241.7A Active CN109344975B (en) | 2018-08-24 | 2018-08-24 | Method and system for checking and optimizing single-point fault of power communication service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109344975B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110233796A (en) * | 2019-05-30 | 2019-09-13 | 国网山东省电力公司信息通信公司 | A kind of power communication optimization method and equipment based on weighting routing algorithm |
| CN110474801A (en) * | 2019-08-09 | 2019-11-19 | 国网浙江省电力有限公司信息通信分公司 | Powerline network fault simulation method based on service reliability |
| CN110912818A (en) * | 2019-11-26 | 2020-03-24 | 中盈优创资讯科技有限公司 | Method and system for judging same route of PTN (packet transport network) service |
| CN110943759A (en) * | 2019-11-12 | 2020-03-31 | 国家电网有限公司信息通信分公司 | Electric power communication link data checking method based on depth-first search algorithm |
| CN111586504A (en) * | 2020-04-16 | 2020-08-25 | 沈阳市电信规划设计院股份有限公司 | Service-based same-route analysis method for communication operator |
| CN113225215A (en) * | 2021-05-19 | 2021-08-06 | 华北电力大学 | Method and system for identifying differentiated service network key link under SDN architecture |
| CN115883439A (en) * | 2022-11-25 | 2023-03-31 | 中国联合网络通信集团有限公司 | Network transmission path processing method, device and storage medium |
| CN116208382A (en) * | 2023-01-10 | 2023-06-02 | 中通服创立信息科技有限责任公司 | Method, system, electronic device and medium for network structural security analysis |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102098306A (en) * | 2011-01-27 | 2011-06-15 | 北京信安天元科技有限公司 | Network attack path analysis method based on incidence matrixes |
| CN106656572A (en) * | 2016-11-18 | 2017-05-10 | 北京市天元网络技术股份有限公司 | Electric power communication channel hidden danger point analysis method and device |
| CN107959633A (en) * | 2017-11-18 | 2018-04-24 | 浙江工商大学 | A kind of load balance method based on price mechanism in industry real-time network |
-
2018
- 2018-08-24 CN CN201810970241.7A patent/CN109344975B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102098306A (en) * | 2011-01-27 | 2011-06-15 | 北京信安天元科技有限公司 | Network attack path analysis method based on incidence matrixes |
| CN106656572A (en) * | 2016-11-18 | 2017-05-10 | 北京市天元网络技术股份有限公司 | Electric power communication channel hidden danger point analysis method and device |
| CN107959633A (en) * | 2017-11-18 | 2018-04-24 | 浙江工商大学 | A kind of load balance method based on price mechanism in industry real-time network |
Non-Patent Citations (3)
| Title |
|---|
| 张景芳，等.: "混合光交换网络中不确定业务下的优化路由方案", 《计算机应用》 * |
| 王军晓，等.: "面向数据中心网络的链路故障实时检测即服务", 《计算机研究与发展》 * |
| 陶维青,等.: "改进模因算法在含 DG 配电网故障定位中的应用", 《电子测量与仪器学报》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110233796A (en) * | 2019-05-30 | 2019-09-13 | 国网山东省电力公司信息通信公司 | A kind of power communication optimization method and equipment based on weighting routing algorithm |
| CN110233796B (en) * | 2019-05-30 | 2021-12-14 | 国网山东省电力公司信息通信公司 | Power communication network optimization method and equipment based on weighted routing algorithm |
| CN110474801A (en) * | 2019-08-09 | 2019-11-19 | 国网浙江省电力有限公司信息通信分公司 | Powerline network fault simulation method based on service reliability |
| CN110943759A (en) * | 2019-11-12 | 2020-03-31 | 国家电网有限公司信息通信分公司 | Electric power communication link data checking method based on depth-first search algorithm |
| CN110912818A (en) * | 2019-11-26 | 2020-03-24 | 中盈优创资讯科技有限公司 | Method and system for judging same route of PTN (packet transport network) service |
| CN111586504A (en) * | 2020-04-16 | 2020-08-25 | 沈阳市电信规划设计院股份有限公司 | Service-based same-route analysis method for communication operator |
| CN113225215A (en) * | 2021-05-19 | 2021-08-06 | 华北电力大学 | Method and system for identifying differentiated service network key link under SDN architecture |
| CN113225215B (en) * | 2021-05-19 | 2022-04-12 | 华北电力大学 | Method and system for identifying differentiated service network key link under SDN architecture |
| CN115883439A (en) * | 2022-11-25 | 2023-03-31 | 中国联合网络通信集团有限公司 | Network transmission path processing method, device and storage medium |
| CN116208382A (en) * | 2023-01-10 | 2023-06-02 | 中通服创立信息科技有限责任公司 | Method, system, electronic device and medium for network structural security analysis |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109344975B (en) | 2021-07-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109344975A (en) | A kind of the verification optimization method and its system of energy communication service Single Point of Faliure | |
| CN110971525B (en) | Service routing and addressing method for service operation of power communication network | |
| CN103310387B (en) | A kind of power telecom network method of operation Security Checking method | |
| CN102801732A (en) | Power communication backbone network safety risk assessment method based on network topology | |
| CN112966385A (en) | Method and system for identifying topology weak points of power distribution network frame | |
| CN106656633A (en) | System and method for evaluating transmission performance of electric power backbone OTN | |
| CN108053116A (en) | A kind of city elasticity distribution network restoration force estimation method | |
| CN113627766A (en) | Risk identification method for topology identification power failure maintenance plan | |
| CN111950146A (en) | Urban rail transit network cascade failure evaluation method based on redundancy recovery | |
| CN108667511A (en) | Optical transport network operation risk method for early warning based on depth finding and system | |
| CN102130796B (en) | Power communication network detecting method based on reverse N-1 analysis and system thereof | |
| CN114662799A (en) | Power transmission line maintenance plan optimization method, device, equipment and storage medium | |
| CN114567562A (en) | Method for identifying key nodes of coupling network of power grid and communication network | |
| CN110474801A (en) | Powerline network fault simulation method based on service reliability | |
| CN109523422A (en) | A kind of method for digging of distribution network failure influence factor | |
| CN109861855B (en) | Method and device for determining importance of nodes in power communication network | |
| CN108416531A (en) | A kind of automatic evaluation method of distribution automation planning design effect | |
| CN116667881B (en) | Electric power communication network key link evaluation method based on rapid density clustering | |
| CN109001590A (en) | A kind of grounding system single-phase grounding selecting method | |
| CN116632826A (en) | Method and device for processing problems of power distribution network, electronic equipment and storage medium | |
| CN102868563A (en) | Cross layer mapping management method of share risk link group | |
| CN113271226B (en) | Power communication gateway key link identification method and protection method thereof | |
| Wang et al. | Critical node identification for electric power communication network based on topology and services characteristics | |
| CN116346701B (en) | Power communication network key link identification method | |
| CN116260128B (en) | Regional power grid analysis method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |