Communication path planning method and device based on ospf model, equipment, medium and product

Abstract

The application relates to a communication path planning method and device based on an OSPF model, equipment, a medium and a product. The method comprises the following steps: acquiring a topological structure of a target communication network; acquiring trust evaluation results of routing devices corresponding to nodes; in each iteration process, selecting a relay node with the minimum path cost according to the path cost between at least one candidate node not participating in path planning and a root node; determining at least one neighbor node not participating in path planning corresponding to the relay node; for each neighbor node, updating the path cost between the neighbor node and the root node according to the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node, taking the neighbor node as a candidate node in the next iteration process, and continuing to execute the next iteration process; and determining the communication path between the routing devices according to the relay nodes and the root node.

Description

Technical Field

[0001] This application relates to the field of power communication technology, and in particular to a communication path planning method, apparatus, equipment, medium and product based on the OSPF model. Background Technology

[0002] In the field of power communication technology, new power communication networks carry sensitive services such as relay protection and wide-area measurement.

[0003] To address the threat of malicious node infiltration in power communication networks, related technologies employ a security-enhanced OSPF (Open Shortest Path First) routing protocol with encrypted authentication and topology tamper-proofing for typical power communication networks. This protocol primarily isolates low-trust routing nodes to prevent their participation in critical service flow transmission, providing a basic secure routing framework for power communication networks.

[0004] However, the aforementioned technologies are prone to service interruptions due to excessive isolation. Therefore, how to rationally plan communication paths is a problem worthy of attention. Summary of the Invention

[0005] Therefore, it is necessary to provide a communication path planning method, apparatus, device, medium, and product based on the OSPF model that can reasonably perform communication path planning to address the above-mentioned technical problems.

[0006] Firstly, this application provides a communication path planning method based on the OSPF model, including:

[0007] Obtain the topology of the target communication network; the nodes in the topology correspond to the routing devices in the target communication network, and the edges in the topology correspond to the connection relationships between the routing devices.

[0008] Obtain the trust evaluation results of the routing devices corresponding to each node; the trust evaluation results are determined based on the transmission behavior data of the routing devices in the historical transmission process;

[0009] In each iteration, based on the path cost between at least one candidate node that did not participate in path planning and the root node in the topology, the transit node with the minimum path cost is selected from the candidate nodes; the path cost is used to characterize the link bandwidth between the corresponding nodes.

[0010] Identify at least one neighbor node that is not involved in path planning for the transit node;

[0011] For each neighbor node, the path cost between the neighbor node and the relay node is updated based on the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node. The neighbor node is then used as a candidate node in the next iteration process, and the next iteration process continues until the relay node has no neighbor nodes that have not participated in the path planning. In the first iteration, the path cost between at least one candidate node that has not participated in the path planning and the root node in the topology is preset.

[0012] Based on each relay node and root node, determine the communication path between each routing device in the target communication network.

[0013] In one embodiment, updating the path cost between a neighboring node and the root node based on the path cost between the neighboring node and the relay node, the trust evaluation result of the routing device corresponding to the neighboring node, and the path cost between the relay node and the root node includes: obtaining the historical path cost between the neighboring node and the root node in the previous iteration; determining the reference path cost between the neighboring node and the root node based on the path cost between the neighboring node and the relay node, the trust evaluation result of the routing device corresponding to the neighboring node, and the path cost between the relay node and the root node; and updating the path cost between the neighboring node and the root node based on the comparison between the historical path cost and the reference path cost.

[0014] In one embodiment, determining the reference path cost between a neighboring node and the root node based on the path cost between the neighboring node and the relay node, the trust evaluation result of the routing device corresponding to the neighboring node, and the path cost between the relay node and the root node includes: determining the initial path cost between the neighboring node and the root node based on the path cost between the neighboring node and the relay node, and the path cost between the relay node and the root node; and determining the reference path cost based on the initial path cost and the trust evaluation result of the routing device corresponding to the neighboring node.

[0015] In one embodiment, a reference path cost is determined based on the initial path cost and the trust evaluation result of the routing device corresponding to the neighboring node. Determining the reference path cost includes: if the trust evaluation result indicates that the routing device corresponding to the neighboring node is trustworthy, using the initial path cost as the reference path cost; if the trust evaluation result indicates that the routing device corresponding to the neighboring node is untrustworthy, determining the reference path cost based on the initial path cost and preset penalty information.

[0016] In one embodiment, obtaining the trust evaluation result of the routing device corresponding to each node includes: obtaining the transmission behavior data of the routing device corresponding to each node in the historical transmission process; and for each routing device, performing a trust evaluation on the routing device based on the transmission behavior data to obtain the trust evaluation result of the routing device.

[0017] In one embodiment, the transmission behavior data includes at least one of the following: the number of successfully transmitted data packets, the number of data packets that passed verification, the number of data packets with complete content, and the number of data packets that conform to the transmission protocol; the total number of transmitted data packets; and feedback information from other routing devices regarding the transmission behavior of the routing device. Based on the transmission behavior data, a trust evaluation is performed on the routing device to obtain a trust evaluation result, including: determining the transmission success rate of the routing device based on the number of successfully transmitted data packets and the total number of transmitted data packets; determining the verification pass rate of the routing device based on the number of data packets that passed verification and the total number of transmitted data packets; determining the content integrity rate of the routing device based on the number of data packets with complete content and the total number of transmitted data packets; determining the protocol compliance rate of the routing device based on the number of data packets that conform to the transmission protocol and the total number of transmitted data packets; and determining the trust evaluation result of the routing device based on at least one of the transmission success rate, verification pass rate, content integrity rate, protocol compliance rate, and feedback information from other routing devices regarding the transmission behavior of the routing device.

