Assessment method, device and equipment of key bearing point in network communication and medium

Abstract

The invention relates to the technical field of Internet communication, and discloses a method, a device and equipment for evaluating a key bearing point in network communication and a medium, and the method comprises the steps: obtaining k target shortest paths between a starting routing node and a target routing node for information transmission; wherein the starting routing node and the target routing node are routing nodes of a target communication network; for each target routing node in the target communication network, calculating a score of the target routing node based on the cost of the k target shortest paths and the cost of the target shortest path including the target routing node; and selecting one or more key bearing points from the target routing node based on the score. According to the invention, the identification accuracy of the key bearing point in network communication is improved.

Description

Technical Field

[0001] The present invention relates to the field of Internet communication technology, and in particular to a method, device, equipment and medium for evaluating key bearing points in network communications. Background Art

[0002] At present, the Internet is constantly developing, and complex networks have non-homogeneous topological structures, which determines that each transmission node in the network cannot have exactly the same degree of importance. At the same time, since network information transmission is one of the important basic functions in today's Internet network communication, and network key bearer points play a key role in network information transmission, the failure or interruption of key bearer points may have a significant impact on the entire network. By evaluating key bearer points, we can understand which nodes in the network are critical to the operation and performance of network communications. Therefore, the evaluation method of appropriate network key bearer points can be fully utilized when optimizing network quality. By implementing corresponding optimization and improvement strategies for network bearer points, the stability of network transmission can be guaranteed. However, the key bearer point evaluation algorithm in the relevant technology has low accuracy in identifying key bearer points in network communications. Summary of the invention

[0003] In view of this, the present invention provides a method, device, equipment and medium for evaluating key bearing points in network communications to solve the problem of low accuracy in identifying key bearing points in network communications.

[0004] In a first aspect, the present invention provides a method for evaluating a key bearing point in network communication, the method comprising:

[0005] Acquire k target shortest paths between a starting routing node and a target routing node for information transmission; wherein the starting routing node and the target routing node are routing nodes of a target communication network;

[0006] For each target routing node in the target communication network, respectively, based on the cost of the k target shortest paths and the cost of the target shortest path including the target routing node, calculate the score of the target routing node;

[0007] Based on the scores, one or more key bearer points are selected from the target routing nodes.

[0008] In an optional implementation, the step of acquiring k target shortest paths between an information transmission start routing node and a target routing node includes:

[0009] Acquire a first shortest path between the starting routing node and the target routing node, where the first shortest path is the shortest path between the starting routing node and the target routing node;

[0010] Logically deleting the edges in the first shortest path in sequence;

[0011] After logically deleting an edge in the first shortest path each time, obtaining a second shortest path between the starting routing node and the target routing node;

[0012] The k target shortest paths are determined based on the first shortest path and the second shortest path.

[0013] In an optional implementation, determining the k target shortest paths based on the first shortest path and the second shortest path includes:

[0014] The first k-1 second shortest paths obtained are determined together with the first shortest paths as the k target shortest paths.

[0015] In an optional implementation, determining the k target shortest paths based on the first shortest path and the second shortest path includes:

[0016] The k paths with the smallest costs among the first shortest paths and the second shortest paths are determined as the k target shortest paths.

[0017] In an optional implementation, for each target routing node in the target communication network, the score of the target routing node is calculated based on the cost of the k target shortest paths and the cost of the target shortest path including the target routing node, including:

[0018] Calculate the weight values ​​based on the cost of the k shortest paths to the targets respectively;

[0019] Calculate the sum of the weight values ​​corresponding to the k target shortest paths;

[0020] Calculating a sum of weight values ​​corresponding to the target shortest path including the target routing node;

[0021] The score of the target routing node is determined based on the sum of the weight values ​​and the total of the weight values.

[0022] In an optional implementation, the weight value corresponding to the target shortest path is the inverse of the cost of the target shortest path.

[0023] In a second aspect, the present invention provides a device for evaluating a key bearing point in network communication, the device comprising:

[0024] An acquisition module, used to acquire k target shortest paths between a starting routing node and a target routing node for information transmission; wherein the starting routing node and the target routing node are routing nodes of a target communication network;

