Computer network engineering safety control system

Abstract

The invention discloses a computer network engineering safety control system, relates to the technical field of network engineering, and solves the problem that whether network nodes are overloaded or not is not deeply analyzed in the prior art. The data request processing capability of the related nodes relative to the secondary nodes is visually and quantitatively presented; the node verification analysis end accurately evaluates the standard reaching condition of the related node in combination with the historical feature interval and the quantitative graph, an intuitive and accurate basis is provided for judging whether the node is in a reasonable operation state or not, and the node parameter limiting end can determine whether the related node is in a reasonable operation state or not based on the quantitative feature area when it is judged that the related node possibly has excessive load. Quickly calculating a request quantity limiting parameter of the secondary node, and displaying the request quantity limiting parameter through a display end; in this way, external personnel can intervene in the single request quantity of the secondary node according to the limiting parameters, and network operation parameters are adjusted.

Description

Technical Field

[0001] The invention relates to the technical field of network engineering, in particular to a computer network engineering safety control system. Background Art

[0002] With the continuous advancement of digitalization, computer networks are increasingly used in various fields, especially in the field of network engineering, where stable and secure network operation is essential. In high-load, high-concurrency network scenarios, the risk of network nodes being paralyzed due to data interaction overload increases significantly. Once a network security incident occurs, it will cause serious losses to enterprises and users.

[0003] Traditional network security control systems have limitations, making it difficult to comprehensively and accurately evaluate and warn of network node load conditions. On the one hand, most existing systems only analyze real-time data, lack in-depth mining of historical data, and cannot use past experience to predict future node load trends. On the other hand, when judging whether a node meets the standards and dealing with potential overload risks, there is a lack of quantitative and visual means, making it difficult for network security managers to make decisions quickly and accurately.

[0004] In this context, how to effectively evaluate the operating status of network nodes and predict and prevent network security incidents caused by node overload in advance has become an urgent problem to be solved in the field of network engineering. The computer network engineering security control system provided by the present invention fills the gap in the prior art through in-depth analysis of the network topology structure, combined with multi-dimensional mining of historical data, as well as quantitative evaluation and dynamic parameter adjustment, and provides a strong guarantee for the safe and stable operation of network engineering. Summary of the invention

[0005] In view of the deficiencies of the prior art, the present invention provides a computer network engineering safety control system, which solves the problem that the prior art does not conduct an in-depth analysis on whether a network node will be overloaded.

[0006] To achieve the above objectives, the present invention is implemented through the following technical solutions: A computer network engineering security control system, comprising:

[0007] The topology processing end determines the relationship diagram by confirming the topological relationship between nodes from the network topology diagram associated with the network project. The specific method is as follows:

[0008] A group of nodes are randomly selected from the network topology as related nodes, and other nodes that are connected to the related nodes are identified, and the other associated nodes are recorded as secondary nodes of the related nodes;

[0009] If there is only one set of secondary nodes associated with the corresponding related node, no processing is required;

[0010] If there are multiple groups of sub-nodes associated with the corresponding related node, a relationship graph belonging to the related node is generated based on the connection relationship between the related node and the multiple groups of sub-nodes;

[0011] The node feature processing end locks the historical feature interval based on the relationship graph of related nodes. The specific method is as follows:

[0012] Based on the relationship graph of related nodes, confirm the device to which the related node belongs, record it as the main device, then confirm the device to which the corresponding secondary node belongs, record it as the secondary device, confirm the relationship between the main device and each secondary device, record it as a set of devices;

[0013] From the historical data in the cloud, confirm the interaction records associated with the corresponding device set, and confirm the request volume that the corresponding secondary device needs to make data requests to the primary device each time from the interaction records, integrate the confirmed groups of request volumes, and confirm a set of request volumes;

[0014] Perform feature analysis on a single set of request quantities: re-sort the request quantities of several groups associated in the set according to the value from small to large to confirm the sorted set, randomly select a value segment from the sorted set to confirm the variance, and record the value segment that satisfies: variance ≤ Y1 as the standard value segment, where Y1 is the preset value. From the confirmed standard value segments, select the one with the largest number of values ​​as the selected value segment. If there are multiple groups of standard value segments with the largest number, select the standard value segment with the smallest value range as the selected value segment. Confirm the minimum request quantity and the maximum request quantity from the selected value segment as the historical feature interval of the device set corresponding to this request quantity set;