[0018] Secondly, this application also provides a communication path planning device based on the OSPF model, comprising:

[0019] The first acquisition module is used to acquire the topology of the target communication network; the nodes in the topology correspond to the routing devices in the target communication network, and the edges in the topology correspond to the connection relationships between the routing devices.

[0020] The second acquisition module is used to acquire the trust evaluation results of the routing devices corresponding to each node; the trust evaluation results are determined based on the transmission behavior data of the routing devices in the historical transmission process.

[0021] The selection module is used in each iteration to select the transit node with the minimum path cost from the candidate nodes based on the path cost between at least one candidate node that did not participate in path planning and the root node in the topology; the path cost is used to characterize the link bandwidth between the corresponding nodes.

[0022] The first determining module is used to determine at least one neighbor node that is not involved in the path planning corresponding to the transit node;

[0023] The update module is used to update the path cost between each neighbor node and the root node based on the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node. The neighbor node is then used as a candidate node in the next iteration process, and the next iteration process continues until there are no neighbor nodes that have not participated in the path planning for the relay node. In the first iteration, the path cost between at least one candidate node that has not participated in the path planning and the root node in the topology is preset.

[0024] The second determining module is used to determine the communication path between each routing device in the target communication network based on each relay node and root node.

[0025] Thirdly, this application also provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to perform the following steps:

[0026] Obtain the topology of the target communication network; the nodes in the topology correspond to the routing devices in the target communication network, and the edges in the topology correspond to the connection relationships between the routing devices.

[0027] Obtain the trust evaluation results of the routing devices corresponding to each node; the trust evaluation results are determined based on the transmission behavior data of the routing devices in the historical transmission process;

[0028] In each iteration, based on the path cost between at least one candidate node that did not participate in path planning and the root node in the topology, the transit node with the minimum path cost is selected from the candidate nodes; the path cost is used to characterize the link bandwidth between the corresponding nodes.

[0029] Identify at least one neighbor node that is not involved in path planning for the transit node;

[0030] For each neighbor node, the path cost between the neighbor node and the relay node is updated based on the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node. The neighbor node is then used as a candidate node in the next iteration process, and the next iteration process continues until the relay node has no neighbor nodes that have not participated in the path planning. In the first iteration, the path cost between at least one candidate node that has not participated in the path planning and the root node in the topology is preset.

[0031] Based on each relay node and root node, determine the communication path between each routing device in the target communication network.

[0032] Fourthly, this application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, performs the following steps:

[0033] Obtain the topology of the target communication network; the nodes in the topology correspond to the routing devices in the target communication network, and the edges in the topology correspond to the connection relationships between the routing devices.

[0034] Obtain the trust evaluation results of the routing devices corresponding to each node; the trust evaluation results are determined based on the transmission behavior data of the routing devices in the historical transmission process;

[0035] In each iteration, based on the path cost between at least one candidate node that did not participate in path planning and the root node in the topology, the transit node with the minimum path cost is selected from the candidate nodes; the path cost is used to characterize the link bandwidth between the corresponding nodes.

[0036] Identify at least one neighbor node that is not involved in path planning for the transit node;

[0037] For each neighbor node, the path cost between the neighbor node and the relay node is updated based on the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node. The neighbor node is then used as a candidate node in the next iteration process, and the next iteration process continues until the relay node has no neighbor nodes that have not participated in the path planning. In the first iteration, the path cost between at least one candidate node that has not participated in the path planning and the root node in the topology is preset.

[0038] Based on each relay node and root node, determine the communication path between each routing device in the target communication network.

[0039] Fifthly, this application also provides a computer program product, including a computer program that, when executed by a processor, performs the following steps:

[0040] Obtain the topology of the target communication network; the nodes in the topology correspond to the routing devices in the target communication network, and the edges in the topology correspond to the connection relationships between the routing devices.

[0041] Obtain the trust evaluation results of the routing devices corresponding to each node; the trust evaluation results are determined based on the transmission behavior data of the routing devices in the historical transmission process;

[0042] In each iteration, based on the path cost between at least one candidate node that did not participate in path planning and the root node in the topology, the transit node with the minimum path cost is selected from the candidate nodes; the path cost is used to characterize the link bandwidth between the corresponding nodes.

[0043] Identify at least one neighbor node that is not involved in path planning for the transit node;

[0044] For each neighbor node, the path cost between the neighbor node and the relay node is updated based on the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node. The neighbor node is then used as a candidate node in the next iteration process, and the next iteration process continues until the relay node has no neighbor nodes that have not participated in the path planning. In the first iteration, the path cost between at least one candidate node that has not participated in the path planning and the root node in the topology is preset.

[0045] Based on each relay node and root node, determine the communication path between each routing device in the target communication network.

[0046] The aforementioned communication path planning method, apparatus, device, medium, and product based on the OSPF model include: acquiring the topology of the target communication network; acquiring the trust evaluation results of the routing devices corresponding to each node; in each iteration, selecting the relay node with the lowest path cost from the candidate nodes based on the path cost between at least one candidate node not involved in path planning and the root node; determining at least one neighbor node corresponding to the relay node that is not involved in path planning; for each neighbor node, updating the path cost between the neighbor node and the root node based on the path cost between the neighbor node and the relay node, the trust evaluation results of the routing devices corresponding to the neighbor node, and the path cost between the relay node and the root node, and setting the neighbor node... As a candidate node in the next iteration, the next iteration continues until the relay node has no neighboring nodes that are not involved in the path planning. Based on each relay node and the root node, the communication path between each routing device in the target communication network is determined. In the above communication path planning process, for each neighboring node, the path cost between the neighboring node and the root node is updated based on the path cost between the neighboring node and the relay node, the trust evaluation result of the routing device corresponding to the neighboring node, and the path cost between the relay node and the root node. The above process does not completely isolate nodes with low trust, but takes into account the trust evaluation result of the routing device corresponding to the neighboring node. Therefore, the communication path can be planned more reasonably to ensure the smooth operation of communication services. Attached Figure Description