[0025] A calculation module, configured to calculate, for each target routing node in the target communication network, a score of the target routing node based on the cost of the k target shortest paths and the cost of the target shortest path including the target routing node;

[0026] A selection module is used to select one or more key bearing points from the target routing node based on the score.

[0027] In a third aspect, the present invention provides a computer device, comprising: a memory and a processor, the memory and the processor being communicatively connected to each other, the memory storing computer instructions, and the processor executing the method for evaluating key bearing points in network communications of the first aspect or any corresponding embodiment thereof by executing the computer instructions.

[0028] In a fourth aspect, the present invention provides a computer-readable storage medium having computer instructions stored thereon, the computer instructions being used to enable a computer to execute the method for evaluating key bearing points in network communications according to the first aspect or any corresponding embodiment thereof.

[0029] In a fifth aspect, the present invention provides a computer program product, comprising computer instructions for causing a computer to execute the method for evaluating key bearing points in network communications according to the first aspect or any corresponding embodiment thereof.

[0030] The method, apparatus, device and medium for evaluating key bearer points in network communications provided in this embodiment take the first k shortest paths into consideration when evaluating and determining the key bearer points between the starting routing node and the target routing node of information transmission, that is, the first k shortest paths are used to load balance the information forwarding traffic, thereby improving the targetedness of the network bearer point evaluation and thus improving the accuracy of identifying key bearer points in network communications. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] In order to more clearly illustrate the specific embodiments of the present invention or the technical solutions in the related technologies, the drawings required for use in the specific embodiments or the related technical descriptions will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0032] Figure 1is a flow chart of a method for evaluating key bearer points in network communications according to an embodiment of the present invention;

[0033] Figure 2 is a schematic diagram of a process for acquiring k shortest paths to targets according to an embodiment of the present invention;

[0034] Figure 3 is a schematic diagram of k shortest paths to targets according to an embodiment of the present invention;

[0035] Figure 4 is a structural block diagram of a device for evaluating a key bearing point in network communication according to an embodiment of the present invention;

[0036] Figure 5 It is a schematic diagram of the hardware structure of a computer device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0037] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution 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 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 those skilled in the art without creative work are within the scope of protection of the present invention.

[0038] Network communication: Network communication refers to connecting multiple computers and their external devices with different geographical locations and independent functions through communication lines, realizing resource sharing and information transmission under the management and coordination of operating systems, management software and communication protocols.

[0039] Key bearing point: In the process of network information transmission, the routing node that bears the task of information forwarding to a great extent is called a key bearing point.

[0040] The key bearer point evaluation method in the related art only considers the evaluation of the entire network, and does not consider that the first k shortest paths can be used to load balance the information forwarding traffic to improve the pertinence of the network bearer point evaluation, which makes the existing evaluation algorithm inaccurate in identifying key bearer points in network communication. In the embodiment of the present invention, the cost of the first k shortest paths (also called consumption cost) is integrated and incorporated into the evaluation calculation method to obtain more accurate and targeted key bearer points.

[0041] According to an embodiment of the present invention, an embodiment of a method for evaluating key bearing points in network communications 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 executable computer 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.

[0042] In this embodiment, a method for evaluating key bearing points in network communication is provided, which can be used for a computer device, and the computer device can be a computer device in a communication network system. Figure 1 is a flow chart of a method for evaluating key bearer points in network communication according to an embodiment of the present invention. Figure 1 As shown, the process includes the following steps:

[0043] Step S101, obtaining k target shortest paths between a starting routing node (which may be referred to as a starting point, a source point, a source routing node, or a sending end) and a target routing node (which may be referred to as a target point, or a receiving end) of information transmission. The starting routing node and the target routing node are routing nodes of a target communication network; k is an integer greater than 1. The specific value of k can be determined according to actual needs.

[0044] In some optional specific implementations, step S101, i.e., obtaining k target shortest paths between the information transmission starting routing node and the target routing node, includes:

[0045] Step S1011, obtaining a first shortest path P1 between the starting routing node and the target routing node, wherein the first shortest path is the shortest path between the starting routing node and the target routing node. The first shortest path can be determined according to the Dijkstra algorithm. After obtaining the first shortest path P1, the first shortest path P1 is saved.