[0015] The historical feature intervals associated with different equipment sets are confirmed one by one, and the confirmed historical feature intervals belonging to different equipment sets are transmitted to the node verification and analysis terminal;

[0016] The quantized image confirmation end confirms the quantized image based on the relationship graph of related nodes. The specific method is as follows:

[0017] Based on the relationship graph of related nodes, confirm the device to which the related node belongs, record it as the main device, then confirm the device to which the corresponding secondary node belongs, record it as the secondary device, confirm the relationship between the main device and each secondary device, record it as a set of devices;

[0018] Then, from the historical data on the cloud, confirm the processing records of the primary device relative to the data requests of the secondary device. From the processing records, confirm the computing resource utilization ratio associated with the single processing volume, and use: computing resource utilization ratio ÷ single processing volume = processing characteristics to confirm the processing characteristics in the single processing process. For the same group of secondary devices, average the confirmed groups of processing characteristics to confirm the average quantity characteristics;

[0019] Then use: 100% ÷ average feature = feature processing volume to confirm that the primary device can process the feature processing volume associated with the secondary device when fully utilizing computing resources. For different secondary devices, confirm their associated feature processing volume;

[0020] Based on the number of sub-nodes in the relationship graph, a corresponding number of associated line segments are generated, the starting point of each line segment is the same point, and the line segment is in a ring array shape, and the line segment length of each associated line segment is the same, so that each associated line segment is associated with a group of sub-nodes, and the characteristic processing amount associated with the corresponding sub-device is used as the overall measurement value of the associated line segment of the corresponding sub-node. After the associated line segments of each sub-node are processed, the overall graph displayed by several associated line segments is recorded as a quantized graph;

[0021] The node verification analysis end evaluates the compliance of the relevant nodes based on the relationship diagram corresponding to the relevant nodes. The specific method is as follows:

[0022] Based on the historical feature interval corresponding to the corresponding sub-node, the associated line segment corresponding to the corresponding sub-node is confirmed in the quantitative graph, and the scale corresponding to the endpoint value of the historical feature interval is confirmed in the associated line segment, and calibration is performed, the maximum value of the interval corresponds to the maximum scale, and the minimum value of the interval corresponds to the minimum scale;

[0023] Connecting multiple minimum scales marked on adjacent associated line segments, and then connecting multiple maximum scales, to identify a set of quantitative feature areas in the quantitative map;

[0024] Sum the computing power resource utilization ratios associated with several minimum scales to lock the minimum resource feature ZT min , and then sum up the computing power resource utilization ratios associated with several maximum scales to lock the maximum resource feature ZT max :

[0025] If ZT min >100%, the relationship diagram corresponding to the relevant node is marked as an abnormal diagram, the relevant node is marked as an abnormal node, and displayed through the display terminal;

[0026] If ZT max <100%, indicating that the relevant node is in compliance status and no processing is required;

[0027] If ZT min ≤100%≤ZT max , by executing the node parameter limit end, the number of subsequent single requests for each secondary node is limited;

[0028] The node parameter limiting end determines the limiting parameters associated with the corresponding secondary node based on the quantization feature area confirmed in the quantization graph. The specific method is as follows:

[0029] From the characteristic line segment associated with the quantitative characteristic area, gradually move from the maximum scale to the minimum scale;

[0030] The moving scales associated with multiple moving points are recorded as feature scales, the computing power resource utilization ratios associated with multiple feature scales are summed, and the feature utilization ratio LY is locked. When the moving point moves to a feature utilization ratio that satisfies LY < 100%, the feature scale associated with the current moving point is recorded as the limit scale, and the request amount associated with the limit scale is calibrated as the limit parameter associated with the corresponding secondary node;

[0031] The restriction parameters associated with different sub-nodes in the relationship diagram of the related nodes are displayed through the display terminal.