[0047] To more clearly illustrate the technical solutions in the embodiments of this application or related technologies, the drawings used in the description of the embodiments of this application or related technologies will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0048] Figure 1 This is an application environment diagram of a communication path planning method based on the OSPF model in one embodiment;

[0049] Figure 2 This is a flowchart illustrating a communication path planning method based on the OSPF model in one embodiment.

[0050] Figure 3 This is a schematic diagram of the structure of a subtopological region in one embodiment;

[0051] Figure 4 This is a flowchart illustrating the path cost update step in one embodiment;

[0052] Figure 5 This is a flowchart illustrating the reference path cost determination steps in one embodiment;

[0053] Figure 6 This is a flowchart illustrating a communication path planning method based on the OSPF model in another embodiment;

[0054] Figure 7 This is a structural block diagram of a communication path planning device based on the OSPF model in one embodiment;

[0055] Figure 8 This is an internal structural diagram of a computer device in one embodiment. Detailed Implementation

[0056] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0057] The communication path planning method based on the OSPF model provided in this application can be applied to, for example... Figure 1In the application environment shown, terminal 102 communicates with server 104 via a network. A data storage system can store the data that server 104 needs to process. The data storage system can be integrated onto server 104 or located on the cloud or other network servers. Terminal 102 can be, but is not limited to, various personal computers, laptops, smartphones, tablets, IoT devices, and portable wearable devices. IoT devices can include smart speakers, smart TVs, smart air conditioners, smart in-vehicle devices, projection devices, etc. Portable wearable devices can include smartwatches, smart bracelets, head-mounted devices, etc. Head-mounted devices can be virtual reality (VR) devices, augmented reality (AR) devices, smart glasses, etc. Server 104 can be a standalone physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server providing cloud computing services.

[0058] In one exemplary embodiment, such as Figure 2 As shown, a communication path planning method based on the OSPF model is provided, which is then applied to... Figure 1 Taking the server in the example, the following steps are included:

[0059] S210, Obtain the topology of the target communication network; the nodes in the topology correspond to the routing devices in the target communication network, and the edges in the topology correspond to the connection relationships between the routing devices.

[0060] The target communication network can be a power communication network. This network can include production control areas, non-control areas, and management information areas. Different areas can rely on the OSPF routing protocol to achieve cross-domain routing.

[0061] In some embodiments, a modular OSPF topology can be constructed in a network simulation tool for the target communication network. The topology may include sub-topology regions corresponding to at least one sub-network in the target communication network. Each sub-topology region may include at least one backbone routing device and a routing device cluster consisting of at least one non-backbone routing device. For example... Figure 3 The illustrated sub-topology area includes five backbone routing devices (B1 to B5) and ten routing device clusters (c1 to c10), each cluster containing ten non-backbone routing devices. The backbone routing devices within each sub-topology area are continuous and interconnected. Non-backbone routing devices within each routing device cluster are interconnected within their respective sub-topology areas, synchronizing routing information and accessing the backbone devices uniformly through dedicated ABR (Area Border Router) devices.

[0062] In this application, Dijkstra's algorithm can be used to determine the communication paths between routing devices in the target communication network, and the specific process will be described below.

[0063] S220, obtain the trust evaluation results of the routing devices corresponding to each node; the trust evaluation results are determined based on the transmission behavior data of the routing devices in the historical transmission process.

[0064] The trust evaluation result can be understood as a trust evaluation of the routing device based on the transmission behavior data of the routing device in the historical transmission process.

[0065] In some embodiments, transmission behavior data of the corresponding routing device for each node during historical transmission can be obtained; for each routing device, a trust evaluation is performed on the routing device based on the transmission behavior data to obtain the trust evaluation result of the routing device.

[0066] In some embodiments, transmission behavior data may include at least one of the following: the number of successfully transmitted data packets, the number of data packets that passed verification, the number of data packets with complete content, the number of data packets that conform to the transmission protocol, the total number of transmitted data packets, and feedback information from other routing devices regarding the transmission behavior of the routing devices.

[0067] In some embodiments, a trust evaluation of the routing device is performed based on transmission behavior data to obtain a trust evaluation result for the routing device, including: determining the transmission success rate of the routing device based on the number of successfully transmitted data packets and the total number of transmitted data packets; determining the verification pass rate of the routing device based on the number of verified data packets and the total number of transmitted data packets; determining the content integrity rate of the routing device based on the number of data packets with complete content and the total number of transmitted data packets; determining the protocol compliance rate of the routing device based on the number of data packets conforming to the transmission protocol and the total number of transmitted data packets; and determining the trust evaluation result of the routing device based on at least one of the transmission success rate, verification pass rate, content integrity rate, and protocol compliance rate, as well as feedback information from other routing devices regarding the transmission behavior of the routing device.

[0068] The transmission success rate can be understood as the ratio of the number of successfully transmitted data packets to the total number of transmitted data packets. The verification pass rate can be the ratio of the number of data packets that pass verification to the total number of transmitted data packets; the content integrity rate can be the ratio of the number of data packets with complete content to the total number of transmitted data packets; and the protocol compliance rate can be the ratio of the number of data packets that conform to the transmission protocol specifications to the total number of transmitted data packets. Feedback information from other routing devices on the routing device's transmission behavior can be understood as feedback scores from other routing devices adjacent to the routing device, with values ​​exemplarily (0,1).