[0046] Step S1012: logically delete the edges in the first shortest path in sequence.

[0047] Step S1013, after logically deleting an edge in the first shortest path each time, obtain the second shortest path between the starting routing node and the target routing node. The second shortest path can also be determined according to the Dijkstra algorithm, and after the second shortest path is obtained, it is saved.

[0048] Step S1014: determining the k target shortest paths based on the first shortest path and the second shortest path.

[0049] In an optional specific implementation manner, step S1014, i.e., determining the k target shortest paths based on the first shortest path and the second shortest path, includes:

[0050] The first k-1 second shortest paths obtained are determined together with the first shortest paths as the k target shortest paths.

[0051] In the embodiment of the present invention, after obtaining k-1 of the second shortest paths, even if there are edges in the first shortest path that have not been logically deleted, the remaining edges will not be logically deleted, and of course other second shortest paths will not be obtained. This is a time priority strategy that can improve the evaluation efficiency of key bearing points.

[0052] In another optional specific implementation, step S1014, i.e., determining the k target shortest paths based on the first shortest path and the second shortest path, includes:

[0053] The k paths with the smallest costs among the first shortest paths and the second shortest paths are determined as the k target shortest paths.

[0054] The embodiment of the present invention adopts a cost-first strategy. Even if k-1 second shortest paths have been obtained, the calculation continues until all edges of the first shortest path are logically deleted in sequence and the corresponding second shortest paths are obtained. Finally, the first shortest path and all second shortest paths are sorted from high to low in cost, and the top k with the lowest cost are selected as the target shortest paths.

[0055] like Figure 2 As shown in the figure, given that the starting routing node is router 7 and the target routing node is router 5, according to Dijkstra, the current shortest path (i.e., the first shortest path) can be calculated as: from router 7, it costs 4 to reach router 4, then from router 4, it costs 5 to reach router 2, and finally from router 2, it costs 2 to reach router 5, and the total cost is 11. Then, all the edges involved in this shortest path (i.e., the first shortest path) are logically deleted (also called disabled), as shown in the figure. Figure 2 First, logically delete the edge with a cost of 4 from router 7 to router 4, and then calculate the shortest path at this time (i.e., the second shortest path) according to Dijkstra: from router 7, it costs 3 to reach router 6, then from router 6, it costs 2 to reach router 4, then from router 4, it costs 5 to reach router 2, and finally from router 2, it costs 2 to reach router 5, and the total cost is 12. Then logically delete the edge with a cost of 5 between router 4 and router 2, and execute Dijkstra's algorithm to see if there is a shortest path in this case (i.e., the second shortest path), until all edges are disabled, or choose to return directly when the shortest path k (including the first shortest path and the second shortest path) is reached. If k=3, then the three target shortest paths finally determined are as follows: Figure 3 shown.

[0056] Step S102, for each target routing node in the target communication network, a score of the target routing node is calculated based on the cost of the k target shortest paths and the cost of the target shortest path including the target routing node.

[0057] Specifically, if none of the k target shortest paths includes (ie, does not pass through) a target routing node, then the score of the target routing node is 0.

[0058] In some optional specific implementations, step S102, i.e., for each target routing node in the target communication network, calculating the score of the target routing node based on the cost of the k target shortest paths and the cost of the target shortest path including the target routing node, includes:

[0059] Step S1021, calculating weight values ​​based on the cost of the k target shortest paths respectively;

[0060] Step S1022, calculating the sum of the weight values ​​corresponding to the k target shortest paths;

[0061] Step S1023, calculating the sum of weight values ​​corresponding to the target shortest path including the target routing node;

[0062] Step S1024: Determine the score of the target routing node based on the sum of the weight values ​​and the total of the weight values. Specifically, the score may be obtained by dividing the sum of the weight values ​​by the total of the weight values.

[0063] The weight value corresponding to the target shortest path is the inverse of the cost of the target shortest path.