[0032] Preferably, each associated line segment in the quantization graph is synchronously associated with a computing power resource utilization ratio from a starting point to an end point, the computing power resource utilization ratio associated with the starting point is 0%, and the computing power resource utilization ratio associated with the end point is 100%.

[0033] Preferably, in each movement process, the movement scale on each characteristic line segment is the same.

[0034] The present invention provides a computer network engineering security control system. Compared with the prior art, it has the following beneficial effects:

[0035] The present invention constructs a quantitative graph to visualize and quantify the data request processing capabilities of the relevant nodes relative to the secondary nodes; the node verification analysis end combines the historical feature interval and the quantitative graph to accurately assess the compliance of the relevant nodes, providing an intuitive and accurate basis for judging whether the node is in a reasonable operating state;

[0036] By judging that the relevant nodes may be overloaded, the node parameter limiting end can quickly calculate the request limit parameters of the secondary node based on the quantitative feature area and display them through the display end; this allows external personnel to intervene in the single request volume of the secondary node based on the limit parameters, adjust the network operation parameters, ensure the stable operation of the relevant nodes, and improve the adaptive ability of network engineering to deal with complex data interaction scenarios. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] Figure 1 It is a schematic diagram of the principle framework of the present invention;

[0038] Figure 2 A quantized graph composed of a plurality of associated line segments of the present invention;

[0039] Figure 3 It is a schematic diagram for determining the quantitative feature area of ​​the present invention. DETAILED DESCRIPTION

[0040] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0041] See also Figure 1 , the present application provides a computer network engineering safety control system, including a topology map processing end, a node feature processing end, a quantitative graph confirmation end, a node verification analysis end, a display end and a node parameter restriction end, wherein the topology map processing end is electrically connected to the node feature processing end or the quantitative graph confirmation end input node, and the node feature processing end and the quantitative graph confirmation end are both electrically connected to the node verification analysis end input node, and the node verification analysis end is electrically connected to the display end or the node parameter restriction end input node, and the node parameter restriction end is electrically connected to the display end input node;

[0042] Among them, the topology map processing end confirms the topological relationship between nodes from the network topology map associated with the network project, and locks the relationship map of related nodes based on the topological relationship. Specifically, the so-called node relationship map is a partial topological map between nodes with data transmission and interaction relationships. From the corresponding network topology map, the topological connection relationship between different nodes can be clearly confirmed, and the data interaction between the corresponding node and other nodes can be confirmed based on the topological connection relationship, and the relationship is confirmed. According to the confirmed relationship map, it is convenient to perform subsequent feature analysis. The locking method of the corresponding relationship map of the relevant nodes is:

[0043] A group of nodes are randomly selected from the network topology as related nodes, and other nodes that are connected to the related nodes are identified, and the other associated nodes are recorded as secondary nodes of the related nodes;

[0044] If there is only one group of secondary nodes associated with the corresponding related node, no processing is required. When a single group of nodes is connected, there is generally no interactive load state. Normally, a single node is connected to multiple secondary nodes. During the peak period of data interaction, the related node will be overloaded. In severe cases, the related node will be paralyzed, causing a network engineering safety accident.

[0045] If there are multiple groups (that is, more than two groups) of sub-nodes associated with the corresponding related node, a relationship graph belonging to the related node is generated based on the connection relationship between the related node and the multiple groups of sub-nodes.

[0046] Among them, the node feature processing end, based on the relationship diagram of the relevant nodes, confirms the interaction records between the secondary nodes and the relevant nodes from the historical data, and then determines the single data request amount from the interaction record, and then performs feature analysis on the determined groups of data request amounts, and locks the historical feature intervals of the corresponding secondary nodes and the relevant nodes. Among them, in order to identify whether the relevant nodes will be loaded, it is necessary to confirm the historical interaction between different secondary nodes and the relevant nodes from the historical data, and then combine the relevant computing power resources and processing characteristics of the relevant nodes to conduct a comprehensive analysis to assess whether the node is overloaded in the subsequent application process. The secondary nodes and related nodes in the historical data here are not nodes in the network topology diagram, but the same nodes that already exist in other applications or topology diagrams, so they have the same operating characteristics;

