A Method and System for Monitoring the Status of a Remote Measurement and Control Terminal
By dividing topology diagrams and calculating local and global shortest paths in the remote measurement and control terminal network, the problems of traffic optimization and abnormal detection in large-scale and highly dynamic environments are solved, and efficient traffic allocation and security monitoring are achieved.
Patent Information
- Application Number
- CN202410943186.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-15
- Publication Date
- 2025-07-25
- Estimated Expiration
- 2044-07-15
AI Technical Summary
It is difficult for the prior art to achieve efficient optimization of traffic allocation and real-time detection of abnormal behaviors and potential threats in network traffic in large-scale, highly dynamic remote measurement and control terminal networks.
By dividing the network topology diagram into multiple network topology subgraphs, the local shortest transmission path of each network topology subgraph is determined, and the traffic data is controlled based on the global shortest transmission path, path calculation is performed by combining the Dixtra algorithm and the minimum heap data structure, link weights are dynamically adjusted, and traffic allocation is optimized using parallelization and distributed computing technology.
It realizes the rapid calculation of the optimal transmission path in large-scale and high-dynamic environments, reduces network congestion and delays, improves data transmission efficiency and stability, and detects abnormal traffic in real time to ensure smooth business operation.
Smart Images

Figure CN118714018B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of computer technology, and in particular to a method and system for monitoring the status of a remote measurement and control terminal. Background Art
[0002] With the rapid development of information technology, especially the wide application of technologies such as cloud computing and big data, enterprises' dependence on remote measurement and control terminals is increasing. As an important infrastructure to support the operation of enterprises' key businesses, the management of network traffic and security monitoring of remote measurement and control terminals are particularly important.
[0003] The network traffic management and security monitoring methods in the related art often have difficulty coping with large-scale and highly dynamic remote measurement and control terminal environments. Summary of the Invention
[0004] The present invention provides a method and system for monitoring the status of a remote measurement and control terminal, so as to solve the technical problems of how to achieve efficient and optimized allocation of traffic in a large-scale and highly dynamic remote measurement and control terminal network, and how to detect abnormal behaviors and potential threats in network traffic in real time.
[0005] In a first aspect, the present invention provides a method for monitoring the status of a remote measurement and control terminal, including:
[0006] Determine the traffic data to be transmitted in the remote measurement and control terminal, and obtain the network topology diagram of the remote measurement and control terminal;
[0007] Divide the network topology diagram into multiple network topology sub-diagrams, and determine the local shortest transmission paths of each network topology sub-diagram;
[0008] Merge the local shortest transmission paths of each network topology sub-diagram to obtain the global shortest transmission path;
[0009] Based on the global shortest transmission path, control the transmission of the traffic data to be transmitted in the remote measurement and control terminal.
[0010] In an embodiment, according to the method for monitoring the status of a remote measurement and control terminal provided by the present invention, the step of dividing the network topology diagram into multiple network topology sub-diagrams and determining the local shortest transmission paths of each network topology sub-diagram includes:
[0011] Determine the source nodes and target nodes in each network topology sub-diagram;
[0012] Create a minimum heap for each network topology sub-diagram with each node as the vertex and the minimum distance between each node and the source node as the edge;
[0013] Based on the minimum heap of each network topology sub-diagram, determine the local shortest transmission path of each network topology sub-diagram.
[0014] In one embodiment, for the remote measurement and control terminal status monitoring method provided by the present invention, determining the local shortest transmission paths of each network topology subgraph based on the minimum heap of each network topology subgraph includes:
[0015] Traverse the minimum heap of each network topology subgraph to determine each node in the local shortest transmission path of each network topology subgraph and the predecessor node of each node;
[0016] Backtrack the predecessor nodes of each node in each network topology subgraph to obtain the local shortest transmission path of each network topology subgraph.
[0017] In one embodiment, for the remote measurement and control terminal status monitoring method provided by the present invention, traversing the minimum heap of each network topology subgraph to determine each node in the local shortest transmission path of each network topology subgraph and the predecessor node of each node includes:
[0018] Traverse the minimum heap of each network topology subgraph based on Dijkstra's algorithm, and sequentially select the node with the smallest distance from the source node in the minimum heap as the current node in the local shortest transmission path, and update the distance between the neighbor nodes of the current node and the source node;
[0019] Record the predecessor node of the current node.
[0020] In one embodiment, for the remote measurement and control terminal status monitoring method provided by the present invention, before traversing the minimum heap of each network topology subgraph based on Dijkstra's algorithm and sequentially selecting the node with the smallest distance from the source node in the minimum heap as the current node in the local shortest transmission path, the method further includes:
[0021] Determine the weights of the edges between each node based on the link performance parameters between each node in the minimum heap of each network topology subgraph;
[0022] Wherein, the link performance parameter includes at least one of link transmission delay, bandwidth utilization rate, and data packet loss rate.
[0023] In one embodiment, for the remote measurement and control terminal status monitoring method provided by the present invention, determining the weights of the edges between each node based on the link performance parameters between each node in the minimum heap of each network topology subgraph includes:
[0024] Real-time monitor each node in the remote measurement and control terminal to obtain real-time link performance parameters between each node;
[0025] Based on the real-time link performance parameters between each node, the weights of the edges between each node are adjusted in real time.
[0026] In one embodiment, according to the remote measurement and control terminal status monitoring method provided by the present invention, the step of backtracking the predecessor nodes of each node in each network topology subgraph to obtain the local shortest transmission path of each network topology subgraph includes:
[0027] Number each node in the local shortest transmission path and establish an index;
[0028] Based on the adjacency list, store the connection relationships between each node in the local shortest transmission path.
[0029] In one embodiment, according to the remote measurement and control terminal status monitoring method provided by the present invention, the step of dividing the network topology graph into multiple network topology subgraphs and determining the local shortest transmission path of each network topology subgraph includes:
[0030] Determine the computing nodes corresponding to each network topology subgraph in the remote measurement and control terminal; each network topology subgraph corresponds to one computing node;
[0031] Based on the computing nodes corresponding to each network topology subgraph, determine the local shortest transmission path of each network topology subgraph.
[0032] In one embodiment, according to the remote measurement and control terminal status monitoring method provided by the present invention, the step of controlling the transmission of the to-be-transmitted traffic data in the remote measurement and control terminal based on the global shortest transmission path includes:
[0033] Based on the global shortest transmission path, adjust the routing table or traffic forwarding policy corresponding to the to-be-transmitted traffic data;
[0034] Based on the adjusted routing table or adjusted traffic forwarding policy, control the transmission of the to-be-transmitted traffic data in the remote measurement and control terminal.
[0035] In a second aspect, the present invention further provides a remote measurement and control terminal status monitoring system, including:
[0036] An acquisition module, configured to determine the to-be-transmitted traffic data in the remote measurement and control terminal and acquire the network topology graph of the remote measurement and control terminal;
[0037] A determination module, configured to divide the network topology graph into multiple network topology subgraphs and determine the local shortest transmission path of each network topology subgraph;
[0038] A merging module, configured to merge the local shortest transmission paths of each network topology subgraph to obtain a global shortest transmission path;
[0039] A control module, configured to control the transmission of the traffic data to be transmitted in the remote measurement and control terminal based on the global shortest transmission path.
[0040] In a third aspect, the present invention further provides an electronic device, including: a memory for storing a computer software program; a processor for reading and executing the computer software program, thereby implementing the remote measurement and control terminal status monitoring method as described in the first aspect above.
[0041] In a fourth aspect, the present invention further provides a non-transitory computer-readable storage medium, characterized in that a computer software program is stored in the storage medium, and when the computer software program is executed by a processor, the remote measurement and control terminal status monitoring method as described in the first aspect above is implemented.
[0042] In a fifth aspect, the present invention further provides a computer program product, including a computer program, and when the computer program is executed by a processor, the remote measurement and control terminal status monitoring method as described in the first aspect above is implemented.
[0043] The remote measurement and control terminal status monitoring method provided by the present invention determines the traffic data to be transmitted in the remote measurement and control terminal and obtains the network topology map of the remote measurement and control terminal; divides the network topology map into multiple network topology sub-graphs, determines the local shortest transmission paths of each network topology sub-graph; merges the local shortest transmission paths of each network topology sub-graph to obtain the global shortest transmission path; and controls the transmission of the traffic data to be transmitted in the remote measurement and control terminal based on the global shortest transmission path. Therefore, by dividing the network topology map of the remote measurement and control terminal and determining the global shortest transmission path according to the local shortest transmission paths of each network topology sub-graph, it is possible to quickly calculate the optimal transmission path in a large-scale and highly dynamic remote measurement and control terminal network, realize the efficient and optimized allocation of traffic, help reduce network congestion and delay, improve the efficiency and stability of data transmission, and thus ensure the smooth operation of services in the remote measurement and control terminal. Description of the Drawings
[0044] Figure 1 is a schematic flowchart of the remote measurement and control terminal status monitoring method provided by the present invention;
[0045] Figure 2 is a schematic structural diagram of the remote measurement and control terminal status monitoring system provided by the present invention;
[0046] Figure 3 is a schematic diagram of an embodiment of the electronic device provided by an embodiment of the present invention;
[0047] Figure 4 is a schematic diagram of an embodiment of the computer-readable storage medium provided by an embodiment of the present invention. Detailed implementation manners
[0048] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part rather than all of the embodiments of the present invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts fall within the protection scope of the present invention.
[0049] In the description of the present invention, the terms "first" and "second" are only used for descriptive purposes and cannot be construed as indicating or implying relative importance or implicitly specifying the quantity of the indicated technical features. Thus, the features defined with "first" and "second" may explicitly or implicitly include one or more of the described features. In the description of the present invention, "a plurality of" means two or more unless otherwise specifically defined.
[0050] In the description of the present invention, the term "for example" is used to mean "serving as an example, illustration, or explanation". Any embodiment described as "for example" in the present invention is not necessarily construed as being more preferred or having more advantages than other embodiments. The following description is given to enable any person skilled in the art to implement and use the present invention. Details are set forth for purposes of explanation in the following description. It should be understood that those skilled in the art can realize that the present invention can be implemented without these specific details. In other instances, well-known structures and processes are not elaborated in detail to avoid unnecessary details from obscuring the description of the present invention. Therefore, the present invention is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.
[0051] A remote measurement and control terminal refers to an assembly composed of multiple servers, which are connected together through a network and provide computing resources, storage space, application programs, or services as a whole. Remote measurement and control terminals are widely used in scenarios such as large websites, cloud computing platforms, big data processing, and distributed storage systems that require high performance and high availability.
[0052] With the increasing number and complexity of network security threats, the remote measurement and control terminal network faces more and more security challenges. Traditional security monitoring systems can often only detect and defend against known threats, but it is difficult to deal with new and unknown threats. Therefore, a more intelligent and comprehensive security monitoring system is needed, which can detect abnormal behaviors and potential threats in network traffic in real time and take corresponding countermeasures in a timely manner.
[0053] Optionally, refer to Figure 1 , Figure 1It is a schematic flowchart of the method for monitoring the status of a remote measurement and control terminal provided by the present invention. The method for monitoring the status of a remote measurement and control terminal includes the following steps:
[0054] Step 10: Determine the traffic data to be transmitted in the remote measurement and control terminal, and obtain the network topology diagram of the remote measurement and control terminal.
[0055] Specifically, the execution subject of the method for monitoring the status of a remote measurement and control terminal provided in the embodiments of the present invention is a remote measurement and control terminal status monitoring system. This system can be implemented by software, such as a remote measurement and control terminal status monitoring program or a remote measurement and control terminal status monitoring optimization program; it can also be a system for executing the method for monitoring the status of a remote measurement and control terminal, such as a mobile terminal, a tablet computer, a desktop computer, or a server, etc.
[0056] The traffic data to be transmitted refers to the data transmitted between various nodes in the remote measurement and control terminal, including the traffic data entering the remote measurement and control terminal, the traffic data leaving the remote measurement and control terminal, and the data exchanged between the internal servers of the remote measurement and control terminal, etc.
[0057] The remote measurement and control terminal may include multiple servers and other devices (such as switches or routers, etc.), and each server or device can be used as a node in the remote measurement and control terminal. The network topology diagram is a chart or diagram that describes the network connection relationships between the servers in the remote measurement and control terminal. Such a chart is usually used to show the layout, connection method, and network path of each node inside the remote measurement and control terminal.
[0058] Step 20: Divide the network topology diagram into multiple network topology sub-diagrams, and determine the local shortest transmission paths of each network topology sub-diagram.
[0059] Specifically, as a classic graph theory algorithm, the shortest path algorithm has a wide range of applications in the fields of network routing, traffic distribution, etc. This algorithm can quickly find the shortest path between any two nodes in a given network topology structure, so as to realize the optimal utilization of network resources and the improvement of efficiency. In the network traffic management of a remote measurement and control terminal, introducing the shortest path algorithm can more accurately plan the traffic transmission path, avoid network congestion and delay, and improve the efficiency of data transmission.
[0060] In a remote measurement and control terminal, due to the large network scale, it may be necessary to process a large amount of data such as nodes and edges. To further improve the efficiency of the algorithm, parallelization and distributed computing technologies can be adopted. That is, divide the network topology diagram into multiple network topology sub-diagrams, allocate independent computing nodes to each network topology sub-diagram respectively, and let each computing node run the shortest path algorithm to determine the local shortest transmission paths of each network topology sub-diagram.
[0061] The local shortest transmission path refers to the path with the minimum cost required for transmitting traffic data between two nodes in a network topology subgraph. Here, the cost usually refers to the weight or cost on the path, such as the bandwidth, delay, hop count, etc. of the network link. In different situations, the shortest path may not only be the shortest in terms of physical distance, but is calculated according to the specific cost definition.
[0062] Step 30: Merge the local shortest transmission paths of each network topology subgraph to obtain the global shortest transmission path.
[0063] Specifically, after calculating the local shortest transmission paths of each network topology subgraph respectively, these local shortest transmission paths can be merged to obtain the global shortest transmission path.
[0064] The global shortest transmission path refers to the path with the minimum cost required for transmitting traffic data between two nodes in a network topology graph.
[0065] Step 40: Based on the global shortest transmission path, control the transmission of the traffic data to be transmitted in the remote measurement and control terminal.
[0066] Specifically, according to the global shortest transmission path, the nodes that the traffic data to be transmitted needs to pass through in the remote measurement and control terminal and the connection relationship between the nodes can be determined. Therefore, the transmission of the traffic data to be transmitted in the remote measurement and control terminal can be controlled.
[0067] In the embodiments of the present invention, by dividing the network topology graph of the remote measurement and control terminal and determining the global shortest transmission path according to the local shortest transmission paths of each network topology subgraph, the optimal transmission path can be quickly calculated in a large-scale and highly dynamic remote measurement and control terminal network, realizing the efficient and optimized allocation of traffic, helping to reduce network congestion and delay, improving the efficiency and stability of data transmission, and thus ensuring the smooth operation of services in the remote measurement and control terminal.
[0068] In some embodiments, dividing the network topology graph into multiple network topology subgraphs and determining the local shortest transmission paths of each network topology subgraph includes:
[0069] Determine the source nodes and target nodes in each network topology subgraph;
[0070] Create a minimum heap for each network topology subgraph with each node as the vertex and the minimum distance between each node and the source node as the edge;
[0071] Based on the minimum heap of each network topology subgraph, determine the local shortest transmission path of each network topology subgraph.
[0072] Specifically, a min - heap is a sorted complete binary tree in which the data value of any non - terminal node is not greater than the values of its left and right child nodes. The min - heap can ensure fast access to the minimum - priority elements in the binary tree. The method of the min - heap can be used to determine the local shortest transmission paths of each network topology sub - graph in the network topology sub - graph.
[0073] First, the source nodes and target nodes in each network topology sub - graph can be determined. The source node is the starting node for which traffic optimization is required, and the target node is the terminating node for which traffic optimization is required.
[0074] Secondly, taking each node as a vertex and the minimum distance between each node and the source node as an edge, a min - heap of each network topology sub - graph is created. For example, a distance array can be created for each node in the network topology sub - graph to store the shortest distance from the source node to that node. This distance array is used to describe the edges between nodes. When initializing the distance array, the distance corresponding to the source node is set to 0, and the distances corresponding to other nodes are set to infinity.
[0075] Thirdly, the min - heap of each network topology sub - graph is traversed, and the local shortest transmission paths of each network topology sub - graph are determined according to the nodes obtained from the traversal.
[0076] In the related art, the selection of the next shortest - path node is achieved through linear search, with a time complexity of O(N), where N is the number of nodes. However, by using a heap data structure (such as a min - heap), the time complexity of finding the minimum distance can be reduced to O(log N), significantly improving the efficiency of the algorithm.
[0077] The embodiments of the present invention achieve fast determination of the local shortest transmission paths of each network topology sub - graph through a min - heap, which can accelerate the calculation of the shortest path, thereby more quickly realizing the optimized allocation of traffic.
[0078] In some embodiments, based on the min - heap of each network topology sub - graph, determining the local shortest transmission path of each network topology sub - graph includes:
[0079] Traversing the min - heap of each network topology sub - graph to determine each node and the predecessor node of each node in the local shortest transmission path of each network topology sub - graph;
[0080] Backtracking the predecessor nodes of each node in each network topology sub - graph to obtain the local shortest transmission path of each network topology sub - graph.
[0081] Specifically, when creating the min - heap, the distance and node information of all nodes are stored in the min - heap as key - value pairs, where the key is the distance value and the value is the node information.
[0082] An empty set can be created to record the nodes that have been visited during the traversal of the minimum heap of each network topology subgraph.
[0083] Traverse the minimum heap of each network topology subgraph. Each time, take out the node with the minimum distance from the minimum heap and update the distances of its neighbor nodes. The predecessor node is the previously visited node before the visited node.
[0084] During the calculation process, the predecessor node of each node can be recorded so that the local shortest transmission path can be quickly traced back when generating the local shortest transmission path.
[0085] The embodiment of the present invention determines the local shortest transmission path of each network topology subgraph according to the minimum heap of each network topology subgraph, traces back the predecessor nodes of each node in each network topology subgraph, and obtains the local shortest transmission path of each network topology subgraph, improving the generation efficiency and speed of the local shortest transmission path.
[0086] In some embodiments, traversing the minimum heap of each network topology subgraph to determine each node and the predecessor node of each node in the local shortest transmission path of each network topology subgraph includes:
[0087] Based on Dijkstra's algorithm, traverse the minimum heap of each network topology subgraph. Sequentially select the node with the minimum distance from the source node in the minimum heap as the current node in the local shortest transmission path, and update the distance between the neighbor nodes of the current node and the source node;
[0088] Record the predecessor node of the current node.
[0089] Specifically, Dijkstra's algorithm is the shortest path algorithm from one vertex to the rest of the vertices, which solves the shortest path problem in a weighted graph. Its main feature is to start from the starting point and adopt the strategy of the greedy algorithm. Each time, traverse the adjacent nodes of the vertex that is closest to the starting point and has not been visited until the end point is reached.
[0090] Use Dijkstra's algorithm to traverse the minimum heap of each network topology subgraph. Each time, take out the node with the minimum distance from the minimum heap and update the distance from its neighbor nodes to the source node. After each update of the neighbor node distance, the structure of the heap needs to be readjusted to ensure that the property of the heap (the value of the parent node is not greater than the value of its child nodes) is maintained.
[0091] During the execution of the algorithm, record the predecessor node of each node. When a shorter path is found, directly update the predecessor node information to avoid repeated calculations.
[0092] Repeat the above steps until all nodes have been visited or no shorter path can be found.
[0093] When the shortest path of a certain node has been determined, it is possible to trace back to all the predecessor nodes of that node and attempt to update the shortest path of its predecessor nodes through that node.
[0094] To further improve efficiency, path compression technology can be adopted, that is, during the backtracking process, the nodes passed through are directly connected to the starting node, reducing the time complexity of path backtracking. This optimization can accelerate the construction process of the shortest path and improve the real-time performance of the algorithm in the network traffic optimization of remote measurement and control terminals.
[0095] The embodiment of the present invention traverses the minimum heap of each network topology subgraph according to Dijkstra's algorithm, sequentially selects the node with the smallest distance from the source node in the minimum heap as the current node in the local shortest transmission path, and updates the distance between the neighbor nodes of the current node and the source node, records the predecessor node of each node, realizes path compression and backtracking optimization, and improves the generation efficiency and speed of the local shortest transmission path.
[0096] In some embodiments, before traversing the minimum heap of each network topology subgraph according to Dijkstra's algorithm and sequentially selecting the node with the smallest distance from the source node in the minimum heap as the current node in the local shortest transmission path, the method further includes:
[0097] Determine the weights of the edges between each node based on the link performance parameters between each node in the minimum heap of each network topology subgraph;
[0098] Wherein, the link performance parameters include at least one of link transmission delay, bandwidth utilization rate, and data packet loss rate.
[0099] Specifically, during the process of updating the neighbor node distance, an optimization strategy can be introduced according to the network traffic optimization goal. For example, considering the link performance parameters, dynamically adjust the weight of the link to achieve a more reasonable traffic distribution. A link generally refers to the physical or logical channel connecting two nodes. They are the basic paths for data transmission and can be connections achieved through cables, optical fibers, wireless signals, etc. Link performance parameters include factors such as bandwidth utilization rate, link transmission delay, and data packet loss rate.
[0100] Link performance parameters can reflect the actual performance differences of links. The better the link performance parameters, the better the link performance, and the more the link between nodes should be selected for traffic transmission, and the smaller the weight of the edge between each node (the smaller the weight, the greater the possibility of being selected).
[0101] Therefore, the weights of the edges between each node can be determined based on the link performance parameters between each node in the minimum heap of each network topology subgraph.
[0102] In the embodiments of the present invention, according to the link performance parameters between each node in the minimum heap of each network topology sub-graph, the weights of the edges between each node are determined, realizing the dynamic adjustment of the weights of the edges between each node according to the actual performance of the link, realizing the optimization of the traffic transmission path, and being able to adapt to the changes in the network state and service requirements.
[0103] In some embodiments, backtracking the predecessor nodes of each node in each network topology sub-graph to obtain the local shortest transmission path of each network topology sub-graph, including:
[0104] Numbering each node in the local shortest transmission path and establishing an index;
[0105] Storing the connection relationship between each node in the local shortest transmission path based on the adjacency list.
[0106] Specifically, in order to facilitate the quick search and access to the information of the nodes, each node in the local shortest transmission path can be numbered and an index can be established. Using the adjacency list instead of the adjacency matrix to store the information of the graph (the connection relationship between each node in the local shortest transmission path) reduces the space complexity and improves the algorithm efficiency.
[0107] The embodiments of the present invention are applicable to large-scale remote measurement and control terminals. The representation of the graph and the search efficiency of adjacent nodes are crucial for the algorithm performance. By establishing an index and using data structures such as the adjacency list, the speed of searching for adjacent nodes can be accelerated. The index can help quickly locate the target node, while the adjacency list can efficiently store and access the neighbor information of the nodes. This optimization can reduce the time overhead in the search process of the algorithm and improve the efficiency of optimizing the network traffic of the remote measurement and control terminal.
[0108] In some embodiments, dividing the network topology graph into multiple network topology sub-graphs and determining the local shortest transmission path of each network topology sub-graph, including:
[0109] Determining the computing nodes corresponding to each network topology sub-graph in the remote measurement and control terminal; the network topology sub-graphs and the computing nodes are in one-to-one correspondence;
[0110] Based on the computing nodes corresponding to each network topology sub-graph, determining the local shortest transmission path of each network topology sub-graph.
[0111] Specifically, after dividing the network topology graph into multiple network topology sub-graphs, an independent processor or computing node can be allocated to each network topology sub-graph in the remote measurement and control terminal to perform the calculation of the local shortest transmission path. The computing nodes are distributed nodes in the remote measurement and control terminal. Through the parallel calculation of multiple computing nodes, the algorithm efficiency is improved.
[0112] In the embodiments of the present invention, due to the large network scale, a large number of nodes and edges may need to be processed. To further improve the efficiency of the algorithm, parallelization and distributed computing technologies can be adopted. By allocating computing tasks to multiple processors or computer nodes, the shortest path calculations for multiple nodes can be processed simultaneously, thus significantly shortening the overall computing time. This optimization can make full use of the parallel processing capabilities of the remote measurement and control terminal network and improve the efficiency of the shortest path algorithm in the remote measurement and control terminal network traffic optimization.
[0113] In some embodiments, based on the global shortest transmission path, the transmission of the traffic data to be transmitted in the remote measurement and control terminal is controlled, including:
[0114] Based on the global shortest transmission path, the routing table or traffic forwarding policy corresponding to the traffic data to be transmitted is adjusted;
[0115] Based on the adjusted routing table or the adjusted traffic forwarding policy, the transmission of the traffic data to be transmitted in the remote measurement and control terminal is controlled.
[0116] Specifically, the routing table is used to store and manage routing information and guide the forwarding process of traffic data from the source node to the destination node. The traffic forwarding policy refers to the rules and policies for determining the forwarding of traffic data in the remote measurement and control terminal. It determines how to process the received traffic data in network devices such as routers, switches, or firewalls and determines which path the traffic data should be forwarded through to the destination.
[0117] According to the global shortest transmission path, the routing table or traffic forwarding policy corresponding to the traffic data to be transmitted can be adjusted. According to the adjusted routing table or the adjusted traffic forwarding policy, the transmission of the traffic data to be transmitted in the remote measurement and control terminal is controlled, which can ensure that the traffic data to be transmitted can be transmitted along the optimal path. At the same time, the situation of multiple alternative paths can be considered to achieve load balancing and avoid congestion on a single path.
[0118] In the embodiments of the present invention, according to the global shortest transmission path, the transmission of the traffic data to be transmitted in the remote measurement and control terminal is controlled to achieve efficient and optimized allocation of traffic, which helps to reduce network congestion and latency and improve the efficiency and stability of data transmission.
[0119] In some embodiments, the method further includes:
[0120] Obtain the real-time traffic data in the remote measurement and control terminal;
[0121] Extract the features of the real-time traffic data to obtain the traffic transmission features of the real-time traffic data;
[0122] Input the traffic transmission characteristics into the traffic analysis model to obtain the traffic category of the real-time traffic data output by the traffic analysis model;
[0123] Among them, the traffic analysis model is obtained after training based on sample traffic data and the traffic category labels corresponding to the sample traffic data; the traffic category labels include normal traffic and abnormal traffic.
[0124] Specifically, the real-time traffic data in the network can also be captured in real time through port mirroring or traffic collectors of network devices (such as routers, switches, etc.) in the remote measurement and control terminal. Feature extraction is performed on the real-time traffic data to obtain the traffic transmission characteristics of the real-time traffic data. The traffic transmission characteristics can include packet size, transmission speed, access frequency, flow direction, bandwidth, delay, packet loss rate, and protocol type, etc.
[0125] A traffic analysis model can be established through machine learning algorithms. The initial model of the traffic analysis model can be a neural network model, including convolutional neural network models, feedforward neural network models, and attention models, etc. The traffic analysis model can be obtained after training the initial model with traffic category labels. The sample traffic data includes both sample data corresponding to normal traffic and sample data corresponding to abnormal traffic.
[0126] In the embodiments of the present invention, by training the traffic analysis model to identify the real-time traffic data, the accuracy of identifying abnormal traffic is improved, and the security monitoring of the remote measurement and control terminal is realized.
[0127] In some embodiments, after inputting the traffic transmission characteristics into the traffic analysis model to obtain the traffic category of the real-time traffic data output by the traffic analysis model, the method further includes:
[0128] In the case where the traffic category of the real-time traffic data is abnormal traffic, determine the threat category of the real-time traffic data;
[0129] Based on the threat category of the real-time traffic data, determine the severity level and impact range of the real-time traffic data;
[0130] Based on the severity level and impact range of the real-time traffic data, determine the disposal method corresponding to the real-time traffic data.
[0131] Specifically, the identified abnormal traffic can be further analyzed, and specific threat types can be identified by using techniques such as rule bases, pattern matching, or deep learning. The threat types can include DoS (Denial of Service) attacks, DDoS (Distributed Denial of Service) attacks, malicious scans, etc.
[0132] Determine the severity level and impact scope of the real-time traffic data based on the threat category of the real-time traffic data. The severity level is used to evaluate the severity of the threat of the real-time traffic data and can be defined as needed, such as including mild, moderate, and severe, etc. The impact scope can be the server nodes or service time periods affected by the real-time traffic data in the remote telemetry and control terminal.
[0133] Once a security threat is detected, the alarm mechanism should be immediately triggered to send an alarm notification to the administrator or the security team, including information such as the threat type, occurrence time, and impact scope.
[0134] Determine the corresponding handling method for the real-time traffic data according to the severity level and impact scope of the real-time traffic data. Different severity levels and impact scopes correspond to different handling methods, such as blocking abnormal traffic, isolating infected nodes, starting an emergency response plan, etc.
[0135] The embodiment of the present invention timely responds to and handles the threats discovered by the security monitoring and threat detection module, ensuring the smooth operation of the services in the remote telemetry and control terminal.
[0136] Please refer to Figure 2 , Figure 2 which is the structural schematic diagram of the remote telemetry and control terminal status monitoring system provided by the embodiment of the present invention. The remote telemetry and control terminal status monitoring system includes:
[0137] An acquisition module 201, configured to determine the traffic data to be transmitted in the remote telemetry and control terminal and acquire the network topology diagram of the remote telemetry and control terminal;
[0138] A determination module 202, configured to divide the network topology diagram into multiple network topology sub-diagrams and determine the local shortest transmission paths of each network topology sub-diagram;
[0139] A merging module 203, configured to merge the local shortest transmission paths of each network topology sub-diagram to obtain the global shortest transmission path;
[0140] A control module 204, configured to control the transmission of the traffic data to be transmitted in the remote telemetry and control terminal based on the global shortest transmission path.
[0141] The remote telemetry and control terminal status monitoring system provided by the present invention divides the network topology diagram of the remote telemetry and control terminal, determines the global shortest transmission path according to the local shortest transmission paths of each network topology sub-diagram, can quickly calculate the optimal transmission path in a large-scale and highly dynamic remote telemetry and control terminal network, realize the efficient and optimized allocation of traffic, help reduce network congestion and delay, improve the efficiency and stability of data transmission, and thus ensure the smooth operation of the services in the remote telemetry and control terminal.
[0142] In one embodiment, the determining module 202 is further configured to:
[0143] Determine the source nodes and destination nodes in each network topology sub-graph;
[0144] Create a minimum heap for each network topology sub-graph with each node as a vertex and the minimum distance between each node and the source node as an edge;
[0145] Based on the minimum heaps of each network topology sub-graph, determine the local shortest transmission paths of each network topology sub-graph.
[0146] In one embodiment, the determining module 202 is further configured to:
[0147] Traverse the minimum heaps of each network topology sub-graph to determine each node in the local shortest transmission path of each network topology sub-graph and the predecessor node of each node;
[0148] Backtrack the predecessor nodes of each node in each network topology sub-graph to obtain the local shortest transmission paths of each network topology sub-graph.
[0149] In one embodiment, the determining module 202 is further configured to:
[0150] Traverse the minimum heaps of each network topology sub-graph based on Dijkstra's algorithm, and successively select the node with the minimum distance from the source node in the minimum heap as the current node in the local shortest transmission path, and update the distance between the neighbor nodes of the current node and the source node;
[0151] Record the predecessor node of the current node.
[0152] In one embodiment, the determining module 202 is further configured to:
[0153] Based on the link performance parameters between each node in the minimum heaps of each network topology sub-graph, determine the weights of the edges between each node;
[0154] Wherein, the link performance parameters include at least one of link transmission delay, bandwidth utilization rate, and data packet loss rate.
[0155] In one embodiment, the determining module 202 is further configured to:
[0156] Monitor each node in the remote measurement and control terminal in real time to obtain the real-time link performance parameters between each node;
[0157] Based on the real-time link performance parameters between each node, adjust the weights of the edges between each node in real time.
[0158] In one embodiment, the determining module 202 is further configured to:
[0159] Number each node in the local shortest transmission path and establish an index;
[0160] Store the connection relationship between each node in the local shortest transmission path based on the adjacency list.
[0161] In one embodiment, the determination module 202 is further configured to:
[0162] Determine the computing nodes corresponding to each network topology subgraph in the remote measurement and control terminal; each network topology subgraph corresponds to one computing node;
[0163] Based on the computing nodes corresponding to each network topology subgraph, determine the local shortest transmission path of each network topology subgraph.
[0164] In one embodiment, the control module 204 is further configured to:
[0165] Adjust the routing table or traffic forwarding policy corresponding to the traffic data to be transmitted based on the global shortest transmission path;
[0166] Control the transmission of the traffic data to be transmitted in the remote measurement and control terminal based on the adjusted routing table or the adjusted traffic forwarding policy.
[0167] Please refer to Figure 3 , Figure 3 which is a schematic diagram of an embodiment of the electronic device provided by the embodiment of the present invention. As Figure 3 shown, the embodiment of the present invention provides an electronic device 300, including a memory 310, a processor 320, and a computer program 311 stored on the memory 310 and executable on the processor 320. When the processor 320 executes the computer program 311, the following steps are implemented:
[0168] Determine the traffic data to be transmitted in the remote measurement and control terminal, and obtain the network topology diagram of the remote measurement and control terminal;
[0169] Divide the network topology diagram into multiple network topology subgraphs, and determine the local shortest transmission path of each network topology subgraph;
[0170] Merge the local shortest transmission paths of each network topology subgraph to obtain the global shortest transmission path;
[0171] Control the transmission of the traffic data to be transmitted in the remote measurement and control terminal based on the global shortest transmission path.
[0172] Please refer to Figure 4 , Figure 4Schematic diagram of an embodiment of a computer-readable storage medium provided by an embodiment of the present invention. As Figure 4 shown, this embodiment provides a computer-readable storage medium 400, on which a computer program 411 is stored. When the computer program 411 is executed by a processor, the following steps are implemented:
[0173] Determine the traffic data to be transmitted in the remote measurement and control terminal, and obtain the network topology diagram of the remote measurement and control terminal;
[0174] Divide the network topology diagram into multiple network topology sub-diagrams, and determine the local shortest transmission paths of each network topology sub-diagram;
[0175] Merge the local shortest transmission paths of each network topology sub-diagram to obtain the global shortest transmission path;
[0176] Based on the global shortest transmission path, control the transmission of the traffic data to be transmitted in the remote measurement and control terminal.
[0177] It should be noted that in the above embodiments, the descriptions of each embodiment have their own emphases. For the parts not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.
[0178] Those skilled in the art should understand that the embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present invention can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk memories, CD-ROMs, optical memories, etc.) containing computer-usable program codes.
[0179] The present invention is described with reference to the flowcharts and / or block diagrams of methods, apparatuses (systems), and computer program products according to embodiments of the present invention. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, and the combination of flows and / or blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to the processors of general-purpose computers, special-purpose computers, embedded computers, or other programmable data processing devices to generate a machine, such that the instructions executed by the processors of the computer or other programmable data processing devices generate means for implementing the functions specified in Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.
[0180] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including an instruction means that implements the function specified in one or more of the processes and / or blocks Figure 1 one or more processes and / or blocks Figure 1 specified in the block or blocks.
[0181] These computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, whereby the instructions executed on the computer or other programmable apparatus provide steps for implementing the function specified in one or more of the processes and / or blocks Figure 1 one or more processes and / or blocks Figure 1 specified in the block or blocks.
[0182] Although the preferred embodiments of the present invention have been described, additional changes and modifications can be made by those skilled in the art once they learn of the basic inventive concept. Therefore, the appended claims are intended to be construed to include the preferred embodiments as well as all changes and modifications that fall within the scope of the present invention.
[0183] It is obvious that those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalent technologies, the present invention is also intended to include these modifications and variations.
Claims
1. A method for monitoring the status of a remote measurement and control terminal, characterized in that Including: Determine the traffic data to be transmitted in the remote measurement and control terminal, and obtain the network topology diagram of the remote measurement and control terminal; Divide the network topology diagram into multiple network topology sub-diagrams, and determine the local shortest transmission paths of each network topology sub-diagram; Merge the local shortest transmission paths of each network topology sub-diagram to obtain the global shortest transmission path; Based on the global shortest transmission path, control the transmission of the traffic data to be transmitted in the remote measurement and control terminal; Wherein, the method for monitoring the state of the remote measurement and control terminal further includes: Obtain the real-time traffic data in the remote measurement and control terminal; Extract features from the real-time traffic data to obtain the traffic transmission features of the real-time traffic data; Input the traffic transmission features into the traffic analysis model to obtain the traffic category of the real-time traffic data output by the traffic analysis model; Wherein, the traffic analysis model is obtained after being trained based on sample traffic data and the traffic category labels corresponding to the sample traffic data; the traffic category labels include normal traffic and abnormal traffic; After inputting the traffic transmission features into the traffic analysis model to obtain the traffic category of the real-time traffic data output by the traffic analysis model, the method further includes: In the case where the traffic category of the real-time traffic data is abnormal traffic, determine the threat category of the real-time traffic data; the threat types include DoS attack, DDoS attack, and malicious scanning; Based on the threat category of the real-time traffic data, determine the severity level and the impact range of the real-time traffic data; the severity level is used to evaluate the severity of the threat of the real-time traffic data; the impact range is the server node or service time period affected by the real-time traffic data in the remote measurement and control terminal; Based on the severity level and the impact range of the real-time traffic data, determine the corresponding disposal method for the real-time traffic data; the disposal methods include blocking abnormal traffic, isolating infected nodes, and starting an emergency response plan.
2. The remote measurement and control terminal status monitoring method according to claim 1, wherein, The dividing the network topology diagram into multiple network topology sub-diagrams and determining the local shortest transmission paths of each network topology sub-diagram includes: Determine the source node and the target node in each network topology sub-diagram; Create a minimum heap for each network topology sub-diagram with each node as the vertex and the minimum distance between each node and the source node as the edge; Based on the minimum heap of each network topology sub-diagram, determine the local shortest transmission path of each network topology sub-diagram.
3. The remote measurement and control terminal status monitoring method according to claim 2, wherein The determining the local shortest transmission path of each network topology sub-diagram based on the minimum heap of each network topology sub-diagram includes: Traverse the minimum heap of each network topology sub-diagram to determine each node and the predecessor node of each node in the local shortest transmission path of each network topology sub-diagram; Backtrack the predecessor nodes of each node in each network topology sub-diagram to obtain the local shortest transmission path of each network topology sub-diagram.
4. The remote measurement and control terminal status monitoring method according to claim 3, wherein The traversing the minimum heap of each network topology sub-diagram to determine each node and the predecessor node of each node in the local shortest transmission path of each network topology sub-diagram includes: Traverse the minimum heap of each network topology subgraph based on Dijkstra's algorithm, and sequentially select the node with the minimum distance from the source node in the minimum heap as the current node in the local shortest transmission path, and update the distance between the neighbor nodes of the current node and the source node; Record the predecessor node of the current node.
5. The remote measurement and control terminal status monitoring method according to claim 4, wherein Before the step of traversing the minimum heap of each network topology subgraph based on Dijkstra's algorithm and sequentially selecting the node with the minimum distance from the source node in the minimum heap as the current node in the local shortest transmission path, the method further includes: Determine the weights of the edges between each pair of nodes based on the link performance parameters between each pair of nodes in the minimum heap of each network topology subgraph; Wherein, the link performance parameter includes at least one of link transmission delay, bandwidth utilization rate, and data packet loss rate.
6. The remote measurement and control terminal status monitoring method according to claim 5, wherein, The step of determining the weights of the edges between each pair of nodes based on the link performance parameters between each pair of nodes in the minimum heap of each network topology subgraph includes: Monitor each node in the remote measurement and control terminal in real time to obtain the real-time link performance parameters between each pair of nodes; Based on the real-time link performance parameters between each pair of nodes, adjust the weights of the edges between each pair of nodes in real time.
7. The remote measurement and control terminal status monitoring method according to claim 3, wherein The step of backtracking the predecessor nodes of each node in each network topology subgraph to obtain the local shortest transmission path of each network topology subgraph includes: Number each node in the local shortest transmission path and establish an index; Store the connection relationship between each pair of nodes in the local shortest transmission path based on the adjacency list.
8. The method for monitoring the status of a remote measurement and control terminal according to claim 1, characterized in that, The step of dividing the network topology graph into multiple network topology subgraphs and determining the local shortest transmission path of each network topology subgraph includes: Determine the computing node corresponding to each network topology subgraph in the remote measurement and control terminal; each network topology subgraph corresponds to one computing node; Based on the computing nodes corresponding to each network topology subgraph, determine the local shortest transmission path of each network topology subgraph.
9. The remote measurement and control terminal status monitoring method according to claim 1, wherein The step of controlling the transmission of the to-be-transmitted traffic data in the remote measurement and control terminal based on the global shortest transmission path includes: Based on the global shortest transmission path, adjust the routing table or traffic forwarding policy corresponding to the to-be-transmitted traffic data; Based on the adjusted routing table or the adjusted traffic forwarding policy, control the transmission of the to-be-transmitted traffic data in the remote measurement and control terminal.
10. A remote measurement and control terminal status monitoring system, characterized in that, Includes: An acquisition module, configured to determine the to-be-transmitted traffic data in the remote measurement and control terminal and acquire the network topology graph of the remote measurement and control terminal; A determination module, configured to divide the network topology graph into multiple network topology subgraphs and determine the local shortest transmission path of each network topology subgraph; A merging module, configured to merge the local shortest transmission paths of each network topology subgraph to obtain a global shortest transmission path; A control module, configured to control the transmission of the to-be-transmitted traffic data in the remote measurement and control terminal based on the global shortest transmission path; Wherein, the method for monitoring the state of the remote measurement and control terminal further includes: Acquire the real-time traffic data in the remote measurement and control terminal; Extract features from the real-time traffic data to obtain the traffic transmission features of the real-time traffic data; Input the traffic transmission features into the traffic analysis model to obtain the traffic category of the real-time traffic data output by the traffic analysis model; Among them, the traffic analysis model is obtained after being trained based on the sample traffic data and the traffic category labels corresponding to the sample traffic data; the traffic category labels include normal traffic and abnormal traffic; After inputting the traffic transmission features into the traffic analysis model to obtain the traffic category of the real-time traffic data output by the traffic analysis model, the method further includes: In the case where the traffic category of the real-time traffic data is abnormal traffic, determine the threat category of the real-time traffic data; the threat types include DoS attacks, DDoS attacks, and malicious scans; Based on the threat category of the real-time traffic data, determine the severity level and the scope of influence of the real-time traffic data; the severity level is used to evaluate the severity of the threat of the real-time traffic data; the scope of influence is the server node or service time period affected by the real-time traffic data in the remote measurement and control terminal; Based on the severity level and the scope of influence of the real-time traffic data, determine the corresponding disposal method for the real-time traffic data; the disposal methods include blocking abnormal traffic, isolating infected nodes, and activating the emergency response plan.
Citation Information
Patent Citations
Full-source shortest path dividing and conquering solving method for large-scale graph under limited resources
CN114861970A
Line weight determination method for Dijkstra algorithm
CN117091599A