[0064] like Figure 3 The three shortest paths to the target are shown in Figure 1. The costs of the three shortest paths to the target are 11, 12, and 17 respectively, so the sum of the corresponding weight values ​​is If the score of router 4 as a key bearing point needs to be calculated, first determine that the target shortest paths with costs 11 and 12 pass through router 4, so the sum of the weight values ​​corresponding to the target shortest paths including router 4 is Then Divide by The score of router 4 is approximately 0.75.

[0065] In some other optional specific implementations, the score of the target routing node may be directly calculated according to the following formula:

[0066]

[0067] Among them, score i is the score of the i-th target routing node, weight n The weight value corresponding to the shortest path to the nth target, bool n Indicates whether the nth target shortest path contains the i-th target routing node. If so, bool n The value is 1, otherwise bool n The value of is 0. Score i Between 0 and 1, the closer the distance to 1 is, the greater the possibility that the i-th target routing node is a key bearing point.

[0068] In an embodiment of the present invention, the cost of the first k shortest paths (also referred to as consumption cost) is measured by a weight value and incorporated into the evaluation and calculation method of the key bearing point. Specifically, paths of different lengths represent different weight values. By measuring the corresponding weight values, the key bearing point score after comprehensive consideration can be obtained.

[0069] Step S103, based on the score, one or more key bearer points are selected from the target routing nodes. Specifically, the target routing node with the highest score can be selected as the key bearer point, or the target routing node with a score greater than a preset threshold can be selected as the key bearer point.

[0070] The evaluation method of key bearer points in network communication provided in this embodiment takes into account the cost of the first k shortest paths when evaluating and determining the key bearer points between the starting routing node and the target routing node of information transmission, that is, the first k shortest paths are used to load balance the information forwarding traffic. Compared with methods such as degree centrality (degree of node), closeness centrality (average shortest path length from node to other nodes), betweenness centrality (number of shortest paths transmitted by a node through it) and eigenvector centrality (degree of contribution of a node to the network), this evaluation method does not consider the key bearer points in the entire network, but considers the key bearer points in combination with the information between two routing nodes, which improves the pertinence of network bearer point evaluation, thereby improving the accuracy of identifying key bearer points in network communication, and further improving the utilization rate of network resources.

[0071] The evaluation method of key bearer points in network communications provided in this embodiment is applicable to routing path selection within an autonomous system. After calculating the first k shortest paths, if it is found that a certain routing node is an intermediate node with a high frequency, it means that the traffic carried by the routing node between the starting routing node and the target routing node may be large, indicating that the node may be a bottleneck node in the network, which has an important impact on network performance and efficiency. By identifying bottleneck nodes, corresponding measures can be taken, including network design and optimization, providing more resources to key nodes, etc., to optimize the transmission capacity and reliability of the network and improve the transmission stability between two points.

[0072] The key bearing points obtained by the evaluation method provided by the embodiment of the present invention can be fully utilized in the network optimization stage. In the optimization process, by adopting methods such as enhancing the relevant configuration of key bearing points or adding additional network transmission lines, the possibility of network instability is reduced and the user experience is improved. In addition, key bearing points in network communications may become targets of network attacks, so evaluating key bearing points can help discover potential security vulnerabilities and risks, and adopt corresponding defense strategies to enhance the security of the network. Therefore, when using the network for data transmission, users no longer need to worry too much about the problem of data loss caused by routing failures, which further improves the user experience.

[0073] In this embodiment, a device for evaluating key bearing points in network communication is also provided, which is used to implement the above-mentioned embodiments and preferred implementation modes, and the descriptions that have been made will not be repeated. As used below, the term "module" can implement a combination of software and / or hardware of a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.

[0074] This embodiment provides an evaluation device for key bearing points in network communication, such as Figure 4 As shown, including:

[0075] An acquisition module 401 is used to acquire k target shortest paths between a starting routing node and a target routing node for information transmission;

[0076] A calculation module 402, configured to calculate, for each target routing node in the target communication network, a score of the target routing node based on the cost of the k target shortest paths and the cost of the target shortest path including the target routing node;

[0077] The selection module 403 is configured to select one or more key bearer points from the target routing node based on the score.