[0047] Among them, the specific method of locking the corresponding secondary node and the historical feature interval corresponding to the relevant node is:

[0048] Based on the relationship diagram of related nodes, confirm the device to which the related node belongs, recorded as the main device, then confirm the device to which the corresponding secondary node belongs, recorded as the secondary device, confirm the relationship between the main device and each secondary device, recorded as a group of device sets, different secondary devices correspond to different device sets, it is proposed that a related node A has three secondary nodes B, C and D, then they are combined into three groups of device sets, namely AB device set, AC device set and AD device set;

[0049] From the historical data in the cloud, confirm the interaction records associated with the corresponding device set, and confirm the request volume that the corresponding secondary device needs to make data requests to the primary device each time from the interaction records, integrate the confirmed groups of request volumes, and confirm a group of request volume sets. Each group of device sets confirms a group of request volume sets, and the request volumes included in the request volume set are not less than thirty groups and not more than fifty groups;

[0050] Perform feature analysis on a single set of request quantities: re-sort the request quantities associated in the set in ascending order to confirm the sorted set, randomly select a value segment from the sorted set to confirm the variance (that is, perform overall confirmation of the variance of the multiple request quantities associated in the corresponding value segment), record the value segment that satisfies: variance ≤ Y1 as the standard value segment, where Y1 is a preset value, and its specific value is determined by the operator based on experience, and select the standard value segment with the largest number of values ​​from the confirmed standard value segments as the selected value segment. If there are multiple groups of standard value segments with the largest number, select the standard value segment with the smallest value range as the selected value segment (that is, the difference between the maximum and minimum values ​​of the corresponding standard value segment is the corresponding value range). If the value ranges are still the same, randomly select (this situation generally does not occur), and confirm the minimum request quantity and the maximum request quantity from the selected value segment as the historical feature interval of the device set corresponding to this request quantity set;

[0051] The historical feature intervals associated with different equipment sets are confirmed one by one, and the confirmed historical feature intervals belonging to different equipment sets are transmitted to the node verification and analysis terminal.

[0052] Specifically, taking A, B, C and D as examples, A is the relevant node in the relationship diagram. There is a historical record of B's ​​request to A in the AB device set, and there is corresponding request volume data in the corresponding historical record. Then, from a large amount of request volume data, a historical feature interval generated by B to A can be quickly identified. This interval can effectively show a processing feature associated with the corresponding node A in this subsequent network project. Based on the request feature confirmation of multiple secondary nodes, the load situation of the corresponding node A in the subsequent data processing process can be identified for effective assessment and analysis, so as to predict network security risks in advance and avoid the occurrence of network security incidents.

[0053] Among them, the quantitative image confirmation end, based on the relationship diagram of the relevant nodes, confirms the processing record of the relevant node relative to the secondary node for data request from the historical data, and then confirms the measurement line of the relevant node relative to the secondary node from the processing record, and then combines multiple groups of measurement lines to confirm the quantitative graph belonging to this relationship diagram. The specific method of confirmation is:

[0054] Based on the relationship graph of related nodes, confirm the device to which the related node belongs, record it as the main device, then confirm the device to which the corresponding secondary node belongs, record it as the secondary device, confirm the relationship between the main device and each secondary device, record it as a set of devices;

[0055] Then, from the historical data on the cloud, confirm the processing records of the primary device relative to the data requests of the secondary device. From the processing records, confirm the computing resource utilization ratio associated with the single processing volume, and use: computing resource utilization ratio ÷ single processing volume = processing characteristics to confirm the processing characteristics in the single processing process. For the same group of secondary devices, average the confirmed groups of processing characteristics to confirm the average quantity characteristics;

[0056] Then use: 100% ÷ average feature = feature processing volume to confirm that the master device can process the feature processing volume associated with the secondary device when fully utilizing computing resources (that is, the maximum processing volume that the master device can process when the resource percentage is utilized, and its maximum processing volume is for the specific request volume generated by the corresponding secondary device). Confirm the feature processing volume associated with different secondary devices;