[0069] In some embodiments, traffic packet quality can be determined based on at least one of verification pass rate, content integrity rate, and protocol compliance rate. Specifically, traffic packet quality can be obtained by weighted summation of at least one of verification pass rate, content integrity rate, and protocol compliance rate.

[0070] In some embodiments, the trust level of a routing device can be determined based on at least one of transmission success rate, verification pass rate, content integrity rate, protocol compliance rate, and feedback information from other routing devices regarding the transmission behavior of the routing device; and a trust evaluation result can be determined based on the trust level.

[0071] In some embodiments, the trust level of a routing device can be obtained according to the following formula:

[0072] T(v)=f(S(v),F(v),N(v))=1 / (aS(v)+bF(v)+cN(v))

[0073] Where T(v) represents the trust level of the routing device corresponding to node v; S(v) is the transmission success rate of the routing device corresponding to node v; F(v) is the traffic data packet quality of the routing device corresponding to node v; N(v) is the feedback information of other routing devices on the transmission behavior of the routing device of node v; a is the weight corresponding to the transmission success rate; b is the weight corresponding to the traffic data packet quality; and c is the weight corresponding to the feedback information.

[0074] Where S(v) = total number of successfully transmitted data packets / total number of transmitted data packets.

[0075] in, ; C(v) represents the verification pass rate, which is calculated as: verification pass rate = number of data packets that passed verification / total number of data packets transmitted. The weighting coefficients corresponding to the pass rate are used for verification; I(v) represents the content integrity rate, which is calculated as: content integrity rate = number of data packets with complete content / total number of transmitted data packets. P(v) represents the weighting coefficient corresponding to the content integrity rate; P(v) represents the protocol compliance rate, which is calculated as: Protocol compliance rate = Number of data packets conforming to the transmission protocol specification / Total number of transmitted data packets. This is the weighting coefficient corresponding to the protocol compliance rate.

[0076] Wherein, N(v) represents other routing devices corresponding to nodes adjacent to node v, and is a comprehensive feedback score given for the behavior of the routing devices corresponding to node v based on the actual interaction experience with the routing devices corresponding to node v.

[0077] In some embodiments, for each node's corresponding routing device, the trust evaluation result of the routing device can be determined based on the trust level of the routing device and at least one preset threshold.

[0078] In some embodiments, if the trust score of a routing device is greater than 0.8, the trust evaluation result corresponding to the routing device is determined to be trustworthy, the routing device is a trustworthy device, and the corresponding node is a trustworthy node. If the trust score of a routing device is less than 0.4, the trust evaluation result corresponding to the routing device is determined to be untrustworthy, the routing device is an untrustworthy device, and the corresponding node is an untrustworthy node. If the trust score of a routing device is not less than 0.4 and not greater than 0.8, the trust evaluation result corresponding to the routing device is determined to be temporarily untrustworthy, the routing device is a temporarily untrustworthy device, and the corresponding node is a temporarily untrustworthy node.

[0079] S230, In each iteration, based on the path cost between at least one candidate node that has not participated in path planning and the root node in the topology, select the transit node with the minimum path cost from the candidate nodes.

[0080] In some embodiments, any node in the topology can be used as the root node; the path cost is used to characterize the link bandwidth between the corresponding candidate node and the root node.

[0081] In some embodiments, a set of nodes N can be created.

[0082] In the initial iteration, the node set N may contain only the root node D. The path cost of the root node can be set to DS(D) = 0. All nodes other than the root node are candidate nodes not involved in path planning. These candidate nodes include the root node's neighbor node v (nodes directly connected to the root node) and the root node's non-neighbor nodes (nodes not directly connected to the root node). The path cost between the root node and its neighbor node can be DS(v) = c(D,v). For the root node D, if its neighbor node is an untrusted node, the path cost between that neighbor node and the root node is DS(v) = c(D,v) × α; where α is a preset penalty information, specifically a preset penalty factor, α > 1. The path cost between the root node and its non-neighbor node can be set to DS(v) = ∞. The path cost between the root node and its neighbor node represents the link bandwidth between the root node and its neighbor node. The path cost between the root node and its non-neighbor node represents the link bandwidth between the root node and its non-neighbor node. Path cost can be determined based on the bandwidth between two nodes. Path cost is negatively correlated with bandwidth. Higher bandwidth between two nodes results in higher link transmission efficiency and lower path cost.

[0083] In all iterations except the first iteration, the path cost between at least one candidate node that did not participate in path planning and the root node in the topology can be determined in the previous iteration.

[0084] In some embodiments, the path costs between each candidate node and the root node can be compared, and the candidate node with the lowest corresponding path cost can be selected as the transit node.

[0085] For example, in the first iteration, assume the topology includes root node D, neighbor node w1 of root node D, neighbor node w2 of w1, and neighbor node v of w2. Here, DS(D) = 0, DS(w1) = c(D, w1), DS(w2) = ∞, and DS(v) = ∞. Therefore, among the candidate nodes not involved in path planning, the path cost between neighbor node w1 and the root node is the lowest. Thus, neighbor node w1 can be used as a transit node.

[0086] In some embodiments, the selected transit node can be added to the node set N.

[0087] S240, determine at least one neighbor node that is not involved in the path planning corresponding to the transit node.

[0088] In some embodiments, at least one neighboring node that has not participated in path planning can be determined based on the connection relationship between the routing devices in the topology.