[0078] In some optional implementations, the acquisition module 401 includes:

[0079] A first shortest path acquisition unit, configured to acquire a first shortest path between the start routing node and the target routing node, wherein the first shortest path is the shortest path between the start routing node and the target routing node;

[0080] A logical deletion unit, used for logically deleting the edges in the first shortest path in sequence;

[0081] A second shortest path acquisition unit, configured to acquire a second shortest path between the starting routing node and the target routing node after logically deleting an edge in the first shortest path each time;

[0082] A target shortest path determining unit is used to determine the k target shortest paths based on the first shortest path and the second shortest path.

[0083] In some optional implementations, the target shortest path determining unit is configured to determine the firstly acquired k-1 second shortest paths and the first shortest path as the k target shortest paths.

[0084] In some optional implementations, the target shortest path determining unit is configured to determine k paths with the smallest costs among the first shortest path and the second shortest path as the k target shortest paths.

[0085] In some optional implementations, the calculation module 402 includes:

[0086] A weight value calculation unit, used for calculating the weight values ​​based on the cost of the k shortest paths to the target;

[0087] A sum calculation unit, used to calculate the sum of the weight values ​​corresponding to the k target shortest paths;

[0088] A sum calculation unit, used to calculate the sum of weight values ​​corresponding to the target shortest path including the target routing node;

[0089] A score determination unit is used to determine the score of the target routing node based on the sum of the weight values ​​and the total of the weight values.

[0090] The further functional description of each of the above modules and units is the same as that of the above corresponding embodiments and will not be repeated here.

[0091] In this embodiment, the evaluation device of the key bearing point in the network communication is presented in the form of a functional unit, where the unit refers to an ASIC (Application Specific Integrated Circuit) circuit, a processor and memory that executes one or more software or fixed programs, and / or other devices that can provide the above functions.

[0092] The embodiment of the present invention also provides a computer device having the above Figure 4 The evaluation device of the key bearing point in the network communication is shown.

[0093] See also Figure 5 , Figure 5 is a schematic diagram of the structure of a computer device provided by an optional embodiment of the present invention, such as Figure 5 As shown, the computer device can be used as a communication network device, which includes: one or more processors 10, a memory 20, and an interface for connecting various components, including a high-speed interface and a low-speed interface. Each component utilizes different buses to communicate with each other, and can be installed on a common mainboard or installed in other ways as needed. The processor can process the instructions executed in the computer device, including instructions stored in or on the memory to display the graphical information of the GUI on an external input / output device (such as, a display device coupled to the interface). In some optional embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories and multiple memories. Similarly, multiple computer devices can be connected, and each device provides part of the necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Figure 5 A processor 10 is taken as an example.

[0094] The processor 10 may be a central processing unit, a network processor or a combination thereof. The processor 10 may further include a hardware chip. The hardware chip may be a dedicated integrated circuit, a programmable logic device or a combination thereof. The programmable logic device may be a complex programmable logic device, a field programmable gate array, a general purpose array logic or any combination thereof.

[0095] The memory 20 stores instructions executable by at least one processor 10, so that the at least one processor 10 executes the method shown in the above embodiment.

[0096] The memory 20 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the computer device, etc. In addition, the memory 20 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some optional embodiments, the memory 20 may optionally include a memory remotely arranged relative to the processor 10, and these remote memories may be connected to the computer device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0097] The memory 20 may include a volatile memory, such as a random access memory; the memory may also include a non-volatile memory, such as a flash memory, a hard disk or a solid state drive; the memory 20 may also include a combination of the above types of memory.

[0098] The computer device also includes a communication interface, which is used for the computer device to communicate with other devices or a communication network.

[0099] The embodiment of the present invention also provides a computer-readable storage medium. The method according to the embodiment of the present invention can be implemented in hardware, firmware, or can be implemented as a computer code that can be recorded in a storage medium, or can be implemented as a computer code that is originally stored in a remote storage medium or a non-temporary machine-readable storage medium and will be stored in a local storage medium through a network download, so that the method described herein can be stored in such software processing on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. Among them, the storage medium can be a magnetic disk, an optical disk, a read-only storage memory, a random access memory, a flash memory, a hard disk or a solid-state hard disk, etc.; further, the storage medium can also include a combination of the above types of memories. It can be understood that a computer, a processor, a microprocessor controller, or programmable hardware includes a storage component that can store or receive software or computer code. When the software or computer code is accessed and executed by a computer, a processor, or hardware, the method shown in the above embodiment is implemented.