[0057] Based on the number of secondary nodes in the relationship graph, a corresponding number of associated line segments are generated. The starting point of each line segment is the same point and is in a circular array. At the same time, the line segment length of each associated line segment is the same, so that each associated line segment is associated with a group of secondary nodes, and based on the characteristic processing amount associated with the corresponding secondary device, it is used as the overall measurement value of the associated line segment of the corresponding secondary node (that is, when the characteristic processing amount is 50, then the overall measurement value of the corresponding associated line segment is 50). After the associated line segments of each secondary node are processed, the overall graph displayed by several associated line segments is recorded as a quantitative graph, and each associated line segment is synchronously associated with the computing power resource utilization ratio from the starting point to the end point. The computing power resource utilization ratio associated with the starting point is 0%, and the computing power resource utilization ratio associated with the end point is 100%. The quantitative graph is as follows Figure 2 As shown, it is assumed that there are three sub-nodes for a related node, then each sub-node has a set of related line segments, and the overall measurement value of each set of related line segments is the maximum value that the corresponding related node can process when the computing power resources are fully utilized. Because the starting point of each related line segment is the same, and the corresponding measurement line is synchronously associated with the overall computing power resource utilization ratio of the corresponding related node, the related nodes are used to calibrate the actual points of multiple related line segments.

[0058] Among them, the node verification analysis end confirms the historical feature interval of the sub-node and the related node according to the relationship diagram corresponding to the related node, and then synchronously combines the corresponding quantitative diagram, locks the corresponding scale value in the quantitative diagram, and evaluates the compliance of this related node by analyzing the quantitative feature area after the combination of several scale values. The specific method of evaluation is as follows:

[0059] Based on the historical feature interval corresponding to the corresponding sub-node, the associated line segment corresponding to the corresponding sub-node is confirmed in the quantitative graph, and the scale corresponding to the endpoint value of the historical feature interval is confirmed in the associated line segment, and calibration is performed, the maximum value of the interval corresponds to the maximum scale, and the minimum value of the interval corresponds to the minimum scale;

[0060] Connect multiple minimum scales marked on adjacent associated line segments, and then connect multiple maximum scales, and identify a set of quantitative feature areas from the quantization map. The quantitative feature areas are as follows: Figure 3 As shown;

[0061] Sum the computing power resource utilization ratios associated with several minimum scales to lock the minimum resource feature ZT min , and then sum up the computing power resource utilization ratios associated with several maximum scales to lock the maximum resource feature ZT max :

[0062] If ZT min >100%, it means that the related node may be in an overloaded state in the later stage. In this case, the relationship diagram corresponding to the related node is marked as an abnormal diagram, and the related node is marked as an abnormal node, and displayed through the display terminal, which means that the design of this abnormal node is not reasonable and needs to be adjusted;

[0063] If ZT max <100%, which means that the relevant node will basically not be in a load state during the later application process, so no processing is required, which means that the relevant node is in a qualified state;

[0064] If ZT min ≤100%≤ZT max , it means that this related node may meet the standard or may not meet the standard. In order to avoid such a situation, it is necessary to limit the request amount of the secondary nodes associated with the relationship graph. By executing the node parameter limit end, the subsequent single request amount of each secondary node is limited to ensure that the related node will not be overloaded.

[0065] Its node parameter restriction end, based on the quantization feature area confirmed in the quantization graph, records the associated line segments included in the quantization feature area as feature line segments, and makes numerical adjustments in the feature line segments, confirms the restriction parameters associated with the corresponding sub-nodes, and displays the confirmed restriction parameters through the display end, wherein the specific method of confirming the restriction parameters is:

[0066] From the characteristic line segment associated with the quantitative characteristic area, gradually move from the maximum scale to the minimum scale. In each moving process, the moving scale on each characteristic line segment is the same;