[0089] S250: For each neighbor node, based on the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node, update the path cost between the neighbor node and the root node, and use the neighbor node as a candidate node in the next iteration process, and continue to execute the next iteration process until the relay node has no neighbor nodes that have not participated in the path planning; In the first iteration process, the path cost between at least one candidate node that has not participated in the path planning and the root node in the topology is preset.

[0090] Understandably, before a relay node is determined, the neighboring nodes of the relay node can communicate with the root node according to the historical communication path. After the relay node is determined, the neighboring nodes of the relay node can communicate with the root node according to the new communication path determined with the relay node as the transit point.

[0091] In some embodiments, the historical communication paths of the relay node's neighboring nodes can be compared with the new communication path, and the communication path that meets preset requirements (such as lower path cost) can be selected as the target communication path between the relay node's neighboring node and the root node. After selecting the target communication path, the path cost between the neighboring node and the root node can be determined based on the target communication path. Specifically, if a historical communication path is selected as the target communication path, the path cost between the neighboring node and the root node remains unchanged; if a new communication path is selected as the target communication path, the path cost between the neighboring node and the relay node is calculated based on the path cost between the neighboring node and the relay node, the trust evaluation result of the routing device corresponding to the neighboring node, and the path cost between the relay node and the root node.

[0092] As mentioned earlier, during the first iteration, if the candidate node that did not participate in path planning is a neighbor node of the root node, the path cost between the candidate node and the root node can be DS(v)=c(D,v); if the candidate node that did not participate in path planning is a non-neighbor node of the root node, the path cost between the candidate node and the root node can be set to DS(v)=∞.

[0093] In some embodiments, as the number of iterations increases, the number of nodes in the topology that are not involved in path planning decreases until the transit node has no neighboring nodes that are not involved in path planning, that is, there are no nodes in the topology that are not involved in path planning, and the path planning process ends.

[0094] S260, based on each relay node and root node, determines the communication path between each routing device in the target communication network.

[0095] At the end of the path planning process, the communication path from the root node to the last relay node can be determined based on the order in which the relay nodes are identified; that is, the communication path between the routing devices in the target communication network. The communication path obtained based on the above steps is the shortest communication path from the root node to the last relay node.

[0096] In the communication path planning method based on the OSPF model described above, for each neighbor node, the path cost between the neighbor node and the relay node is updated according to the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node. The above process does not completely isolate nodes with low trust, but takes into account the trust evaluation result of the routing device corresponding to the neighbor node. Therefore, communication paths can be planned more reasonably to ensure the smooth operation of communication services.

[0097] Based on the technical solutions of the above embodiments, this application also provides another optional embodiment, in which the path cost update step of S250 is refined.

[0098] See Figure 4 The path cost update steps shown include:

[0099] S410: Obtain the historical path cost between the neighboring node and the root node in the previous iteration.

[0100] If the previous iteration was the first iteration, the historical path cost between the neighbor node and the root node is DS(v)=∞.

[0101] If the previous iteration was not the first iteration, the historical path cost between the neighbor node and the root node can be determined according to steps S220-S250.

[0102] S420: Determine the reference path cost between the neighbor node and the root node based on the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node.

[0103] In some embodiments, the path cost between a neighbor node v and a relay node w can be represented as c(w,v), the path cost between a relay node w and the root node D can be represented as DS(w), and the reference path cost between a neighbor node and the root node can be represented as new_cost=DS(w)+c(w,v).

[0104] S430: Based on the comparison between historical path costs and reference path costs, update the path costs between neighboring nodes and the root node.

[0105] In some embodiments, the smaller value between the historical path cost and the reference path cost can be used as the path cost between the neighbor node and the root node.

[0106] In some embodiments, the path cost between a neighboring node and the root node can be expressed as DS(v) = min(DS(v), DS(w) + c(w,v)).

[0107] In this embodiment, by comparing the historical path cost with the reference path cost, the path cost between the neighbor node and the root node is updated to a smaller path cost, thus laying the foundation for planning the shortest communication path in the future.

[0108] In some embodiments, routing devices in the target communication network may be susceptible to malicious node infiltration threats, data tampering, and other dangerous behaviors. To improve the security of the communication path, during the process of determining the communication path corresponding to the target communication network, trust evaluation can be performed on each node to obtain the trust evaluation results, and path planning can be performed based on the trust evaluation results.

[0109] Based on the technical solutions of the above embodiments, this application also provides another optional embodiment, in which the reference path cost determination step of S420 is refined.

[0110] See Figure 5 The reference path cost determination steps shown include:

[0111] S510, determine the initial path cost between the neighbor node and the root node based on the path cost between the neighbor node and the relay node, and the path cost between the relay node and the root node.

[0112] In some embodiments, the sum of the path cost between the neighbor node and the relay node, and the path cost between the relay node and the root node, can be used as the initial path cost between the neighbor node and the root node, expressed as new_cost0=DS(w)+c(w,v).

[0113] S520 determines the reference path cost based on the initial path cost and the trust evaluation results of the routing devices corresponding to neighboring nodes.

[0114] In some embodiments, when the topology includes a sub-topology region corresponding to at least one sub-network in the target communication network, and the neighboring nodes include neighboring nodes within adjacent sub-topology regions, obtaining the trust evaluation result of the routing device corresponding to the neighboring node includes: for each sub-topology region, obtaining link state announcement information of adjacent sub-topology regions; the link state announcement information is used to characterize the trust evaluation result of the routing device within the corresponding sub-topology region.

[0115] In this context, adjacent sub-topological regions can be understood as other sub-topological regions adjacent to the current sub-topological region. There are connectivity relationships between nodes at the boundaries of the current sub-topological region and adjacent sub-topological regions. Therefore, for a transit node in the current sub-topological region, its neighboring nodes can include adjacent nodes within the adjacent sub-topological regions.