[0100] A part of the present invention may be applied as a computer program product, such as a computer program instruction, which, when executed by a computer, can call or provide the method and / or technical solution according to the present invention through the operation of the computer. Those skilled in the art should understand that the existence of the computer program instruction in a computer-readable medium includes, but is not limited to, a source file, an executable file, an installation package file, etc., and accordingly, the way in which the computer program instruction is executed by the computer includes, but is not limited to: the computer directly executes the instruction, or the computer compiles the instruction and then executes the corresponding compiled program, or the computer reads and executes the instruction, or the computer reads and installs the instruction and then executes the corresponding installed program. Here, the computer-readable medium may be any available computer-readable storage medium or communication medium accessible to the computer.

[0101] Although the embodiments of the present invention have been described in conjunction with the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present invention, and such modifications and variations are all within the scope defined by the appended claims.

Claims

1. A method for evaluating key bearing points in network communication, characterized in that: The method comprises: Acquire k target shortest paths between a starting routing node and a target routing node for information transmission; wherein the starting routing node and the target routing node are routing nodes of a target communication network; For each target routing node in the target communication network, respectively, based on the cost of the k target shortest paths and the cost of the target shortest path including the target routing node, calculate the score of the target routing node; Based on the scores, one or more key bearer points are selected from the target routing nodes.

2. The method according to claim 1, characterized in that The step of obtaining k target shortest paths between the information transmission starting routing node and the target routing node comprises: Acquire a first shortest path between the starting routing node and the target routing node, where the first shortest path is the shortest path between the starting routing node and the target routing node; Logically deleting the edges in the first shortest path in sequence; After logically deleting an edge in the first shortest path each time, obtaining a second shortest path between the starting routing node and the target routing node; The k target shortest paths are determined based on the first shortest path and the second shortest path.

3. The method according to claim 2, characterized in that The determining the k target shortest paths based on the first shortest path and the second shortest path includes: The first k-1 second shortest paths obtained are determined together with the first shortest paths as the k target shortest paths.

4. The method according to claim 2, characterized in that: The determining the k target shortest paths based on the first shortest path and the second shortest path includes: The k paths with the smallest costs among the first shortest paths and the second shortest paths are determined as the k target shortest paths.

5. The method according to claim 1, characterized in that The step of calculating the score of each target routing node in the target communication network based on the cost of the k target shortest paths and the cost of the target shortest path including the target routing node comprises: Calculate the weight values ​​based on the cost of the k shortest paths to the targets respectively; Calculate the sum of the weight values ​​corresponding to the k target shortest paths; Calculating a sum of weight values ​​corresponding to the target shortest path including the target routing node; The score of the target routing node is determined based on the sum of the weight values ​​and the total of the weight values.

6. The method according to claim 5, characterized in that The weight value corresponding to the target shortest path is the inverse of the cost of the target shortest path.

7. A device for evaluating key bearing points in network communication, characterized in that: The device comprises: An acquisition module, used to acquire k target shortest paths between a starting routing node and a target routing node for information transmission; wherein the starting routing node and the target routing node are routing nodes of a target communication network; A calculation module, configured to calculate, for each target routing node in the target communication network, a score of the target routing node based on the cost of the k target shortest paths and the cost of the target shortest path including the target routing node; A selection module is used to select one or more key bearing points from the target routing node based on the score.

8. A computer device, characterized in that: include: A memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the method for evaluating key bearing points in network communications according to any one of claims 1 to 6 by executing the computer instructions.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a computer to execute the method for evaluating key bearing points in network communication according to any one of claims 1 to 6.

10. A computer program product, characterized in that The method comprises computer instructions, wherein the computer instructions are used to enable a computer to execute the method for evaluating key bearing points in network communication according to any one of claims 1 to 6.

Images