[0067] The moving scales associated with multiple moving points are recorded as feature scales, and the computing power resource utilization ratios associated with multiple feature scales are summed to lock the feature utilization ratio LY. When the moving point moves to the feature utilization ratio that satisfies LY < 100%, the feature scale associated with the current moving point is recorded as the limit scale, and the request amount associated with the limit scale is calibrated as the limit parameter associated with the corresponding secondary node (combined with the measurement of the corresponding associated line segment and the scale, the corresponding limit parameter can be quickly confirmed). Since the utilization ratios associated with the corresponding scales on each measurement line are the same, the corresponding limit parameters can be quickly and effectively locked during the gradual scaling process to achieve a more comprehensive processing effect.

[0068] The restriction parameters associated with different sub-nodes in the relationship diagram of related nodes are displayed through the display terminal for external personnel to view. Based on the displayed restriction parameters, external personnel limit the subsequent single request volume of the specified sub-node, so as to ensure the normal use of the corresponding related nodes in the later period without excessive load.

[0069] Some of the data in the above formulas are dimensionless and numerically calculated. Meanwhile, the contents not described in detail in this specification belong to the prior art known to those skilled in the art.

[0070] The above embodiments are only used to illustrate the technical method of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical method of the present invention may be modified or replaced by equivalents without departing from the spirit and scope of the technical method of the present invention.

Claims

1. A computer network engineering security control system, characterized in that: include: The topology processing end confirms the topological relationship between nodes from the network topology associated with the network project, and locks the relationship diagram of related nodes based on the topological relationship; The node feature processing end, based on the relationship graph of related nodes, confirms the interaction records between the secondary node and related nodes from historical data, and then determines the single data request volume from the interaction record, and then performs feature analysis on the determined groups of data request volumes to lock the historical feature interval; The quantitative image confirmation end, based on the relationship diagram of the relevant nodes, confirms the processing record of the relevant nodes relative to the secondary nodes for data request from the historical data, then confirms the measurement line of the relevant nodes relative to the secondary nodes from the processing record, and then combines multiple groups of measurement lines to confirm the quantitative graph; The node verification and analysis end confirms the historical characteristic interval of the sub-node and the related nodes according to the relationship diagram corresponding to the related nodes, and then synchronously combines the corresponding quantitative diagram, locks the corresponding scale value in the quantitative diagram, and evaluates the compliance of the related nodes by analyzing the quantitative characteristic area after combining several scale values; The node parameter restriction end, based on the quantization feature area confirmed in the quantization graph, records the associated line segments included in the quantization feature area as feature segments, and makes numerical adjustments in the feature segments to confirm the restriction parameters associated with the corresponding secondary nodes.

2. A computer network engineering security control system according to claim 1, characterized in that: The topology graph processing end locks the relationship graph in the following specific manner: A group of nodes are randomly selected from the network topology as related nodes, and other nodes that are connected to the related nodes are identified, and the other associated nodes are recorded as secondary nodes of the related nodes; If there is only one set of secondary nodes associated with the corresponding related node, no processing is required; If there are multiple groups of sub-nodes associated with the corresponding related node, a relationship graph belonging to the related node is generated based on the connection relationship between the related node and the multiple groups of sub-nodes.

3. A computer network engineering security control system according to claim 1, characterized in that: The node feature processing end locks the historical feature interval in the following specific manner: Based on the relationship graph of related nodes, confirm the device to which the related node belongs, record it as the main device, then confirm the device to which the corresponding secondary node belongs, record it as the secondary device, confirm the relationship between the main device and each secondary device, record it as a set of devices; From the historical data in the cloud, confirm the interaction records associated with the corresponding device set, and confirm the request volume that the corresponding secondary device needs to make data requests to the primary device each time from the interaction records, integrate the confirmed groups of request volumes, and confirm a set of request volumes; Perform feature analysis on a single set of request quantities: re-sort the request quantities of several groups associated in the set according to the value from small to large to confirm the sorted set, randomly select a value segment from the sorted set to confirm the variance, and record the value segment that satisfies: variance ≤ Y1 as the standard value segment, where Y1 is the preset value. From the confirmed standard value segments, select the one with the largest number of values ​​as the selected value segment. If there are multiple groups of standard value segments with the largest number, select the standard value segment with the smallest value range as the selected value segment. Confirm the minimum request quantity and the maximum request quantity from the selected value segment as the historical feature interval of the device set corresponding to this request quantity set; The historical feature intervals associated with different equipment sets are confirmed one by one, and the confirmed historical feature intervals belonging to different equipment sets are transmitted to the node verification and analysis terminal.