[0116] In practice, each sub-topology area can generate link status announcement information based on the trust evaluation results of the routing devices corresponding to each node within its own area, and then transmit the link status announcement information to other sub-topology areas through the area boundary router.

[0117] In some embodiments, if the trust evaluation result indicates that the routing device corresponding to the neighboring node is trustworthy, the initial path cost is used as the reference path cost. If the trust evaluation result indicates that the routing device corresponding to the neighboring node is untrustworthy, the reference path cost is determined based on the initial path cost and preset penalty information. In some embodiments, the product of the initial path cost and the preset penalty information can be used as the reference path cost, which can be denoted as new_cost. = new_cost0×α; where α is the preset penalty information, specifically the preset penalty factor, α>1.

[0118] In some embodiments, where the topology includes sub-topology regions corresponding to at least one sub-network in the target communication network, and neighboring nodes include neighboring nodes within adjacent sub-topology regions, for each sub-topology region, the local communication path corresponding to the sub-topology region can be obtained first according to the process described in S220-S250. After each sub-topology region obtains the link status announcement information of its neighboring sub-topology regions, it can optimize the local communication path based on its own local communication path and the link status announcement information to generate the global communication path of the target communication network.

[0119] In some embodiments, for any transit node in each sub-topology area, if the neighboring nodes of the transit node include neighboring nodes in the adjacent sub-topology areas, and if the neighboring nodes are untrusted nodes, the reference path cost can be: c(w,v)×γ×RiskFactor(w)), where γ∈[1,10] is a configurable risk coefficient, RiskFactor(w) = a×(LSA hop count)+b×(negative evaluation information fed back by neighboring nodes), where a and b are weight coefficients respectively; a+b=1, and the LSA (Link State Advertisement) hop count is the number of hops that the routing information is transmitted from the advertising node to the destination node in the OSPF protocol.

[0120] In some embodiments, for each node, when determining the path cost between the node and any other node, if any other node is an untrusted node, the product of the initial path cost between the node and any other node and the preset penalty information is used as the path cost between the node and any other node. For example, for the root node D, if the neighbor node corresponding to the root node is an untrusted node, the path cost between the neighbor node and the root node is DS(v) = c(D,v) × α.

[0121] In this embodiment, by determining the reference path cost based on the initial path cost and the trust evaluation results of the routing devices corresponding to neighboring nodes, it is possible to rationally plan communication paths and ensure the smooth operation of communication services.

[0122] Based on the technical solutions of the above embodiments, this application also provides another optional embodiment. In this optional embodiment, during the process of selecting the relay node with the minimum path cost from candidate nodes, if the node with the minimum path cost is an untrusted node E, then the path cost of the untrusted node and its corresponding neighbor nodes is set to c(E,F)=∞. That is, the output channel weight of the untrusted node E is set to infinity, reducing its priority. It is then checked whether there are other paths that can reach all nodes without passing through the untrusted node. If there is an alternative path, the untrusted node is completely skipped (at this time, the untrusted node only serves as the destination node). If there is no alternative path, the untrusted node is accepted, but its path cost is increased, i.e., DS(E)=DS(E)×α. For the neighbor node F of the untrusted node E, its DS(F) is reset to ∞. Finally, the path tree shows that the untrusted node E becomes a leaf node and no longer forwards traffic.

[0123] For untrusted nodes that cannot be bypassed, a preset number of candidate paths to the destination are selected using the K-shortest path algorithm. Paths containing untrusted nodes are first filtered out, and then the remaining paths are sorted from fewest to most based on the number of untrusted nodes they contain. Finally, traffic is allocated to different paths according to the sorting result. The traffic allocation formula is: the proportion of traffic allocated to path i = (1 / PathRiskScore_i) / Σ(1 / PathRiskScore_j), where PathRiskScore = ΣRiskFactor(v) for v in path. PathRiskScore_i is the overall risk score of the i-th path, which is the core indicator for measuring the trust risk of a single path; the larger the value, the higher the path risk. RiskFactor(v) for v in path is the trust risk factor of a single node v in the target communication network, which is a quantitative value of the node's own untrustworthiness; the larger the value, the higher the trust risk of node v.

[0124] Based on the technical solutions of the above embodiments, this application also provides another optional embodiment, in which the communication path planning method based on the OSPF model is described in detail.

[0125] See Figure 6 The communication path planning method based on the OSPF model shown includes:

[0126] S601, Obtain the topology of the target communication network.

[0127] In this topology, the nodes correspond to the routing devices in the target communication network, and the edges correspond to the connection relationships between the routing devices.

[0128] S602, obtain the transmission behavior data of the corresponding routing device of each node during the historical transmission process.

[0129] S603 performs a trust evaluation on each routing device based on transmission behavior data, and obtains the trust evaluation result of the routing device.

[0130] S604. In each iteration, based on the path cost between at least one candidate node that has not participated in path planning and the root node in the topology, select the transit node with the minimum path cost from the candidate nodes.

[0131] S605, determine at least one neighbor node that is not involved in the path planning corresponding to the transit node.

[0132] S606: For each neighboring node, obtain the historical path cost between the neighboring node and the root node in the previous iteration.

[0133] S607. Determine the initial path cost between the neighbor node and the root node based on the path cost between the neighbor node and the relay node, and the path cost between the relay node and the root node.

[0134] S608 determines the reference path cost based on the initial path cost and the trust evaluation results of the routing devices corresponding to neighboring nodes.

