Method and device for determining equipment in network, processor and storage medium
By establishing a network graph structure model and particle swarm optimization algorithm, we calculate the impact of node failure on the network and identify key devices, solving the problem that the key devices in the network cannot be determined in the prior art, and improving the accuracy of defense measures and network security .
Patent Information
- Application Number
- CN202411246981.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-05
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2044-09-05
AI Technical Summary
The prior art is difficult to accurately identify key devices in the network, especially when multiple devices fail at the same time, and the impact on the entire network is difficult to estimate. The point selection strategy is simple, so it is impossible to effectively identify the set of key devices.
By obtaining network node information, establishing a graph structure model, calculating the impact of node failure on the network, and using particle swarm optimization algorithm and evaluation function to determine the node's fitness, thereby identifying key equipment that has a great impact on the network functional security status.
Effectively identify potentially destructive nodes in the network, identify key equipment that has a significant impact on the network, improve the accuracy of targeted defense measures, and reduce the damage caused by attacks.
Smart Images

Figure CN119030880A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of node detection, and in particular to a method, device, processor and storage medium for determining a device in a network. Background Art
[0002] At present, the Internet is composed of thousands of autonomous systems, which are the basic building blocks of the network. The routers within the autonomous system use a unified routing protocol, and different autonomous systems exchange routing information through the inter-domain routing protocol. The inter-domain routing system is the backbone routing system of the Internet and undertakes the core function of data exchange. If the system is attacked, it will have a cascading effect and have a significant impact on the entire Internet. In order to defend against such attacks, it is necessary to find a group of key devices in the inter-domain routing system and take targeted defense measures to reduce the damage caused by the attack.
[0003] Under normal circumstances, it is difficult for existing technologies to accurately estimate the impact of multiple devices failing at the same time on the entire network. In addition, the site selection strategy of existing technologies is relatively simple, and it is difficult to effectively identify the key device set. Therefore, there is a technical problem of being unable to determine the key devices in the network.
[0004] Currently, no effective solution has been proposed for the above-mentioned technical problem of being unable to identify key devices in the network. Summary of the invention
[0005] The embodiments of the present invention provide a method, apparatus, processor and storage medium for determining a device in a network, so as to at least solve the technical problem that a key device in a network cannot be determined.
[0006] According to one aspect of an embodiment of the present invention, a method for determining a device in a network is provided. The method may include: obtaining node information of a target network, wherein the node information is used to at least represent the location information of different devices in the target network; based on the node information, establishing a graph structure model of the target network, wherein the graph structure model includes multiple nodes and at least one edge, the node is used to represent the device, and the edge is used to represent the relationship between different devices; based on the graph structure model, determining the fitness of each node in the graph structure model, wherein the fitness is used to indicate the importance of the node in the graph structure model; based on the fitness, determining at least one target device in the target network, wherein the target device affects the security status of the target network function.
[0007] Optionally, based on the graph structure model, determining the fitness of each node in the graph structure model includes: determining at least one failed node in the graph structure model, wherein the failed node is used to indicate that the node is in a failed state; based on the failed node, determining the fitness of each node in the graph structure model.
[0008] Optionally, based on the failed nodes, the fitness of each node in the graph structure model is determined, including: determining the influence of the failed nodes on the graph structure model, wherein the influence is used to indicate the degree of influence of the failed nodes on the graph structure model; based on the influence, determining the node group, wherein the node group is used to indicate a collection of nodes; based on the node group, determining the fitness of each node in the graph structure model.
[0009] Optionally, based on the node group, determining the fitness of each node in the graph structure model includes: calling an evaluation function to determine the fitness of each node in the node group, wherein the evaluation function is used to evaluate the fitness of the node.
[0010] Optionally, the method for determining a device in a network further includes: simultaneously determining a plurality of nodes as failed nodes; and determining the fitness of the plurality of failed nodes using an evaluation function.
[0011] Optionally, based on fitness, at least one target device in the target network is determined, including: in response to the fitness being less than a fitness threshold, updating the node group; determining each node in the updated node group as a target node in the graph structure model; and determining the device corresponding to the target node as a target device in the target network.
[0012] According to another aspect of an embodiment of the present invention, a device for determining a device in a network is also provided. The device may include: an acquisition unit for acquiring node information of a target network, wherein the node information is used to at least represent the location information of different devices in the target network; an establishment unit for establishing a graph structure model of the target network based on the node information, wherein the graph structure model includes multiple nodes and at least one edge, the node is used to represent the device, and the edge is used to represent the relationship between different devices; a first determination unit for determining the fitness of each node in the graph structure model based on the graph structure model, wherein the fitness is used to indicate the importance of the node in the graph structure model; a second determination unit for determining at least one target device in the target network based on the fitness, wherein the target device affects the security status of the target network function.
[0013] According to another aspect of an embodiment of the present invention, a computer-readable storage medium is also provided, the computer-readable storage medium including a stored program, wherein when the program is executed by a processor, the device where the storage medium is located is controlled to execute the method for determining a device in a network in an embodiment of the present invention.
[0014] According to another aspect of an embodiment of the present invention, a processor is further provided. The processor is used to run a program, wherein when the program is run, the method for determining a device in a network in an embodiment of the present invention is executed.
[0015] According to another aspect of the embodiments of the present invention, a computer program product is provided, which includes computer instructions, and when the computer instructions are executed by a processor, the method for determining a device in a network in the embodiments of the present invention is implemented.
[0016] In an embodiment of the present invention, node information of a target network is obtained, wherein the node information is used to at least represent the location information of different devices in the target network; based on the node information, a graph structure model of the target network is established, wherein the graph structure model includes multiple nodes and at least one edge, the node is used to represent the device, and the edge is used to represent the relationship between different devices; based on the graph structure model, the fitness of each node in the graph structure model is determined, wherein the fitness is used to indicate the importance of the node in the graph structure model; based on the fitness, at least one target device in the target network is determined, wherein the target device affects the security status of the target network function. That is to say, the present invention determines the target device in the target network according to the graph structure model by establishing a graph structure model of the target network. Since the present invention utilizes the topological information of the network and calculates the impact of node failure on the entire network, it identifies the potentially destructive nodes in the network, and then determines the key devices that have a significant impact on the network, thereby solving the technical problem of being unable to determine the key devices in the network and achieving the technical effect of determining the key devices in the network. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] The drawings described herein are used to provide a further understanding of the present invention and constitute a part of this application. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the drawings:
[0018] Figure 1 is a flow chart of a method for determining a device in a network according to an embodiment of the present invention;
[0019] Figure 2 is a flow chart of a method for detecting key nodes in an inter-domain routing system based on particle swarm optimization according to an embodiment of the present invention;
[0020] Figure 3 It is a schematic diagram of a device for determining a device in a network according to an embodiment of the present invention. DETAILED DESCRIPTION
[0021] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings 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 should fall within the scope of protection of the present invention.
[0022] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, functional component or device that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, functional components or devices.
[0023] According to an embodiment of the present invention, an embodiment of a method for determining a device in a network is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.
[0024] Figure 1 is a flow chart of a method for determining a device in a network according to an embodiment of the present invention. Figure 1 As shown, the method may include the following steps:
[0025] Step S101, obtaining node information of the target network.
[0026] In the technical solution provided in the above step S101 of the present invention, the node information is used to at least represent the location information of different devices in the target network, where the target network can also be called a network or an inter-domain routing system.
[0027] In this embodiment, the node information of the target network is obtained, for example, by using a management tool, which is only an illustrative example and does not limit the specific method of obtaining the node information of the target network.
[0028] For example, the routers in the network and their routing relationships are obtained through management tools.
[0029] Step S102: establishing a graph structure model of the target network based on the node information.
[0030] In the technical solution provided in the above step S102 of the present invention, the graph structure model includes multiple nodes and at least one edge, the nodes are used to represent devices, and the edges are used to represent the relationship between different devices.
[0031] In this embodiment, after the node information of the target network is acquired in step S101, a graph structure model of the target network is established according to the node information.
[0032] For example, routers in a network and their routing relationships can be modeled as a graph structure, where a node represents a router and an edge represents a routing relationship between two routers.
[0033] Step S103, based on the graph structure model, determining the fitness of each node in the graph structure model.
[0034] In the technical solution provided in the above step S103 of the present invention, the fitness is used to indicate the importance of the node in the graph structure model.
[0035] In this embodiment, after the graph structure model of the target network is established in step S102, the fitness of each node in the graph structure model is determined according to the graph structure model.
[0036] Optionally, at least one failed node in the graph structure model is determined, wherein the failed node is used to indicate that the node is in a failed state, that is, the device in the network corresponding to the failed node is in a failed state. That is, the impact of a single node failure on the entire network is calculated.
[0037] Optionally, after determining the failed node, determine the influence of the failed node on the graph structure model; and determine a node group according to the influence, wherein the node group is used to indicate a collection of nodes. The node group may also be a particle group.
[0038] Optionally, after determining the node group, the fitness of each node in the graph structure model is determined based on the node group. Based on the failed node, the fitness of each node in the graph structure model is determined. The fitness may also be referred to as importance.
[0039] For example, an evaluation function is obtained, wherein the evaluation function is used to evaluate the fitness of the node; the fitness of each node in the node group is determined by using the evaluation function. The evaluation function may also be called a fitness function F.
[0040] For another example, the fitness function F is designed through load redistribution and update message propagation. The specific composition of the fitness function is as follows: Load redistribution, when a router in the network fails, the load originally borne by the router will be transferred to its adjacent routers. If the router originally bears a large load and the adjacent router can bear a smaller load, the adjacent router will fail after sharing the traffic of the failed router. In order to evaluate the impact of node failure on the entire network in this case, the evaluation function F 1 (S) is used to evaluate the impact of a group of nodes S failing simultaneously on the network, where the evaluation function F 1(S) can be expressed by the following formula (1):
[0041]
[0042] Among them, |SP i | represents the number of optimal routing paths passing through node i, and |SP| represents the number of optimal routing paths in the entire network. UPDATE message propagation: After a route fails, an UPDATE message will be sent to a neighboring router. This type of message will increase the load of the neighboring router and may even cause the failure of the neighboring router in extreme cases. In order to evaluate the impact of a group of nodes S failing at the same time on the network in this case, the present invention designs an evaluation function F 2 (S), where the evaluation function F 2 (S) can be expressed by the following formula (3):
[0043]
[0044] in, is the set of neighbor nodes of S, p is the probability of a neighbor node being affected, and τ(i) is the number of neighbor nodes of S. Combined with F 1 and F 2 The effective fitness function F is designed to evaluate the importance of the node set S. Its calculation method is shown in the following formula (3), which will not be repeated here.
[0045] F(S)=F 1 (S)+F 2 (S) (3)
[0046] Among them, the fitness function F is used to evaluate all particles. The larger the value of the fitness function F, the higher the quality of the solution.
[0047] Step S104: determining at least one target device in the target network based on the fitness.
[0048] In the technical solution provided in step S104 of the present invention, the target device affects the security status of the target network function. The target device can be called a key device, and when the key device is destroyed or attacked, the target network function will be severely damaged or paralyzed.
[0049] In this embodiment, after the fitness of each node in the graph structure model is determined in step S103, at least one target device in the target network is determined.
[0050] Optionally, when the fitness is less than the fitness threshold, it indicates that the fitness of the node is low, that is, the node has a small impact on the network, based on which the node group can be updated.
[0051] For example, the impact of a single node failure on the entire network is calculated as shown in the following formula (4):
[0052]
[0053] Among them, |SP i | represents the number of optimal routing paths passing through node i, |SP| represents the number of optimal routing paths in the entire network, and |AS i | represents the number of autonomous systems to which the neighboring nodes of node i belong, and |AS| represents the total number of autonomous systems in the network. Then, the k nodes obtained by the roulette wheel selection method are used to initialize the position vector of the i-th particle, and the calculation of the impact of a single node failure on the entire network is repeated until the position vector of each particle is initialized.
[0054] Optionally, each node in the updated node group is determined as a target node in the graph structure model; and a device corresponding to the target node is determined as a target device in the target network.
[0055] For example, according to the calculated fitness function value of each particle, the historical optimal position Pbest of each particle is updated, and the historical optimal fitness function value of the i-th particle is also saved. The historical optimal position of the i-th particle is expressed as shown in the following formula (5):
[0056]
[0057] According to the obtained optimal fitness function value of each particle, the historical optimal position Gbest of the particle swarm is updated, and the historical optimal fitness function value of the particle swarm is also saved. The historical optimal position of the particle swarm is expressed as shown in the following formula (6):
[0058] Gbest=(gbest 1 ,gbest 2 ,…,gbest k ) (6)
[0059] It should be noted that the above embodiments may be executed by a determination device of a device in a network.
[0060] In the above steps S101 to S104 of the present invention, the node information of the target network is obtained, wherein the node information is used to at least represent the location information of different devices in the target network; based on the node information, a graph structure model of the target network is established, wherein the graph structure model includes multiple nodes and at least one edge, the node is used to represent the device, and the edge is used to represent the relationship between different devices; based on the graph structure model, the fitness of each node in the graph structure model is determined, wherein the fitness is used to indicate the importance of the node in the graph structure model; based on the fitness, at least one target device in the target network is determined, wherein the target device affects the security status of the target network function. That is to say, the present invention determines the target device in the target network according to the graph structure model by establishing a graph structure model of the target network. Since the present invention utilizes the topological information of the network and calculates the impact of node failure on the entire network, the potentially destructive nodes in the network are identified, and then the key devices that have a significant impact on the network are determined, which solves the technical problem of being unable to determine the key devices in the network and achieves the technical effect of determining the key devices in the network.
[0061] The above method of this embodiment is further introduced below.
[0062] As an optional implementation method, based on the graph structure model, the fitness of each node in the graph structure model is determined, including: determining at least one failed node in the graph structure model, wherein the failed node is used to indicate that the node is in a failed state; based on the failed node, determining the fitness of each node in the graph structure model.
[0063] In this embodiment, at least one failed node in the graph structure model is determined, and the fitness of each node in the graph structure model is determined based on the failed node.
[0064] Optionally, indicators designed for single node failure can improve the accuracy of acquiring target devices, thereby solving the technical problem of being unable to identify key devices in the network, and further achieving the technical effect of identifying key devices in the network.
[0065] As an optional implementation method, based on the failed nodes, the fitness of each node in the graph structure model is determined, including: determining the influence of the failed nodes, wherein the influence is used to indicate the degree of influence of the failed nodes on the graph structure model; based on the influence, determining the node group, wherein the node group is used to indicate a collection of nodes; based on the node group, determining the fitness of each node in the graph structure model.
[0066] In this embodiment, the influence degree of the failed node on the graph structure model is determined; based on the influence degree, the node group is determined; based on the node group, the fitness of each node in the graph structure model is determined.
[0067] Optionally, the impact of a single node failure on the entire network is calculated, and the calculation method is as shown in the above formula (4), which will not be repeated here.
[0068] As an optional implementation method, based on the node group, determining the fitness of each node in the graph structure model includes: calling an evaluation function to determine the fitness of each node in the node group, wherein the evaluation function is used to evaluate the fitness of the node.
[0069] In this embodiment, an evaluation function is obtained, and the fitness of each node in the node group is determined using the evaluation function.
[0070] For example, the particle swarm algorithm is used to determine the target device. In the particle swarm algorithm, the fitness function F is used to evaluate all particles to obtain the fitness function value of each particle. The larger the fitness function value of the particle, the higher the quality of the solution it represents. The fitness function can be composed of load redistribution and UPDATE message propagation. The effective fitness function F is designed to evaluate the importance of the node set S. Its calculation method is shown in the above formula (3), which will not be repeated here.
[0071] As an optional implementation manner, the method for determining a device in a network further includes: simultaneously determining a plurality of nodes as failed nodes; and determining the fitness of the plurality of failed nodes using an evaluation function.
[0072] In this embodiment, multiple nodes are simultaneously determined as failed nodes; and the fitness of the multiple failed nodes is determined using an evaluation function.
[0073] Optionally, the indicators designed for multiple node failures can improve the accuracy of obtaining the target device, thereby solving the technical problem of being unable to determine the key devices in the network, and further achieving the technical effect of determining the key devices in the network. That is, in the particle swarm algorithm, the indicators designed for multiple node failures are integrated in the population search stage, which guides the direction of the population evolution and effectively improves the efficiency of searching for high-quality solutions.
[0074] As an optional implementation method, based on fitness, at least one target device in the target network is determined, including: in response to the fitness being less than a fitness threshold, updating the node group; determining each node in the updated node group as a target node in the graph structure model; and determining the device corresponding to the target node as the target device in the target network.
[0075] In this embodiment, when the fitness is less than the fitness threshold, the node group is updated; each node in the updated node group is determined as a target node in the graph structure model; and the device corresponding to the target node is determined as a target device in the target network.
[0076] For example, the speed and position of each particle are updated according to the calculated historical optimal position Pbest of each particle and the historical optimal position Gbest of the particle group. For the particle speed update, the speed vector of each particle in the group is updated, and the speed vector update rule of the i-th particle is shown in the following formula (7):
[0077] V i ←H(ωV i +c 1 r 1 (Pbest i ∩X i )+c 2 r 2 (Gbest∩X i ))(7) Among them, r 1 、r 2 represents a random number in the interval (0,1), assuming that H(Z)=(h(z 1 ),h(z 2 ),…,h(z k )), h(z i ) is expressed as the following formula (8):
[0078]
[0079] Assume that Z = (3, 1, 5, 0, -1), according to the above rules, we can get H (Z) = (1, 0, 1, 0, 0), which means that the first and third elements of the particle position vector need to be replaced. The update rule for particle position update is to update the position vector of each particle according to the updated velocity vector obtained by the particle velocity update. The position vector update rule of the i-th particle is shown in the following formula (9):
[0080] X i ←X i ⊕V i (9)
[0081] Among them, X i ⊕V i =(x i ′ 1 ,x i ′ 2 ,…,x i ′ k ), x i ′ j The update rule of is shown in the following formula (10):
[0082]
[0083] Among them, Rand(N) means randomly selecting a node from all nodes. Assume X 1 =(6,14,9,10,45), V 1 =(0,1,0,0,1), according to the above rules, we can get X ′ 1 =(6,3,9,10,56), which means that the second and fifth elements of the particle position vector need to be replaced, and the rest remain unchanged.
[0084] It should be noted that the above embodiments may be executed by a determination device of a device in a network.
[0085] In this embodiment, the node information of the target network is obtained, wherein the node information is used to at least represent the location information of different devices in the target network; based on the node information, a graph structure model of the target network is established, wherein the graph structure model includes multiple nodes and at least one edge, the node is used to represent the device, and the edge is used to represent the relationship between different devices; based on the graph structure model, the fitness of each node in the graph structure model is determined, wherein the fitness is used to indicate the importance of the node in the graph structure model; based on the fitness, at least one target device in the target network is determined, wherein the target device affects the security status of the target network function. That is to say, the present invention determines the target device in the target network according to the graph structure model by establishing a graph structure model of the target network. Since the present invention utilizes the topological information of the network and calculates the impact of node failure on the entire network, it can identify the potentially destructive nodes in the network, and then determine the key devices that have a significant impact on the network, thereby solving the technical problem of being unable to determine the key devices in the network and achieving the technical effect of determining the key devices in the network.
[0086] The technical solution of the embodiment of the present invention is illustrated below in conjunction with preferred implementation modes.
[0087] At present, the Internet is composed of thousands of autonomous systems, which are the basic building blocks of the network. The routers within the autonomous system use a unified routing protocol, and different autonomous systems exchange routing information through the inter-domain routing protocol. The inter-domain routing system is the backbone routing system of the Internet and undertakes the core function of data exchange. If the system is attacked, it will have a cascading effect and have a significant impact on the entire Internet. In order to defend against such attacks, it is necessary to find a group of key devices in the inter-domain routing system and take targeted defense measures to reduce the damage caused by the attack.
[0088] Under normal circumstances, it is difficult for existing technologies to accurately estimate the impact of multiple devices failing at the same time on the entire network. In addition, the site selection strategy of existing technologies is relatively simple, and it is difficult to effectively identify the key device set. Therefore, there is a technical problem that the key devices in the network cannot be determined. In view of the above-mentioned technical problem that the key devices in the network cannot be determined, no effective solution has been proposed.
[0089] However, the embodiment of the present invention proposes a method for detecting key nodes in an inter-domain routing system based on particle swarm optimization, which establishes a graph structure model of the network, designs an evaluation function based on the particle swarm algorithm, evaluates the impact of a single failed node and multiple failed nodes on the network, and determines the final particle swarm and key devices. This solves the technical problem of being unable to determine key devices in the network, and achieves the technical effect of determining key devices in the network.
[0090] The embodiments of the present invention are further described below.
[0091] Figure 2 The present invention is a flowchart of a method for detecting key nodes of an inter-domain routing system based on particle swarm optimization according to an embodiment of the present invention. Particle swarm optimization (PSO for short) is a population-based random optimization technology that can simultaneously search for more regions in the solution space of the objective function to be optimized. The key node detection method includes the following steps:
[0092] Step S201, initializing the particle swarm.
[0093] In this embodiment, the particle swarm size m, the number of key nodes k, the inertia weight ω, and the learning factor c are initialized. 1 、c 2 , number of iterations T.
[0094] Optionally, the impact of a single node failure on the entire network is calculated, and the calculation method is as shown in the above formula (4), which will not be repeated here.
[0095] Optionally, initialize the velocity vector V of the particle swarm; initialize the velocity vector of the i-th particle to a zero vector, i.e., V i =(0,0,…,0). Repeat the process of initializing the velocity vector of the particle group until the velocity vector of each particle is initialized.
[0096] Step S202, calculating the fitness value of each particle.
[0097] In this embodiment, all particles are evaluated using the fitness function F to obtain the fitness function value of each particle. The larger the fitness function value of a particle is, the higher the quality of the solution it represents is.
[0098] Optionally, the fitness function is specifically constructed as follows: load redistribution, when a router in the network fails, the load originally borne by the router will be transferred to its adjacent routers. If the load originally borne by the router is large, and the adjacent router can bear a smaller load, the adjacent router will fail after sharing the traffic of the failed router. In order to evaluate the impact of node failure on the entire network in this case, the evaluation function F 1 (S) is used to evaluate the impact of a group of nodes S failing simultaneously on the network, where the evaluation function F 1 (S) can be expressed by the aforementioned formula (1), which will not be elaborated here.
[0099] Optionally, UPDATE message propagation: After a route fails, an UPDATE message will be sent to a neighboring router. This type of message will increase the load of the neighboring router and may even cause the failure of the neighboring router in extreme cases. In order to evaluate the impact of a group of nodes S failing at the same time on the network in this case, the present invention designs an evaluation function F 2 (S), where the evaluation function F 2 (S) can be expressed by the aforementioned formula (2), which will not be elaborated here.
[0100] Optionally, combined with F 1 and F 2 The effective fitness function F is designed to evaluate the importance of the node set S. Its calculation method is shown in the above formula (3) and will not be repeated here.
[0101] Step S203, updating the historical optimal position of each particle.
[0102] In this embodiment, the historical optimal position Pbest of each particle is updated according to the fitness function value of each particle calculated in step S202, and the historical optimal fitness function value of the i-th particle is also saved. The historical optimal position of the i-th particle is expressed as shown in the above formula (5), which will not be repeated here.
[0103] Step S204, updating the historical optimal position of the group.
[0104] In this embodiment, according to the optimal fitness function value of each particle obtained in step S203, the historical optimal position Gbest of the particle group is updated, and the historical optimal fitness function value of the particle group is also saved. The historical optimal position of the particle group is expressed as shown in the above formula (6), which will not be repeated here.
[0105] Step S205, updating the speed and position of each particle.
[0106] In this embodiment, the speed and position of each particle are updated according to the historical optimal position Pbest of each particle and the historical optimal position Gbest of the particle group calculated in steps S203 and S204.
[0107] Optionally, for updating the particle velocity, the velocity vector of each particle in the group is updated, and the velocity vector update rule of the i-th particle is as shown in the above formula (7), which will not be repeated here. i ) is shown in the above formula (8), which will not be repeated here. According to the above rules, it can be concluded that H(Z) = (1, 0, 1, 0, 0), which means that the first and third elements of the particle position vector need to be replaced.
[0108] Optionally, the update rule for the particle position update is to update the position vector of each particle according to the updated velocity vector obtained by updating the particle velocity. The update rule for the position vector of the i-th particle is as shown in the above formula (9), which will not be described here. i ′ j The update rule of is shown in the above formula (10), which will not be repeated here. Assume that X 1 =(6,14,9,10,45), V 1 =(0,1,0,0,1), according to the above rules, we can get X ′ 1 =(6,3,9,10,56), which means that the second and fifth elements of the particle position vector need to be replaced, and the rest remain unchanged.
[0109] Step S206: whether the end condition is met.
[0110] In this embodiment, it is determined whether the end condition is met, wherein the end condition may be that the maximum number of iterations is reached. If the end condition is met, the detection process is terminated; if the end condition is not met, step S202 is executed.
[0111] Optionally, this method uses the network topology information of the inter-domain routing system to design a function for evaluating the impact of a single node failure on the entire network, thereby identifying potentially destructive nodes in the network. In view of the fact that the simultaneous failure of multiple nodes will cause load redistribution and UPDATE message propagation, this method uses the network topology information to design an effective fitness function for evaluating the quality of particles, which plays an important role in the search stage of feasible solutions.
[0112] Optionally, this method transforms the key node detection problem of the inter-domain routing system into a single-objective optimization problem, and effectively solves the problem from an optimization perspective. In the population initialization phase, the indicators designed for single node failure are integrated to obtain a set of high-quality solutions. In the population search phase, the indicators designed for multiple node failures are integrated to guide the evolution of the population and effectively improve the efficiency of searching for high-quality solutions.
[0113] Optionally, by reading and parsing the relevant data of two autonomous systems (AS), two AS network topologies (AS-1 and AS-2) that conform to reality are constructed. Table 1 is the AS network topology data table. As shown in Table 1, AS-1 contains 2317 nodes and 3589 edges, and AS-2 contains 4078 nodes and 8901 edges. Experiments have shown that RS-PSO can identify more critical routing nodes in the inter-domain routing system compared to the random selection method Rand.
[0114] Table 1 AS network topology data table
[0115]
[0116] In this embodiment, by establishing a graph structure model of the network, an evaluation function is designed according to the particle swarm algorithm to evaluate the impact of a single failed node and multiple failed nodes on the network, and the final particle swarm and key devices are determined. The technical problem of being unable to determine the key devices in the network is solved, and the technical effect of determining the key devices in the network is achieved.
[0117] According to an embodiment of the present invention, a device for determining a device in a network is also provided. It should be noted that the device for determining a device in a network can be used to execute the method for determining a device in a network in Embodiment 1.
[0118] Figure 3 is a schematic diagram of a device for determining a device in a network according to an embodiment of the present invention. Figure 3 As shown, the device 300 for determining a device in the network may include: an acquiring unit 301 , an establishing unit 302 , a first determining unit 303 , and a second determining unit 304 .
[0119] The acquisition unit 301 is used to acquire node information of a target network, wherein the node information is used to at least represent location information of different devices in the target network.
[0120] The establishing unit 302 is used to establish a graph structure model of the target network based on the node information, wherein the graph structure model includes multiple nodes and at least one edge, the node is used to represent the device, and the edge is used to represent the relationship between different devices.
[0121] The first determining unit 303 is used to determine the fitness of each node in the graph structure model based on the graph structure model, wherein the fitness is used to indicate the importance of the node in the graph structure model.
[0122] The second determining unit 304 is configured to determine at least one target device in the target network based on the fitness, wherein the target device affects the security status of the target network function.
[0123] Optionally, the first determination unit 303 may include: a first determination module, used to determine at least one failed node in the graph structure model, wherein the failed node is used to indicate that the node is in a failed state; and a second determination module, used to determine the fitness of each node in the graph structure model based on the failed node.
[0124] Optionally, the second determination module may include: a first determination submodule, used to determine the influence of the failed node, wherein the influence is used to indicate the degree of influence of the failed node on the graph structure model; a second determination submodule, used to determine the node group based on the influence, wherein the node group is used to indicate a collection of nodes; and a third determination submodule, used to determine the fitness of each node in the graph structure model based on the node group.
[0125] Optionally, the third determination submodule may also be used to call an evaluation function to determine the fitness of each node in the node group, wherein the evaluation function is used to evaluate the fitness of the node.
[0126] Optionally, the determination device 300 of the device in the network may further include: a third determination unit, used to simultaneously determine multiple nodes as failed nodes; and a fourth determination unit, used to determine the fitness of multiple failed nodes using an evaluation function.
[0127] Optionally, the third determination submodule can also be used to update the node group in response to the fitness being less than the fitness threshold; determine each node in the updated node group as the target node in the graph structure model; and determine the device corresponding to the target node as the target device in the target network.
[0128] In this embodiment, the node information of the target network is obtained, wherein the node information is used to at least represent the location information of different devices in the target network; based on the node information, a graph structure model of the target network is established, wherein the graph structure model includes multiple nodes and at least one edge, the node is used to represent the device, and the edge is used to represent the relationship between different devices; based on the graph structure model, the fitness of each node in the graph structure model is determined, wherein the fitness is used to indicate the importance of the node in the graph structure model; based on the fitness, at least one target device in the target network is determined, wherein the target device affects the security status of the target network function. That is to say, the present invention determines the target device in the target network according to the graph structure model by establishing a graph structure model of the target network. Since the present invention utilizes the topological information of the network and calculates the impact of node failure on the entire network, it can identify the potentially destructive nodes in the network, and then determine the key devices that have a significant impact on the network, thereby solving the technical problem of being unable to determine the key devices in the network and achieving the technical effect of determining the key devices in the network.
[0129] According to an embodiment of the present invention, a computer-readable storage medium is further provided. The storage medium includes a stored program, wherein the program executes the method for determining a device in a network in Embodiment 1.
[0130] According to an embodiment of the present invention, a processor is further provided. The processor is used to run a program, wherein the method for determining a device in a network in Embodiment 1 is executed when the program is run.
[0131] According to an embodiment of the present invention, a computer program product is further provided. The computer program product includes computer instructions. When the computer instructions are executed by a processor, the method for determining a device in a network in Embodiment 1 is implemented.
[0132] The serial numbers of the above embodiments of the present invention are only for description and do not represent the advantages or disadvantages of the embodiments.
[0133] In the above embodiments of the present invention, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.
[0134] In the several embodiments provided in this application, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are only schematic. For example, the division of units can be a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of units or modules, which can be electrical or other forms.
[0135] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed over multiple units. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.
[0136] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
[0137] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent functional component, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software functional component, which is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, server or network device, etc.) to perform all or part of the steps of the methods of each embodiment of the present invention. The aforementioned storage medium includes: U disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), mobile hard disk, disk or optical disk, etc., which can store program codes.
[0138] The above are only preferred embodiments of the present invention. It should be pointed out that, for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.
Claims
1. A method for determining a device in a network, characterized in that: include: Acquire node information of a target network, wherein the node information is used to at least represent location information of different devices in the target network; Based on the node information, a graph structure model of the target network is established, wherein the graph structure model includes a plurality of nodes and at least one edge, the nodes are used to represent the devices, and the edges are used to represent the relationships between different devices; Based on the graph structure model, determining the fitness of each of the nodes in the graph structure model, wherein the fitness is used to indicate the importance of the node in the graph structure model; At least one target device in the target network is determined based on the fitness, wherein the target device affects a security status of a function of the target network.
2. The method according to claim 1, characterized in that Determining the fitness of each of the nodes in the graph structure model based on the graph structure model includes: Determine at least one failed node in the graph structure model, wherein the failed node is used to indicate that the node is in a failed state; Based on the failed nodes, the fitness of each of the nodes in the graph structure model is determined.
3. The method according to claim 2, characterized in that Determining the fitness of each of the nodes in the graph structure model based on the failed nodes includes: Determining the influence degree of the failed node, wherein the influence degree is used to indicate the influence degree of the failed node on the graph structure model; Determine a node group based on the influence, wherein the node group is used to indicate a set of the nodes; Based on the node group, the fitness of each of the nodes in the graph structure model is determined.
4. The method according to claim 3, characterized in that Determining the fitness of each of the nodes in the graph structure model based on the node group includes: An evaluation function is called to determine the fitness of each of the nodes in the node group, wherein the evaluation function is used to evaluate the fitness of the node.
5. The method according to claim 4, characterized in that The method further comprises: simultaneously determining a plurality of the nodes as the failed nodes; The fitness of the plurality of failed nodes is determined by using the evaluation function.
6. The method according to claim 1, characterized in that Determining at least one target device in the target network based on the fitness includes: In response to the fitness being less than a fitness threshold, updating the node group; Determine each of the nodes in the updated node group as the target node in the graph structure model; The device corresponding to the target node is determined as the target device in the target network.
7. A device for determining a device in a network, characterized in that: include: An acquiring unit, configured to acquire node information of a target network, wherein the node information is used to at least represent location information of different devices in the target network; An establishing unit, configured to establish a graph structure model of the target network based on the node information, wherein the graph structure model includes a plurality of nodes and at least one edge, the nodes are used to represent the devices, and the edges are used to represent the relationships between different devices; A first determining unit, configured to determine the fitness of each of the nodes in the graph structure model based on the graph structure model, wherein the fitness is used to indicate the importance of the node in the graph structure model; The second determining unit is configured to determine at least one target device in the target network based on the fitness, wherein the target device affects a security status of a function of the target network.
8. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes a stored program, wherein when the program is executed by a processor, the device where the storage medium is located is controlled to execute the method according to any one of claims 1 to 6.
9. A processor, characterized in that: The processor is used to run a program, wherein the program executes the method according to any one of claims 1 to 6 when running.
10. A computer program product, characterized in that The computer program product comprises computer instructions, which implement the method according to any one of claims 1 to 6 when executed by a processor.
Citation Information
Patent Citations
Method and system for evaluating key nodes by adopting summary graph and node pair influence values
CN110149233A
Network key point analysis method based on single-layer information flow transmission
CN111478813A
Adaptive network recovery method, device and equipment based on key node identification
CN115801549A
Network node population optimization method and device, electronic equipment and storage medium
CN118055034A
Method and apparatus for evaluating the importance of complex network nodes
JP7224700B1