4. A computer network engineering security control system according to claim 1, characterized in that: The specific method of confirming the quantized image at the quantized image confirmation end is as follows: Based on the relationship graph of related nodes, confirm the device to which the related node belongs, record it as the main device, then confirm the device to which the corresponding secondary node belongs, record it as the secondary device, confirm the relationship between the main device and each secondary device, record it as a set of devices; Then, from the historical data on the cloud, confirm the processing records of the primary device relative to the data requests of the secondary device. From the processing records, confirm the computing resource utilization ratio associated with the single processing volume, and use: computing resource utilization ratio ÷ single processing volume = processing characteristics to confirm the processing characteristics in the single processing process. For the same group of secondary devices, average the confirmed groups of processing characteristics to confirm the average quantity characteristics; Then use: 100% ÷ average feature = feature processing volume to confirm that the primary device can process the feature processing volume associated with the secondary device when fully utilizing computing resources. For different secondary devices, confirm their associated feature processing volume; Based on the number of secondary nodes in the relationship graph, a corresponding number of associated line segments are generated. The starting point of each line segment is the same point and is in a circular array. At the same time, the line segment length of each associated line segment is the same, so that each associated line segment is associated with a group of secondary nodes, and the characteristic processing amount associated with the corresponding secondary device is used as the overall measurement value of the associated line segment of the corresponding secondary node. After the associated line segments of each secondary node are processed, the overall graph displayed by several associated line segments is recorded as a quantitative graph.

5. A computer network engineering security control system according to claim 4, characterized in that: Each associated line segment in the quantization graph is synchronously associated with a computing power resource utilization ratio from a starting point to an end point, wherein the computing power resource utilization ratio associated with the starting point is 0%, and the computing power resource utilization ratio associated with the end point is 100%.

6. A computer network engineering security control system according to claim 1, characterized in that: The node verification and analysis end evaluates the compliance of the relevant node in the following specific manner: Based on the historical feature interval corresponding to the corresponding sub-node, the associated line segment corresponding to the corresponding sub-node is confirmed in the quantitative graph, and the scale corresponding to the endpoint value of the historical feature interval is confirmed in the associated line segment, and calibration is performed, the maximum value of the interval corresponds to the maximum scale, and the minimum value of the interval corresponds to the minimum scale; Connecting multiple minimum scales marked on adjacent associated line segments, and then connecting multiple maximum scales, to identify a set of quantitative feature areas in the quantitative map; Sum the computing power resource utilization ratios associated with several minimum scales to lock the minimum resource feature ZT min , and then sum up the computing power resource utilization ratios associated with several maximum scales to lock the maximum resource feature ZT max : If ZT min >100%, the relationship diagram corresponding to the relevant node is marked as an abnormal diagram, the relevant node is marked as an abnormal node, and displayed through the display terminal; If ZT max <100%, indicating that the relevant node is in compliance status and no processing is required; If ZT min ≤100%≤ZT max , by executing the node parameter limit end, the subsequent single request amount of each secondary node is limited.

7. A computer network engineering security control system according to claim 6, characterized in that: The node parameter limiting end confirms the limiting parameters associated with the secondary node in the following specific manner: From the characteristic line segment associated with the quantitative characteristic area, gradually move from the maximum scale to the minimum scale; The moving scales associated with multiple moving points are recorded as feature scales, the computing power resource utilization ratios associated with multiple feature scales are summed, and the feature utilization ratio LY is locked. When the moving point moves to a feature utilization ratio that satisfies LY < 100%, the feature scale associated with the current moving point is recorded as the limit scale, and the request amount associated with the limit scale is calibrated as the limit parameter associated with the corresponding secondary node; The restriction parameters associated with different sub-nodes in the relationship diagram of the related nodes are displayed through the display terminal.

8. A computer network engineering security control system according to claim 7, characterized in that: During the moving process, the moving scale on each characteristic line segment is the same.

Images