CN105373835A - Link information management method based on tree model construction - Google Patents
Link information management method based on tree model construction Download PDFInfo
- Publication number
- CN105373835A CN105373835A CN201510662591.3A CN201510662591A CN105373835A CN 105373835 A CN105373835 A CN 105373835A CN 201510662591 A CN201510662591 A CN 201510662591A CN 105373835 A CN105373835 A CN 105373835A
- Authority
- CN
- China
- Prior art keywords
- link
- linked object
- tree
- information
- object tree
- 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
- 238000007726 management method Methods 0.000 title claims abstract description 33
- 238000010276 construction Methods 0.000 title abstract 2
- 238000000034 method Methods 0.000 claims abstract description 61
- 238000012216 screening Methods 0.000 claims abstract description 35
- 238000012986 modification Methods 0.000 claims description 9
- 230000004048 modification Effects 0.000 claims description 9
- 238000012545 processing Methods 0.000 claims description 7
- 238000012423 maintenance Methods 0.000 abstract description 7
- 238000012544 monitoring process Methods 0.000 description 24
- 230000000875 corresponding effect Effects 0.000 description 16
- 238000010586 diagram Methods 0.000 description 9
- 230000000750 progressive effect Effects 0.000 description 4
- 238000002474 experimental method Methods 0.000 description 3
- 230000001902 propagating effect Effects 0.000 description 3
- 235000008100 Ginkgo biloba Nutrition 0.000 description 2
- 238000012550 audit Methods 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 1
- 210000004556 brain Anatomy 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000005059 dormancy Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 230000002452 interceptive effect Effects 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/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/06—Energy or water supply
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Theoretical Computer Science (AREA)
- Tourism & Hospitality (AREA)
- Health & Medical Sciences (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Water Supply & Treatment (AREA)
- Primary Health Care (AREA)
- Public Health (AREA)
- General Health & Medical Sciences (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a link information management method based on tree model construction. The method comprises the following steps of: S1, constructing link object trees in real time according to link information of maintenance links; S2, using a set of the plurality of link object trees as a forest, and setting index information for each link object tree in the forest; and S3, after a fault in the maintenance process is discovered, converting the fault into a screening condition, carrying out querying in the forest according to the screening condition and the set index information, and displaying the information of a broken-down link. By adopting the method, the link information in the maintenance process can be effectively managed, and the safety of maintenance information is further improved.
Description
Technical field
The present invention relates to a kind of link information management method, particularly relate to a kind of needs towards the safe O&M of electric power monitoring system, based on the link information management method of structure tree-model, belong to electric power system dispatching technical field.
Background technology
In recent years, information security day by day becomes the focus of public attention, progressively rises to national strategy aspect.And the stable operation of electric system is related to national economy, it is also the important component part of national security simultaneously.Wherein, the brain of electric power monitoring system electric system especially, therefore, the security protection work of electric power monitoring system becomes the most important thing of power system security.Along with the issue of " electric power monitoring system security protection specifies " and " electric power monitoring system security protection scheme and evaluating regulation ", electric power monitoring system security protection progressively from security boundary protection to Layered Security protection development, also progressively improves the requirement of correlation technique.
Wherein, the monitoring technique in O&M process, progressively becomes the emphasis of electric power monitoring system Layered Security protection.In daily maintenance process, operation maintenance personnel, generally by O&M terminal, is directly connected or is connected by connection remittance machine and treat O&M equipment, treat O&M equipment and implement maintenance work.Therefore, carrying out in monitor procedure to O&M, there is a large amount of connecting link information, and in the process of O&M, the situation of multistage link may there is, this adds increased the management difficulty of O&M information.
How to carry out effectively managing with the safety improving O&M information to the link information in O&M process, and how efficient looking for rapidly in O&M process occurs that the link information of safety problem is directly connected to the work efficiency of electric power monitoring system, and then affect the security of operation of electric system, be problem demanding prompt solution.
Summary of the invention
For the deficiencies in the prior art, technical matters to be solved by this invention is to provide a kind of link information management method based on structure tree-model.
For achieving the above object, the present invention adopts following technical scheme:
Based on a link information management method for structure tree-model, comprise the steps:
S1, builds linked object tree in real time according to the link information of O&M link;
S2, the set of being set by multiple linked object as forest, and arranges index information for each linked object tree in forest;
S3, after finding the fault in O&M process, fault is converted into screening conditions, and the index information according to screening conditions and setting is inquired about in forest, is displayed by the link information broken down.
Wherein more preferably, in step sl, build linked object tree in real time according to the link information of O&M link to comprise the steps:
S11, according to O&M demand, finds out the link that O&M terminal arrives main frame;
S12, according to link information, judges whether there is passive link in link, if exist, then using described passive link as root node, other links derived by described passive link as leaf node, build linked object tree; Otherwise, turn to step S13;
S13, using the unknown source link in link as root node, other links derived by described link, as leaf node, build linked object tree.
Wherein more preferably, in step sl, build linked object tree in real time according to the link information of O&M link, also comprise the steps:
S14 is the linked object tree setup times stamp built.
Wherein more preferably, in step s 2, for each linked object tree in forest arranges index information, comprise the steps:
S201, linked object trees all in traversal forest, arranges tree index, sequentially numbers the tree index of linked object tree;
S202, judge whether to exist in forest the linked object tree of not setting up index, if there is no, index information is provided with; Otherwise, turn to step S203;
S203, the linked object finding the tree index number of not setting up index in forest minimum tree, judges whether the tree index number that described linked object is set is 1, and if so, the root node set for described linked object arranges link index, and link index is numbered 1; Otherwise obtain the final link index number of the link objects tree of traversal last time, the link index of root node is numbered final link index number+1;
S204, from the root node of linked object tree, every grade of node in traversal link object tree, link index numbering is sequentially set step by step, after every grade in linked object tree is all numbered, obtains the final link index number of this linked object tree, turn to step S202.
Wherein more preferably, in step s 2, according to the real-time O&M situation of electric system, when forest is upgraded, after obtaining the link information newly added, the type of link is judged, according to the type of link, unknown source link, passive link and active link are processed respectively.
Wherein more preferably, when the link obtained is unknown source link, described unknown source link is processed, comprises the steps:
S2111, finds the linked object tree belonging to it according to unknown source link information in forest;
S2112, if have found the linked object tree belonging to described unknown source link information, judge if the described time is less than the time threshold of setting, then to abandon described unknown source link information the time that described linked object tree exists according to the timestamp that described linked object is set;
S2113, if do not find described linked object to set, or the described linked object found sets the time threshold that the time existed is greater than setting, then create unknown source linked object tree.
Wherein more preferably, when the link obtained is passive link, described passive link is processed, comprises the steps:
S2121, will split into multiple unknown source link information without link information in a steady stream, comprise the unknown source linked object tree of described unknown source link, if find described unknown source linked object to set, then turn to step S2112 in gloomy inner middle searching; Otherwise, turn to step S2123;
S2122, the time that described unknown source linked object tree exists is judged according to the timestamp of described unknown source linked object tree, if the described time is less than the time threshold of setting, passive link information being given the process of described unknown source linked object tree, is described unknown source linked object tree interpolation source; Otherwise, turn to step S2123;
S2123, according to nothing link information in a steady stream, find whether to exist in forest and comprise the described nothing linked object tree of part of links information in link information in a steady stream, if existed, the timestamp then set according to described linked object judges the time that linked object tree exists, if the described time is less than the time threshold of setting, according to the linked object tree existed in forest, to processing without link information in a steady stream of obtaining; Otherwise create complete passive link object tree;
S2124, according to the sitation index information of process information amendment linked object tree;
S2125, according to modification time, upgrades the timestamp of linked object tree.
Wherein more preferably, in step S2123, according to the linked object tree existed in forest, to processing without link information in a steady stream of obtaining, comprise the steps:
Judge the whole link informations whether comprised in the linked object tree existed in forest in passive link information;
If the linked object tree existed in forest comprises the full detail without link information in a steady stream, then abandoned;
Otherwise the nothing do not comprised by the linked object existed in forest tree in a steady stream link information is added in linked object tree.
Wherein more preferably, when the link obtained is active link, described active link is processed, comprises the steps:
S2131, the forward chaining of active link information is set to source, and backward chaining is set to object, in forest, find the linked object tree comprising its partial link information according to source and destination respectively, if do not found, then in forest, create active linked object tree, otherwise, turn to step S2132;
S2132, judges according to the timestamp of the linked object tree found the time that this linked object tree exists, if the described time is less than the time threshold of setting, then the content set by described linked object in the active link information do not comprised is added to linked object tree;
S2133, according to the sitation index information of the content modification linked object tree of adding;
S2134, according to modification time, upgrades the timestamp of linked object tree.
Wherein more preferably, in step s3, the index information according to screening conditions and setting is inquired about in forest, is displayed by the link information broken down, comprises the steps:
S31, according to screening conditions, searches out the set of linked object tree in forest;
S32, adopts topological link algorithm to obtain every linked object and sets the link information meeting screening conditions;
S33, is converted into PUSH message by all link informations obtained, is pushed to electric system one by one and shows.
Wherein more preferably, in step s 32, adopt topological link algorithm to obtain every linked object and set the link information meeting screening conditions, comprise the steps:
S321, obtains the destination host be present in linked object tree according to screening conditions;
S322, according to linked object tree, reverse traversal from the leaf node at destination host place, finds all link informations leading to root node;
S323, all link informations reverse traversal found carry out putting inverse operation, obtain the link information of forward chaining.
Link information management method based on structure tree-model provided by the present invention, linked object tree is built in real time according to the link information of O&M link, multiple linked object tree is built forest, and index information is set for each linked object tree in forest, after finding the fault in O&M process, fault is converted into screening conditions, and monitoring host computer is inquired about according in the index information of screening conditions and the setting forest that the heart builds in the information; The link information broken down is displayed.Utilize the present invention, can realize effectively managing the link information in O&M process, and then improve the safety of O&M information.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of the link information management method based on structure tree-model provided by the present invention;
Fig. 2 is in link information management method provided by the present invention, the schematic diagram of the physical access of main frame;
Fig. 3 is in link information management method provided by the present invention, the process flow diagram of SSH service end and client reporting information;
Fig. 4 is in one embodiment of the present of invention, the process flow diagram that forest builds;
Fig. 5 is in link information management method provided by the present invention, to the process flow diagram that unknown source link information processes;
Fig. 6 is in link information management method provided by the present invention, to the process flow diagram that passive link information processes;
Fig. 7 is in link information management method provided by the present invention, to the process flow diagram that active link information processes;
Fig. 8 is in link information management method provided by the present invention, adopts topological link algorithm to carry out the process flow diagram inquired about.
Embodiment
Below in conjunction with the drawings and specific embodiments, detailed specific description is carried out to technology contents of the present invention.
As shown in Figure 1, first the link information management method based on structure tree-model provided by the present invention, comprise the steps:, information center builds linked object tree in real time according to the link information that O&M links; Then, multiple linked object tree is built forest, and index information is set for each linked object tree in forest, in the present invention, said forest refers to the set that multiple linked object is set, and according to the real-time O&M situation of electric system, upgrades in real time to forest; After finding the fault in O&M process, fault is converted into screening conditions, monitoring host computer is inquired about according in the index information forest that the heart builds in the information of screening conditions and setting; Finally, the link information broken down is displayed.Detailed specific description is done to this process below.
S1, information center builds linked object tree in real time according to the link information that O&M links.
In embodiment provided by the present invention, when O&M terminal (client or server) is safeguarded main frame time, the link producing link has three types: passive link, active link, unknown source link, and definition is as follows respectively:
Definition passive link: produced by client, without higher level's link information, be called passive link.
Define active link: produced by client, there is higher level's link information, be called finite link.
Definition unknown source link: the link information produced by service end, is all called unknown source link.
Link can be divided into three kinds by state: active links, dormancy link, link of mourning in silence.Link related information is defined as follows table 1.
Table 1 link related information definition list
In O&M process, O&M terminal and main frame can by link information reporting information centers, and information center collects the link information that client and service end report, and builds linked object tree, there are three main frame: Host in supposing the system
a, Host
b, Host
c, and an information center Injo
c.There is now following access path:
Host
A→Host
B→Host
C
I.e. host A access host B, afterwards from host B access host C, its schematic diagram as shown in Figure 2.
In embodiment provided by the present invention, be applied as example with SSH (SecureShell, i.e. safety shell protocol), suppose Host
a, Host
b, Host
chave separately and the linking of information center, SSH link information can be reported to information center.Access process is that therefore the report of link information is reported by ssh client and service end simultaneously from ssh client access SSH service end.
The access process that ssh client and service end cross over 3 main frames is described, that is: Client in Fig. 2
sSH_A→ Server
sSH_B|| Client
sSH_B→ Server
sSH_C, produce message sequence in this process as follows.
Host A access host B, afterwards from the process of host B access host C, link information reports process as shown in Figure 3, report 1 is sent to information center by the ssh client of host A, access host B, the access of the SSH server Receiving Host A of host B, report 2 is sent to information center simultaneously, the ssh client access host C of host B, the SSH server of host C receives access, report 3 is sent to information center, the access of the ssh client of the SSH server Receiving Host B of host C simultaneously, send report 4 to information center simultaneously.All comprise the link information of host link in the report sent, particular content is as shown in table 2.
The link information table that table 2SSH client and service end report
After information center receives the link information reported, build linked object tree in real time according to the link information of O&M link, specifically comprise the steps:
S11, according to O&M demand, finds out the link that O&M terminal arrives main frame;
S12, according to link information, judges whether there is passive link in link, if exist, then using this passive link as root node, other links derived by this link as leaf node, build linked object tree; Otherwise, turn to step S13;
S13, using the unknown source link in link as root node, other links derived by this link, as leaf node, build linked object tree;
S14 is the linked object tree setup times stamp built.
Linked object tree is the set of the link of the relevant access carried out by a main frame, the link establishment existed when linked object tree root was accessed according to this main frame first time, the node that follow-up other links constantly derived by this link are set as linked object.Derived tree constantly growth in the process of other links by Article 1 link, therefore the tree of this state is also called linked object Propagating Tree.Until after the disconnection of Article 1 link, tree stops growing, and is now called that linked object fossil is set.After structure linked object tree, for the linked object tree setup times stamp built, the time that linked object tree exists is judged according to the timestamp of linked object tree, if this time is less than the time threshold of setting, then linked object tree can continue to increase leaf node by other links derivative according to link; If this time is greater than the time threshold of setting, then other links that link is derivative rebuild linked object tree.Be described in detail in subsequent step, just repeated no more at this.
In an embodiment provided by the present invention, produce following information when initiating the SSH service end of another main frame of access by ssh client: ssh client produces active or passive link information; SSH service end produces unknown source link information, authentication information, service request information, many operation informations and link ending message.The information of the above type produced by same link, as the attribute of link, is added in linked object tree.Link attribute comprises the content of five aspects, as shown in 3 tables.
| Label | Content |
| 1 | Link information: active link information, passive link information, unknown source link information |
| 2 | Authentication information |
| 3 | Service request information |
| 4 | Operation information |
| 5 | Exit information |
The list of table 3 link attribute
S2, the set of being set by multiple linked object as forest, and arranges index information for each linked object tree in forest, according to the real-time O&M situation of electric system, upgrades forest.
In the present invention, said forest refers to the set that multiple linked object is set.In embodiment provided by the present invention, the building process of one group of linked object tree of being correlated with is called the structure of a forest.For information center, linked object Propagating Tree is built by the information that main frame reports, after linked object Propagating Tree becomes linked object fossil tree, stored by linked object fossil tree, therefore the forest of information center contains the complete or collected works of SSH information in system.
In embodiment provided by the present invention, there are two trees in forest, the process that each linked object tree in forest arranges index information is described in detail.Specifically comprise the steps:
S201, linked object trees all in traversal forest, for it arranges tree index, sequentially numbers it; Wherein, the integer being greater than 0 is numbered.
As shown in Figure 4, in forest, there are two trees, be respectively A1B1 tree and A2B2 tree, for every tree arranges tree index, distinguished by tree index (from 1 progressive whole number) between every tree.
S202, judge whether to exist in forest the linked object tree of not setting up index, if there is no, index information is provided with; Otherwise, turn to step S203;
S203, the linked object finding the tree index number of not setting up index in forest minimum tree, judges whether its tree index number is 1, if arrange link index for its root node, link index is numbered 1; Otherwise obtain the final link index number of the link objects tree of traversal last time, the link index of root node is numbered final link index number+1; Wherein, the corresponding integer index value of higher level's link of passive link and unknown source link is 0.
The linked object tree finding the tree index number of not setting up index in forest minimum, A1B1 sets, in tree, each node is linking element, linking element with one-level distinguishes (link index is numbered progressive whole number from 1) by link index, during modeling, MD5 value (source host name, source IP, source port, destination host name, object IP) is converted into progressive whole number.Wherein, in embodiment provided by the present invention, link index is the unique identification of link, is divided into active link index, passive link index and unknown link index three types.Active link index is: source host name, source IP, source port, destination host name, object IP, and the MD5 cryptographic hash of these five kinds of information, referred to as MD5 value.In detail as following table 4.
Table 4 link index table
During A1 → B1 access, higher level's link index is passive link index (0xFFFFFFFFFFFFFFFF), higher level's link index being changed into integer link index respective value is 0 (note, passive link and higher level's link index integer index value corresponding to unknown source link are 0), the active link index MD5 value of generation at the corresponding levels, after modeling, link index value (link index numbering) is 1, as shown in table 5.
| Link index at the corresponding levels | 1 |
| Higher level's link index | 0 |
| Connecting object tree index | 1 |
The link index table of the root node of table 5A1B1 tree
S204, from the root node of linked object tree, every grade of node in traversal link object tree, link index numbering is sequentially set step by step, after every grade in linked object tree is all numbered, obtains the final link index number of this linked object tree, turn to step S202.
During B1 → C1, higher level's link index is A1 → B1, and higher level's link index is numbered 1, and during B1 → C1, produce a new link index (link index is numbered 2), due in same one tree, tree index identical (value is 1), as shown in table 6.
| Link index at the corresponding levels | 2 |
| Higher level's link index | 1 |
| Connecting object tree index | 1 |
The link index table of the one-level leaf node of table 6A1B1 tree
During C1 → D1, higher level's link index is B1 → C1, and higher level's link index is numbered 2, and during C1 → D1, produce a new link index (link index is numbered 3), due in same one tree, tree index identical (value is 1), as shown in table 7.
| Link index at the corresponding levels | 3 |
| Higher level's link index | 2 |
| Connecting object tree index | 1 |
The link index table of the secondary leaf node of table 7A1B1 tree
So far, every grade of link of A1B1 tree is all numbered, obtain the final link index number 3 of this linked object tree, then judge to exist in forest the linked object tree A2B2 tree of not setting up index, it is not for setting up the minimum linked object tree of the tree index number of index, obtain the final link index number 3 of the link objects tree of traversal last time, the link index of root node is numbered final link index number+1; During A2 → B2 access, higher level's link index is passive link index (0xFFFFFFFFFFFFFFFF), higher level's link index being changed into integer link index respective value is 0 (note, passive link and higher level's link index integer index value corresponding to unknown source link are 0), the active link index MD5 value of generation at the corresponding levels, after modeling, link index value is 4 (the final link index number+1 of the link objects tree that last time travels through), as shown in table 8.
| Link index at the corresponding levels | 4 |
| Higher level's link index | 0 |
| Connecting object tree index | 2 |
The link index table of the root node of table 8A2B2 tree
During B2 → C2, higher level's link index is A2 → B2, and higher level's link index is numbered 4, and and B2 → C2 time produce a new link index (link index is numbered 5), due in same one tree, tree index identical (value is 2), as shown in table 9.
| Link index at the corresponding levels | 5 |
| Higher level's link index | 4 |
| Connecting object tree index | 2 |
The link index table of the one-level leaf node of table 9A2B2 tree
During C2 → D2, higher level's link index is B2 → C2, and higher level's link index is numbered 5, and during C2 → D2, produce a new link index (link index is numbered 6), due in same one tree, tree index identical (value is 2), as shown in table 10.
| Link index at the corresponding levels | 6 |
| Higher level's link index | 5 |
| Connecting object tree index | 2 |
The link index table of the secondary leaf node of table 10A2B2 tree
So far, every grade of link of A2B2 tree is all numbered, and obtains the final link index number 6 of this linked object tree, and then judge not exist in forest the linked object tree of not setting up index, index information is provided with.
According to the real-time O&M situation of electric system, upgrade in real time to forest, to ensure when O&M process breaks down, the information inquired according to screening conditions is link information accurately.According to the real-time O&M situation of electric system, after obtaining the link information newly added, the type of link is judged, according to the type of link, unknown source link, passive link and active link is processed respectively.
Wherein, as shown in Figure 5, when the link obtained is unknown source link, it is processed, specifically comprises the steps:
S2111, finds the linked object tree belonging to it according to unknown source link information in forest.
S2112, if have found the linked object tree at its place, the time that this linked object tree exists is judged according to the timestamp that this linked object is set, if this time is less than the time threshold of setting, prove that the unknown source link information reported by ssh client creates corresponding linked object tree, therefore this information is without the need to process, is abandoned.
S2113, if do not find linked object to set, or the time that the linked object tree found exists is greater than the time threshold of setting, prove that the link information that the link information that SSH service end reports reports than ssh client first arrives, therefore unknown source linked object tree is created, for the treatment of follow-up other information reported.
As shown in Figure 6, when the link obtained is passive link, it is processed, specifically comprises the steps:
S2121, according to the nothing unknown source linked object tree of link information at its unknown source link place comprised of gloomy inner middle searching in a steady stream, if find unknown source linked object to set, then turns to step S2112; Otherwise, turn to step S2123;
S2122, the time that this unknown source linked object tree exists is judged according to the timestamp of this unknown source linked object tree, if this time is less than the time threshold of setting, passive link information being given the process of this unknown source linked object tree, is this unknown source linked object tree interpolation source; Otherwise, turn to step S2123;
S2123, according to finding the linked object tree whether existing and comprise its part of links information in forest without link information in a steady stream, if existed, the timestamp then set according to this linked object judges the time that this linked object tree exists, if this time is less than the time threshold of setting, according to the linked object tree existed in forest, to processing without link information in a steady stream of obtaining; Otherwise create complete passive link object tree.
In forest, the linked object tree whether existing and comprise part of links information in the link information of source is found according to passive link information, if existed, the timestamp then set according to this linked object judges the time that this linked object tree exists, if this time is less than the time threshold of setting, according to the linked object tree existed in forest, to processing without link information in a steady stream of obtaining, comprise following processing procedure: judge linked object tree comprise link information in passive link information number, if the linked object tree existed in forest comprises the full detail without link information in a steady stream, then abandoned, if the linked object tree existed in forest can not comprise the full detail without link information in a steady stream, then what do not comprised by the linked object existed in forest tree adds in linked object tree without link information in a steady stream.
S2124, according to the sitation index information of process information amendment linked object tree;
S2125, according to modification time, upgrades the timestamp of linked object tree.
As shown in Figure 7, when the link obtained is active link, it is processed, specifically comprises the steps:
S2131, the forward chaining of active link information is set to source, and backward chaining is set to object, in forest, find the linked object tree comprising its partial link information according to source and destination respectively, if do not found, then in forest, create active linked object tree, otherwise, turn to step S2132;
S2132, judges according to the timestamp of the linked object tree found the time that this linked object tree exists, if this time is less than the time threshold of setting, then the content set by linked object in the active link information do not comprised is added to linked object tree;
S2133, according to the sitation index information of the content modification linked object tree of adding;
S2134, according to modification time, upgrades the timestamp of linked object tree.
S3, after finding the fault in O&M process, is converted into screening conditions by fault, and monitoring host computer is inquired about according in the forest of the index information of screening conditions and the setting heart in the information, is displayed by the link information broken down.
After finding the fault in O&M process, fault is converted into screening conditions, monitoring host computer, according to the index information of screening conditions and setting, is inquired about in the forest of the heart in the information.The set meeting the connecting object tree of this condition filtered out in forest, the sub-forest of the condition that is called.The process of the query script of monitoring host computer and the sub-forest of structural environment is consistent with the method that information center constructs forest.Therefore, forest building process can in the information the heart, monitoring host computer and other need the place of obtaining information to use.
In embodiment provided by the present invention, carrying out in the process safeguarded, main frame can report relevant information to information center, builds forest according to the relevant information that main frame reports.The screening conditions that monitoring host computer transforms according to fault are to information center's query-related information, and after obtaining information, monitoring host computer shows relevant information.Wherein, monitoring host computer according to the index information of screening conditions and setting in the information the heart inquire about, the link information broken down is displayed, specifically comprises the steps:
S31, monitoring host computer, according to screening conditions, searches out the set of related link objects tree in forest;
S32, adopts topological link algorithm to obtain every linked object and sets the link information meeting screening conditions;
As shown in Figure 8, adopt topological link algorithm to obtain every linked object and set the link information meeting screening conditions, specifically comprise the steps:
S321, obtains the destination host be present in linked object tree according to screening conditions;
S322, according to linked object tree, reverse traversal from the leaf node at destination host place, finds all link informations leading to root node;
S323, all link informations reverse traversal found carry out putting inverse operation, obtain the link information of forward chaining.
In embodiment provided by the present invention, take destination host as C1 be example, the process obtaining link information is as follows:
First, query aim main frame is the link node of C1, by the reverse traversal of leaf node → root node at C1 place, there are following three kinds of situations:
(1) C1 → B1 → A1 (link 1), puts inverse operation, obtains access link and is: A1 → B1 → C1.
(2) C1 → D1 → B1 → A1 (link 2), puts inverse operation, obtains access link and is: A1 → B1 → D1 → C1.
(3) C1 → N1 → B1 → A1 (link 3), puts inverse operation, obtains access link and is: A1 → B1 → N1 → C1.
S33, is converted into PUSH message by all link informations obtained, is pushed to electric system one by one and shows.
Incidence relation between link information can be set by linked object and obtain, and linked object tree is unit composition based on link information, therefore, inquires about the linked object tree at its place by link information, also can obtain link information according to linked object tree.If certain screening conditions needs to use the relation between tree and tree, then can set up certain index according to dependency rule in tree set, obtain relevant information.Therefore, no matter how exhibition method and screening conditions change, and monitoring host computer only need carry out traversal acquisition exhibition information according to the set of exhibition method to tree.
Time the link information broken down is displayed, can select as required to be show one by one, or show with the form of linked object tree.If need to show with the form of linked object tree, linked object tree can be rebuilded according to the PUSH message based on linking element obtained, be the information universal set that monitoring host computer obtains according to condition, monitoring host computer can carry out the traversal of different modes according to interactive mode and user's request to tree, can obtain foreground exhibition information.Wherein, the mode rebuilding linked object tree is identical with the mode establishing the link object tree.
Below by experiment, use the link information management method based on structure tree-model provided by the present invention, audit management is carried out to link information.
This experiment is with Host
a(IP:192.168.10.242) client-access Host
b(IP:192.168.20.169) service end, and Host
cclient-access native service end (127.0.0.1) is example: Client
sSH_A→ Server
sSH_B|| Client
sSH_B→ Server
sSH_B, this access process produces following information sequence.
Gather the raw data of coming up to have: produce link information, authentication information, service request information, operation information, exit information.In same one-level link, raw data essential information has identical link index.
First, Article 1 link, i.e. Host
aclient-access Host
bthe link of service end., gather raw data have as shown in table 11 below.
Table 11 Article 1 link primary data information (pdi) table
After Article 2 link: 192.168.20.169 → 192.168.20.169 logs in, topological link is following (namely from 192.168.20.169 server S SH to logging on 127.0.0.1).
(192.168.10.242→192.168.20.169→192.168.20.169)
Link information is as shown in table 12 below.
Table 12 Article 2 link primary data information (pdi) table
According to link information, the link index (6603A17D9A6F7BAE6C624123CC6802DD) of 192.168.10.242 → 192.168.20.169 and the link index (D887FE0FC976C5BB8F839F9CBF5BF913) of 192.168.20.169 → 192.168.20.169 can be generated respectively, then according to raw information, establish the link object tree, when setting up tree-model, tree index is as the unique identification (from 0 incrementing integers) of tree, link index is as the unique identification (from 1 progressive whole number) of link, the general index table built is as shown in table 13, the 192.168.10.242->192.168.20.169 link index table built is as shown in table 14, the 192.168.20.169->192.168.20.169 link index table built is as shown in Table 15.
| In raw data concordance list | Model correspondence table | Index type |
| FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF | 0 | Unknown source |
| 6603A17D9A6F7BAE6C624123CC6802DD | 58 | Active |
| D887FE0FC976C5BB8F839F9CBF5BF913 | 59 | Active |
Table 13 general index information table
| Link index at the corresponding levels | 58 |
| Higher level's link index | 0 |
| Tree index | 55 |
| Source host name | PC1 |
| Source host IP | 192.168.10.242 |
| Link port | 34243 |
| Destination host name | as-scd1 |
| Object IP | 192.168.20.169 |
| Login time | 2015-07-23 11:37:55 |
| Post-set time | 2015-07-23 11:40:33 |
| User name | usrname0 |
| COS | SSH |
| Auth type | Cipher authentication |
Table 14192.168.10.242->192.168.20.169 link index table
| Link index at the corresponding levels | 59 |
| Higher level's link index | 58 |
| Tree index | 55 |
| Source host name | as-scd1 |
| Source host IP | 192.168.20.169 |
| Link port | 63148 |
| Destination host name | as-scd1 |
| Object IP | 192.168.20.169 |
| Login time | 2015-07-23 11:38:29 |
| Post-set time | 2015-07-23 11:40:30 |
| User name | usrname0 |
| COS | SSH |
| Auth type | Cipher authentication |
Table 15192.168.20.169->192.168.20.169 link index table
According to the SSH access process of 192.168.10.242 → 192.168.20.169 → 192.168.20.169, gather original base information (see table 11, table 12), set up corresponding tree-model (see table 14, table 15), in an experiment, tree index is 55, hereinafter referred to as " tree 55 ", there are two nodes in " tree 55 ", root node link 192.168.10.242 → 192.168.20.169, link index is 58, hereinafter referred to as " node 58 ", leaf node link 192.168.20.169 → 192.168.20.169, link index 59, hereinafter referred to as " node 59 ".Obtained the Back ground Information of node " 58 ", node " 59 " by traversal " tree 55 ", complete audit ssh being operated to overall process, realize the management to link information.
In sum, the link information management method based on structure tree-model provided by the present invention, first, builds linked object tree in real time according to the link information of O&M link; Then, multiple linked object tree is built forest, and index information is set for each linked object tree in forest, according to the real-time O&M situation of electric system, forest is upgraded; After finding the fault in O&M process, fault is converted into screening conditions, monitoring host computer is inquired about according in the index information forest that the heart builds in the information of screening conditions and setting; Finally, the link information broken down is displayed.Utilize the present invention, can realize effectively managing the link information in O&M process, and then improve the safety of O&M information, when breaking down in O&M process, carry out inquiry in the forest built by the heart in the information and efficiently can look for the link information occurring safety problem rapidly, improve the work efficiency of electric power monitoring system, and then the security of the operation of raising electric system.
Above the link information management method based on structure tree-model provided by the present invention is described in detail.For one of ordinary skill in the art, to any apparent change that it does under the prerequisite not deviating from connotation of the present invention, all by formation to infringement of patent right of the present invention, corresponding legal liabilities will be born.
Claims (11)
1., based on a link information management method for structure tree-model, it is characterized in that comprising the steps:
S1, builds linked object tree in real time according to the link information of O&M link;
S2, the set of being set by multiple linked object as forest, and arranges index information for each linked object tree in forest;
S3, after finding the fault in O&M process, fault is converted into screening conditions, and the index information according to screening conditions and setting is inquired about in forest, is displayed by the link information broken down.
2. as claimed in claim 1 based on the link information management method of structure tree-model, it is characterized in that in step sl, build linked object tree in real time according to the link information of O&M link and comprise the steps:
S11, according to O&M demand, finds out the link that O&M terminal arrives main frame;
S12, according to link information, judges whether there is passive link in link, if exist, then using described passive link as root node, other links derived by described passive link as leaf node, build linked object tree; Otherwise, turn to step S13;
S13, using the unknown source link in link as root node, other links derived by described link, as leaf node, build linked object tree.
3. as claimed in claim 2 based on the link information management method of structure tree-model, it is characterized in that, in step S1, build linked object tree in real time according to the link information of O&M link and also comprise the steps:
S14 is the linked object tree setup times stamp built.
4. as claimed in claim 1 based on the link information management method of structure tree-model, it is characterized in that in step s 2, for each linked object tree in forest arranges index information, comprise the steps:
S201, linked object trees all in traversal forest, arranges tree index, sequentially numbers the tree index of linked object tree;
S202, judge whether to exist in forest the linked object tree of not setting up index, if there is no, index information is provided with; Otherwise, turn to step S203;
S203, the linked object finding the tree index number of not setting up index in forest minimum tree, judges whether the tree index number that described linked object is set is 1, and if so, the root node set for described linked object arranges link index, and link index is numbered 1; Otherwise obtain the final link index number of the link objects tree of traversal last time, the link index of root node is numbered final link index number+1;
S204, from the root node of linked object tree, every grade of node in traversal link object tree, link index numbering is sequentially set step by step, after every grade in linked object tree is all numbered, obtains the final link index number of this linked object tree, turn to step S202.
5., as claimed in claim 1 based on the link information management method of structure tree-model, it is characterized in that:
In step s 2, according to the real-time O&M situation of electric system, when forest is upgraded, after obtaining the link information newly added, the type of link is judged, according to the type of link, unknown source link, passive link and active link is processed respectively.
6. as claimed in claim 5 based on the link information management method of structure tree-model, it is characterized in that, when the link obtained is unknown source link, described unknown source link is processed, comprises the steps:
S2111, finds the linked object tree belonging to it according to unknown source link information in forest;
S2112, if have found the linked object tree belonging to described unknown source link information, judge if the described time is less than the time threshold of setting, then to abandon described unknown source link information the time that described linked object tree exists according to the timestamp that described linked object is set;
S2113, if do not find described linked object to set, or the described linked object found sets the time threshold that the time existed is greater than setting, then create unknown source linked object tree.
7. as claimed in claim 5 based on the link information management method of structure tree-model, it is characterized in that, when the link obtained is passive link, described passive link is processed, comprises the steps:
S2121, will split into multiple unknown source link information without link information in a steady stream, comprise the unknown source linked object tree of described unknown source link, if find described unknown source linked object to set, then turn to step S2112 in gloomy inner middle searching; Otherwise, turn to step S2123;
S2122, the time that described unknown source linked object tree exists is judged according to the timestamp of described unknown source linked object tree, if the described time is less than the time threshold of setting, passive link information being given the process of described unknown source linked object tree, is described unknown source linked object tree interpolation source; Otherwise, turn to step S2123;
S2123, according to nothing link information in a steady stream, find whether to exist in forest and comprise the described nothing linked object tree of part of links information in link information in a steady stream, if existed, the timestamp then set according to described linked object judges the time that linked object tree exists, if the described time is less than the time threshold of setting, according to the linked object tree existed in forest, to processing without link information in a steady stream of obtaining; Otherwise create complete passive link object tree;
S2124, according to the sitation index information of process information amendment linked object tree;
S2125, according to modification time, upgrades the timestamp of linked object tree.
8. as claimed in claim 7 based on the link information management method of structure tree-model, it is characterized in that in step S2123, according to the linked object tree existed in forest, to processing without link information in a steady stream of obtaining, comprise the steps:
Judge the whole link informations whether comprised in the linked object tree existed in forest in passive link information;
If the linked object tree existed in forest comprises the full detail without link information in a steady stream, then abandoned;
Otherwise the nothing do not comprised by the linked object existed in forest tree in a steady stream link information is added in linked object tree.
9. as claimed in claim 5 based on the link information management method of structure tree-model, it is characterized in that, when the link obtained is active link, described active link is processed, comprises the steps:
S2131, the forward chaining of active link information is set to source, and backward chaining is set to object, in forest, find the linked object tree comprising its partial link information according to source and destination respectively, if do not found, then in forest, create active linked object tree, otherwise, turn to step S2132;
S2132, judges according to the timestamp of the linked object tree found the time that this linked object tree exists, if the described time is less than the time threshold of setting, then the content set by described linked object in the active link information do not comprised is added to linked object tree;
S2133, according to the sitation index information of the content modification linked object tree of adding;
S2134, according to modification time, upgrades the timestamp of linked object tree.
10. as claimed in claim 1 based on the link information management method of structure tree-model, it is characterized in that in step s3, index information according to screening conditions and setting is inquired about in forest, is displayed by the link information broken down, comprises the steps:
S31, according to screening conditions, searches out the set of linked object tree in forest;
S32, adopts topological link algorithm to obtain every linked object and sets the link information meeting screening conditions;
S33, is converted into PUSH message by all link informations obtained, is pushed to electric system one by one and shows.
11., as claimed in claim 1 based on the link information management method of structure tree-model, is characterized in that in step s 32, adopt topological link algorithm to obtain every linked object and set the link information meeting screening conditions, comprise the steps:
S321, obtains the destination host be present in linked object tree according to screening conditions;
S322, according to linked object tree, reverse traversal from the leaf node at destination host place, finds all link informations leading to root node;
S323, all link informations reverse traversal found carry out putting inverse operation, obtain the link information of forward chaining.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510662591.3A CN105373835B (en) | 2015-10-14 | 2015-10-14 | Link information management method based on structure tree model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510662591.3A CN105373835B (en) | 2015-10-14 | 2015-10-14 | Link information management method based on structure tree model |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105373835A true CN105373835A (en) | 2016-03-02 |
| CN105373835B CN105373835B (en) | 2021-07-02 |
Family
ID=55376015
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510662591.3A Active CN105373835B (en) | 2015-10-14 | 2015-10-14 | Link information management method based on structure tree model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105373835B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0336035A2 (en) * | 1988-04-08 | 1989-10-11 | International Business Machines Corporation | Tree structure database system |
| US20100131564A1 (en) * | 2005-11-14 | 2010-05-27 | Pettovello Primo M | Index data structure for a peer-to-peer network |
| CN102169507A (en) * | 2011-05-26 | 2011-08-31 | 厦门雅迅网络股份有限公司 | Distributed real-time search engine |
| US20120197900A1 (en) * | 2010-12-13 | 2012-08-02 | Unisys Corporation | Systems and methods for search time tree indexes |
| CN104240461A (en) * | 2014-08-28 | 2014-12-24 | 国家电网公司 | Intelligent alarm three-dimensional figure dynamic display method for electrical power system |
| CN104853220A (en) * | 2015-05-18 | 2015-08-19 | 武汉随锐亿山科技有限公司 | HEVC coding quadtree recursive decoding method |
-
2015
- 2015-10-14 CN CN201510662591.3A patent/CN105373835B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0336035A2 (en) * | 1988-04-08 | 1989-10-11 | International Business Machines Corporation | Tree structure database system |
| US20100131564A1 (en) * | 2005-11-14 | 2010-05-27 | Pettovello Primo M | Index data structure for a peer-to-peer network |
| US20120197900A1 (en) * | 2010-12-13 | 2012-08-02 | Unisys Corporation | Systems and methods for search time tree indexes |
| CN102169507A (en) * | 2011-05-26 | 2011-08-31 | 厦门雅迅网络股份有限公司 | Distributed real-time search engine |
| CN104240461A (en) * | 2014-08-28 | 2014-12-24 | 国家电网公司 | Intelligent alarm three-dimensional figure dynamic display method for electrical power system |
| CN104853220A (en) * | 2015-05-18 | 2015-08-19 | 武汉随锐亿山科技有限公司 | HEVC coding quadtree recursive decoding method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105373835B (en) | 2021-07-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106168965B (en) | Knowledge graph construction system | |
| CN103218398B (en) | Intelligent substation SCL (substation configuration description language) file difference comparison method | |
| CN113961434A (en) | Method and system for monitoring abnormal behaviors of distributed block chain system users | |
| CN104331457A (en) | Database node-based data access method and system | |
| CN106534164B (en) | Effective virtual identity depicting method based on cyberspace user identifier | |
| CN110427298B (en) | Automatic feature extraction method for distributed logs | |
| CN112270550A (en) | New energy electric power source tracing method and system based on block chain | |
| CN105162855A (en) | Incremental data synchronization method and device | |
| CN104462121A (en) | Data processing method, device and system | |
| CN108829884A (en) | data mapping method and device | |
| CN104917627A (en) | Log cluster scanning and analysis method used for large-scale server cluster | |
| CN109325077A (en) | A kind of system that number storehouse in real time is realized based on canal and kafka | |
| CN106681169A (en) | Electrical power system safety control simulation integrated platform and simulation method thereof | |
| CN108052358A (en) | A kind of system and method for distributed deployment | |
| CN113821538B (en) | Stream data processing system based on metadata | |
| CN103854230A (en) | Electric power security risk management and control system and method | |
| CN107301251A (en) | A kind of method and system of database synchronization | |
| CN105282099B (en) | The generation method and device of firewall order | |
| CN103258255A (en) | Knowledge discovery method applicable to power grid management system | |
| CN110597894B (en) | Real-time inquiry system for organization mechanism data | |
| CN106100932B (en) | A kind of substation data processing system based on data sharing | |
| CN105373835A (en) | Link information management method based on tree model construction | |
| CN106790357A (en) | A kind of consultation on-line method | |
| Yisong et al. | Study on the relationship between transmission line failure rate and lightning information based on Neo4j | |
| CN108052587A (en) | Big data analysis method based on decision tree |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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 |