[0135] S609: If the trust evaluation result indicates that the routing device corresponding to the neighboring node is trustworthy, the initial path cost is used as the reference path cost; if the trust evaluation result indicates that the routing device corresponding to the neighboring node is untrustworthy, the reference path cost is determined based on the initial path cost and the preset penalty information.

[0136] S610: Based on the comparison between historical path cost and reference path cost, update the path cost between neighboring nodes and the root node, and continue to execute the next iteration process until the transit node has no neighboring nodes that have not participated in path planning.

[0137] In the first iteration, the path cost between at least one candidate node that is not involved in path planning and the root node in the topology is preset.

[0138] S611, based on each relay node and root node, determines the communication path between each routing device in the target communication network.

[0139] It should be understood that although the steps in the flowcharts of the embodiments described above are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the embodiments described above may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the steps or stages of other steps.

[0140] Based on the same inventive concept, this application also provides an OSPF-based communication path planning device for implementing the OSPF-based communication path planning method described above. The solution provided by this device is similar to the implementation described in the above method. Therefore, the specific limitations in one or more OSPF-based communication path planning device embodiments provided below can be found in the limitations of the OSPF-based communication path planning method described above, and will not be repeated here.

[0141] In one exemplary embodiment, such as Figure 7 As shown, a communication path planning device based on the OSPF model is provided, including: a first acquisition module 710, a second acquisition module 720, a selection module 730, a first determination module 740, an update module 750, and a second determination module 760, wherein:

[0142] The first acquisition module 710 is used to acquire the topology of the target communication network; the nodes in the topology correspond to the routing devices in the target communication network, and the edges in the topology correspond to the connection relationships between the routing devices.

[0143] The second acquisition module 720 is used to acquire the trust evaluation results of the routing devices corresponding to each node; the trust evaluation results are determined based on the transmission behavior data of the routing devices in the historical transmission process.

[0144] Module 730 is used to select the transit node with the minimum path cost from the candidate nodes in each iteration, based on the path cost between at least one candidate node that did not participate in path planning and the root node in the topology; the path cost is used to characterize the link bandwidth between the corresponding nodes.

[0145] The first determining module 740 is used to determine at least one neighbor node that is not involved in the path planning corresponding to the transit node;

[0146] The update module 750 is used to update the path cost between the neighbor node and the root node for each neighbor node based on the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node. The neighbor node is then used as a candidate node in the next iteration process, and the next iteration process continues until there are no neighbor nodes that have not participated in the path planning for the relay node. In the first iteration, the path cost between at least one candidate node that has not participated in the path planning and the root node in the topology is preset.

[0147] The second determining module 760 is used to determine the communication path between each routing device in the target communication network based on each relay node and the root node.

[0148] In one embodiment, the update module 750 is specifically used to: obtain the historical path cost between the neighbor node and the root node in the previous iteration; determine the reference path cost between the neighbor node and the root node based on the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node; and update the path cost between the neighbor node and the root node based on the comparison between the historical path cost and the reference path cost.

[0149] In one embodiment, the update module 750 is specifically used to: determine the initial path cost between the neighbor node and the root node based on the path cost between the neighbor node and the relay node, and the path cost between the relay node and the root node; and determine the reference path cost based on the initial path cost and the trust evaluation result of the routing device corresponding to the neighbor node.

[0150] In one embodiment, the update module 750 is specifically configured to: use the initial path cost as the reference path cost when the trust evaluation result indicates that the routing device corresponding to the neighbor node is trustworthy; and determine the reference path cost based on the initial path cost and preset penalty information when the trust evaluation result indicates that the routing device corresponding to the neighbor node is untrustworthy.

[0151] In one embodiment, the update module 750 is specifically used to: obtain the transmission behavior data of the corresponding routing device of each node in the historical transmission process; and for each routing device, perform a trust evaluation on the routing device based on the transmission behavior data to obtain the trust evaluation result of the routing device.

[0152] In one embodiment, the transmission behavior data includes at least one of the following: the number of successfully transmitted data packets, the number of data packets that passed verification, the number of data packets with complete content, and the number of data packets that conform to the transmission protocol, the total number of transmitted data packets, and feedback information from other routing devices regarding the transmission behavior of the routing device. The update module 750 is specifically used to: determine the transmission success rate of the routing device based on the number of successfully transmitted data packets and the total number of transmitted data packets; determine the verification pass rate of the routing device based on the number of data packets that passed verification and the total number of transmitted data packets; determine the content integrity rate of the routing device based on the number of data packets with complete content and the total number of transmitted data packets; determine the protocol compliance rate of the routing device based on the number of data packets that conform to the transmission protocol and the total number of transmitted data packets; and determine the trust evaluation result of the routing device based on at least one of the transmission success rate, verification pass rate, content integrity rate, protocol compliance rate, and feedback information from other routing devices regarding the transmission behavior of the routing device.

[0153] The modules in the OSPF-based communication path planning device described above can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in a computer device, or stored in the computer device's memory as software, so that the processor can call and execute the corresponding operations of each module.

[0154] In one exemplary embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as follows: Figure 8 As shown, this computer device includes a processor, memory, input / output (I / O) interfaces, and a communication interface. The processor, memory, and I / O interfaces are connected via a system bus, and the communication interface is also connected to the system bus via the I / O interfaces. The processor provides computational and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system, computer programs, and a database. The internal memory provides the environment for the operating system and computer programs stored in the non-volatile storage media. The database stores data related to the topology, path costs between candidate nodes and the root node, and trust evaluation results. The I / O interfaces are used for exchanging information between the processor and external devices. The communication interface is used for communication with external terminals via a network connection. When executed by the processor, the computer program implements a communication path planning method based on the OSPF model.

[0155] Those skilled in the art will understand that Figure 8The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0156] In one exemplary embodiment, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps of the communication path planning method based on the OSPF model provided in any of the above embodiments.

[0157] In one embodiment, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the steps of the communication path planning method based on the OSPF model provided in any of the above embodiments.

[0158] In one embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps of the communication path planning method based on the OSPF model provided in any of the above embodiments.

[0159] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM). The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, artificial intelligence (AI) processors, etc., and are not limited to these.

[0160] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0161] The embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are specific and detailed, they should not be construed as limiting the scope of this application. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this application should be determined by the appended claims.

Claims

1. A communication path planning method based on an OSPF model, characterized by, The method includes: Obtain the topology of the target communication network; the nodes in the topology correspond to the routing devices in the target communication network, and the edges in the topology correspond to the connection relationships between the routing devices. Obtain the trust evaluation result of the routing device corresponding to each node; the trust evaluation result is determined based on the transmission behavior data of the routing device in the historical transmission process; In each iteration, based on the path cost between at least one candidate node that did not participate in path planning and the root node in the topology, the transit node with the minimum path cost is selected from the candidate nodes; the path cost is used to characterize the link bandwidth between the corresponding nodes. Identify at least one neighbor node that is not involved in the path planning corresponding to the transit node; For each neighbor node, the path cost between the neighbor node and the relay node is updated based on the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node. The neighbor node is then selected as a candidate node for the next iteration, and the next iteration continues until the relay node has no neighbor nodes that are not involved in path planning. In the first iteration, the path cost between at least one candidate node that is not involved in path planning and the root node in the topology is preset. Based on each relay node and the root node, the communication path between each routing device in the target communication network is determined.

2. The method of claim 1, wherein, Based on the path cost between the neighboring node and the relay node, the trust evaluation result of the routing device corresponding to the neighboring node, and the path cost between the relay node and the root node, update the path cost between the neighboring node and the root node, including: Obtain the historical path cost between the neighboring node and the root node in the previous iteration; Based on the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node, the reference path cost between the neighbor node and the root node is determined; Based on the comparison between the historical path cost and the reference path cost, update the path cost between the neighbor node and the root node.

3. The method of claim 2, wherein, Based on the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node, the reference path cost between the neighbor node and the root node is determined, including: The initial path cost between the neighbor node and the root node is determined based on the path cost between the neighbor node and the relay node, and the path cost between the relay node and the root node. The reference path cost is determined based on the initial path cost and the trust evaluation results of the routing devices corresponding to the neighboring nodes.

4. The method according to claim 3, characterized in that, The step of determining the reference path cost based on the initial path cost and the trust evaluation result of the routing device corresponding to the neighbor node includes: If the trust evaluation result indicates that the routing device corresponding to the neighbor node is trustworthy, the initial path cost is used as the reference path cost. If the trust evaluation result indicates that the routing device corresponding to the neighbor node is untrusted, the reference path cost is determined based on the initial path cost and the preset penalty information.

5. The method according to claim 1, characterized in that, The step of obtaining the trust evaluation results of the routing devices corresponding to each node includes: Obtain the transmission behavior data of the routing devices corresponding to each node during the historical transmission process; For each routing device, a trust evaluation is performed on the routing device based on the transmission behavior data to obtain the trust evaluation result of the routing device.

6. The method according to claim 5, characterized in that, The transmission behavior data includes at least one of the following: the number of successfully transmitted data packets, the number of data packets that passed verification, the number of data packets with complete content, and the number of data packets that conform to the transmission protocol; the total number of transmitted data packets; and feedback information from other routing devices regarding the transmission behavior of the routing devices. Based on the transmission behavior data, a trust evaluation is performed on the routing device to obtain a trust evaluation result for the routing device, including: The transmission success rate of the routing device is determined based on the number of successfully transmitted data packets and the total number of transmitted data packets. The pass rate of the routing device is determined based on the number of data packets that pass verification and the total number of data packets transmitted. The content integrity rate of the routing device is determined based on the number of complete data packets and the total number of transmitted data packets; The protocol compliance rate of the routing device is determined based on the number of data packets conforming to the transmission protocol and the total number of transmitted data packets; The trust evaluation result of the routing device is determined based on at least one of the transmission success rate, the verification pass rate, the content integrity rate, and the protocol compliance rate, as well as feedback information from other routing devices regarding the transmission behavior of the routing device.

7. A communication path planning device based on the OSPF model, characterized in that, The device includes: The first acquisition module is used to acquire the topology of the target communication network; the nodes in the topology correspond to the routing devices in the target communication network, and the edges in the topology correspond to the connection relationships between the routing devices. The second acquisition module is used to acquire the trust evaluation result of the routing device corresponding to each node; the trust evaluation result is determined based on the transmission behavior data of the routing device in the historical transmission process; A selection module is used to select, in each iteration, the relay node with the minimum path cost from the candidate nodes based on the path cost between at least one candidate node that did not participate in path planning and the root node in the topology; the path cost is used to characterize the link bandwidth between the corresponding nodes. The first determining module is used to determine at least one neighbor node corresponding to the transit node that has not participated in the path planning; The update module is used to update the path cost between the neighbor node and the relay node for each neighbor node, based on the path cost between the neighbor node and the relay node, the trust evaluation result of the routing device corresponding to the neighbor node, and the path cost between the relay node and the root node. The neighbor node is then used as a candidate node in the next iteration process, and the process continues until the relay node has no neighbor nodes that are not involved in path planning. In the first iteration, the path cost between at least one candidate node that is not involved in path planning and the root node in the topology is preset. The second determining module is used to determine the communication path between each routing device in the target communication network based on each relay node and the root node.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 6.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 6.

Images