Method, device and equipment for evaluating key bearing point in network communication and medium

Abstract

The application relates to the technical field of Internet communication, and discloses a method, device, equipment and medium for evaluating key bearing points in network communication, the method comprising the following steps: acquiring k target shortest paths between a starting routing node and a target routing node of 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, 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 containing the target routing node; and one or more key bearing points are selected from the target routing nodes based on the scores. The application improves the identification accuracy of key bearing points in network communication.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of Internet communication, and in particular to a method and device for evaluating key bearing points in network communication, and a medium. BACKGROUND

[0002] At present, the Internet is developing continuously, and a complex network has a non-homogeneous topological structure, which determines that each transmission node in the network cannot have the same importance. Meanwhile, network information transmission is one of the important basic functions in current Internet network communication, and a key bearing point plays a key role in network information transmission. The failure or interruption of a key bearing point can have a significant impact on the entire network. By evaluating the key bearing point, it can be understood which nodes in the network are crucial to the operation and performance of network communication. Therefore, a suitable evaluation method for the network key bearing point can be fully utilized in network quality optimization. By implementing appropriate optimization and improvement strategies for the network bearing point, the stability of network transmission can be ensured. However, the key bearing point evaluation algorithm in the related art has low accuracy in identifying key bearing points in network communication. SUMMARY

[0003] Therefore, the present application provides a method and device for evaluating key bearing points in network communication, and a medium, to solve the problem of low accuracy in identifying key bearing points in network communication.

[0004] In a first aspect, the present application provides a method for evaluating key bearing points in network communication, which comprises:

[0005] obtaining k target shortest paths between a starting routing node and a target routing node of 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, 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 containing the target routing node, respectively;

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

[0008] In an optional embodiment, the k target shortest paths between the starting routing node and the target routing node of information transmission are obtained, which comprises:

[0009] obtaining a first shortest path between the starting routing node and the target routing node, the first shortest path being the shortest path between the starting routing node and the target routing node;

[0010] logically deleting edges in the first shortest path one by one;

[0011] after logically deleting each edge in the first shortest path, obtaining a second shortest path between the start routing node and the target routing node;

[0012] determining the k target shortest paths based on the first shortest path and the second shortest path.

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

[0014] determining the k target shortest paths as the first shortest path and the k-1 second shortest paths obtained first.

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

[0016] determining the k target shortest paths as the k paths with the smallest cost in the first shortest path and the second shortest path.

[0017] In an optional implementation, the 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 paths containing the target routing node for each target routing node in the target communication network comprises:

[0018] calculating a weight value based on the cost of the k target shortest paths respectively;

[0019] calculating a sum of the weight values corresponding to the k target shortest paths;

[0020] calculating a sum value of the weight values corresponding to the target shortest paths containing the target routing node;

[0021] determining the score of the target routing node based on the sum value of the weight values and the sum of the weight values.

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

[0023] In a second aspect, the present application provides an evaluation device for key bearing points in network communication, the device comprising:

[0024] The acquisition module is configured to acquire k target shortest paths between a starting routing node and a target routing node of information transmission, wherein the starting routing node and the target routing node are routing nodes of a target communication network.

[0025] The calculation module is configured to calculate, for each target routing node in the target communication network, a score of the target routing node based on a cost of the k target shortest paths and a cost of the target shortest paths containing the target routing node, respectively.

[0026] The selection module is configured to select one or more key bearing points from the target routing nodes based on the scores.

[0027] In a third aspect, the present application provides a computer device, comprising a memory and a processor, which are communicatively connected with each other, and the memory stores computer instructions, and the processor executes the computer instructions to perform the network communication key bearing point evaluation method of the first aspect or any of the corresponding embodiments.

[0028] In a fourth aspect, the present application provides a computer readable storage medium, which stores computer instructions, and the computer instructions are used to make a computer execute the network communication key bearing point evaluation method of the first aspect or any of the corresponding embodiments.

[0029] In a fifth aspect, the present application provides a computer program product, which comprises computer instructions, and the computer instructions are used to make a computer execute the network communication key bearing point evaluation method of the first aspect or any of the corresponding embodiments.

[0030] The network communication key bearing point evaluation method, device, equipment and medium provided by the embodiment consider the first k shortest paths when evaluating and determining the key bearing points between the starting routing node and the target routing node of information transmission, that is, the first k shortest paths are used for load balancing of information forwarding traffic, the network bearing point evaluation is improved in pertinence, and thus the accuracy of identifying the key bearing points in network communication is improved. BRIEF DESCRIPTION OF DRAWINGS

[0031] In order to more clearly illustrate the technical solutions in the specific embodiments or related art, the following will briefly introduce the drawings needed to be used in the specific embodiments or related art description. Obviously, the drawings in the following description are some embodiments of the present application, and those skilled in the art can obtain other drawings according to these drawings without creative labor.

[0032] Figure 1is a flowchart of a method for evaluating a key bearing point in network communication according to an embodiment of the present application;

[0033] Figure 2 is a schematic diagram of a process for obtaining k target shortest paths according to an embodiment of the present application;

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

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

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

[0037] In order to make the objects, technical solutions and advantages of embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are some but not all of the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by a person of ordinary skill in the art without creative work fall within the protection scope of the present application.

[0038] Network communication: network communication refers to connecting multiple computers and their external devices with different geographical positions and independent functions through a communication line, realizing resource sharing and information transmission under the management and coordination of an operating system, management software and a communication protocol.

[0039] Key bearing point: in the process of network information transmission, a routing node that greatly undertakes the task of information forwarding is referred to as a key bearing point.

[0040] The key bearing point evaluation method in the related art only considers evaluating the overall network and does not consider load balancing of information forwarding traffic by using the first k shortest paths, improving the pertinence of network bearing point evaluation, so that the existing evaluation algorithm has insufficient accuracy in identifying the key bearing point in network communication. In the embodiments of the present application, the cost (also referred to as consumption cost) of the first k shortest paths is integrated into the evaluation calculation method, and a key bearing point with higher accuracy and pertinence is obtained.

[0041] According to the embodiment of the present application, a method for evaluating a key bearing point in network communication is provided. It should be noted that the steps shown in the flowchart can be executed in a computer system such as a set of executable computer instructions, and although the 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 the present embodiment, a method for evaluating a key bearing point in network communication is provided, which can be used in a computer device, and the computer device can be a computer device in a communication network system, Figure 1 The flowchart of the method for evaluating a key bearing point in network communication according to the embodiment of the present application is shown in FIG. 1, which includes the following steps: Figure 1

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

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

[0045] In step S1011, a first shortest path P1 between the starting routing node and the target routing node is obtained, and 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 the first shortest path P1 is obtained, the first shortest path P1 is saved.

[0046] In step S1012, the edges in the first shortest path are sequentially logically deleted.

[0047] In step S1013, after each edge in the first shortest path is logically deleted, a second shortest path between the starting routing node and the target routing node is obtained. 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] In step S1014, the k target shortest paths are determined based on the first shortest path and the second shortest path.

[0049] In an optional embodiment, 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 as the k target shortest paths together with the first shortest path.

[0051] In the embodiment of the present application, after obtaining k-1 second shortest paths, even if there are edges in the first shortest path that have not been logically deleted, the remaining edges are no longer logically deleted, and other second shortest paths are also no longer obtained. This is a time-first strategy, which can improve the evaluation efficiency of critical bearing points.

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

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

[0054] In the embodiment of the present application, a cost-first strategy is adopted, i.e., even if k-1 second shortest paths have been obtained, the calculation is still continued until all edges of the first shortest path are logically deleted in turn and corresponding second shortest paths are obtained, and finally the first shortest path and all second shortest paths are sorted from high to low in cost, and the first k paths with the smallest cost are selected as the target shortest paths.

[0055] As shown in Figure 2 , 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) is calculated as: from router 7 to router 4 with a cost of 4, from router 4 to router 2 with a cost of 5, and finally from router 2 to router 5 with a cost of 2, with a total cost of 11, and then all edges involved in this shortest path (i.e., the first shortest path) are logically deleted in turn (which can also be referred to as disabled), as shown in Figure 2 The edge from router 7 to router 4 with a cost of 4 is logically deleted first, and then according to Dijkstra, the shortest path (i.e., the second shortest path) at this time is calculated as: from router 7 to router 6 with a cost of 3, from router 6 to router 4 with a cost of 2, from router 4 to router 2 with a cost of 5, and finally from router 2 to router 5 with a cost of 2, with a total cost of 12. Then the edge between router 4 and router 2 with a cost of 5 is logically deleted, and Dijkstra algorithm is executed to see if there is a shortest path (i.e., a second shortest path) under this condition, until all edges are disabled or k target shortest paths (including the first shortest path and the second shortest path) are selected, and then the return is performed. If k = 3, then the finally determined three target shortest paths are as shown in Figure 3 .

[0056] Step S102: For each target routing node in the target communication network, calculate 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.

[0057] Specifically, if none of the k shortest paths to the target contain (i.e. do not pass through) the target routing node, then the target routing node has a score of 0.

[0058] In some optional implementations, step S102, namely, 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, includes:

[0059] Step S1021: Calculate the weight values ​​based on the cost of the k shortest paths to the target respectively;

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

[0061] Step S1023: Calculate the sum of the weight values ​​corresponding to the shortest path to the target containing 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 sum of the weight values. Specifically, the score can be obtained by dividing the sum of the weight values ​​by the total sum of the weight values.

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

[0064] like Figure 3 The three shortest paths shown have costs of 11, 12, and 17 respectively, therefore the sum of their corresponding weights is... In this case, if it is necessary to calculate the score of router 4 as a key bearer, it is first determined that the shortest paths with costs of 11 and 12 pass through router 4. Therefore, the sum of the weight values ​​corresponding to the shortest paths involving router 4 is... Then Divide by The score obtained for router 4 is approximately 0.75.

[0065] In some alternative implementations, the score of the target routing node can be calculated directly using the following formula:

[0066]

[0067] wherein score i is the score of the i-th target routing node, weight n is the weight value corresponding to the n-th target shortest path, bool n represents whether the i-th target routing node is contained in the n-th target shortest path, if contained, the value of bool n is 1, otherwise the value of bool n is 0. The score score i is between 0 and 1, and the closer to 1, the greater the possibility that the i-th target routing node is a critical bearing point.

[0068] In the embodiment of the present application, the cost (which can also be referred to as consumption cost) of the first k shortest paths is measured by the weight value and is included in the evaluation and calculation method of the critical bearing point. Specifically, different lengths of paths represent different weight values, and by measuring the corresponding weight values, the critical bearing point score after comprehensive consideration can be obtained.

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

[0070] The evaluation method of the critical bearing point in network communication provided in the embodiment considers the cost of the first k shortest paths when evaluating and determining the critical bearing point between the starting routing node and the target routing node of information transmission, that is, the load balancing of information forwarding flow is performed by using the first k shortest paths. Compared with the methods of degree centrality (the degree of the node), closeness centrality (the average shortest path length of the node to other nodes), betweenness centrality (the number of shortest paths passing through the node), and eigenvector centrality (the contribution degree of the node to the network), the evaluation method does not consider the critical bearing point in the entire network, but considers the critical bearing point in combination with information between two routing nodes, improves the pertinence of network bearing point evaluation, and thus improves the accuracy of identifying the critical bearing point in network communication, and further improves the utilization rate of network resources.

[0071] The evaluation method of the key bearing point in network communication provided by the embodiment is suitable for route path selection in an autonomous system. After the first k shortest paths are calculated, if it is found that a routing node is an intermediate node with a high frequency, it indicates that the traffic borne by the routing node between a starting routing node and a target routing node can be large, which indicates that the node can be a bottleneck node in the network and has an important influence on network performance and efficiency. By identifying the bottleneck node, corresponding measures can be taken, including network design and optimization, providing more resources for the key node, etc., to optimize the transmission capacity and reliability of the network and improve the transmission stability between two points.

[0072] The key bearing point obtained by the evaluation method provided by the embodiment of the application can be fully utilized in the network optimization stage. In the optimization process, the possibility of network instability is reduced and the user experience is improved by adopting methods such as enhancing the related configuration of the key bearing point or increasing additional network transmission lines. Moreover, the key bearing point in network communication can become a target of network attacks, so evaluating the key bearing point can help to find potential security vulnerabilities and risks and take corresponding defense strategies to enhance the security of the network. Therefore, when users use the network for data transmission, they no longer need to worry about the problem of data loss caused by routing failure, further improving the user experience.

[0073] In the embodiment, an evaluation device of a key bearing point in network communication is also provided. The device is used to implement the above-mentioned embodiments and preferred embodiments, and details are not repeated. As used below, the term "module" can be a combination of software and / or hardware that implements a predetermined function. Although the device described in the following embodiments is preferably implemented in software, hardware or a combination of software and hardware is also possible and is contemplated.

[0074] The embodiment provides an evaluation device of a key bearing point in network communication, as shown in Figure 4 The device includes:

[0075] The acquisition module 401 is configured to acquire k target shortest paths between a starting routing node and a target routing node in information transmission.

[0076] The calculation module 402 is configured to calculate a score of each target routing node in the target communication network based on a cost of the k target shortest paths and a cost of the target shortest path containing the target routing node.

[0077] The selection module 403 is configured to select one or more key bearing points from the target routing nodes based on the scores.

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

[0079] a first shortest path obtaining unit, configured to obtain a first shortest path between the start routing node and the target routing node, the first shortest path being the shortest path between the start routing node and the target routing node;

[0080] a logical deletion unit, configured to sequentially perform logical deletion on edges in the first shortest path;

[0081] a second shortest path obtaining unit, configured to obtain a second shortest path between the start routing node and the target routing node after logical deletion of each edge in the first shortest path;

[0082] a target shortest path determining unit, configured to determine the k target shortest paths based on the first shortest path and the second shortest path.

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

[0084] In some optional embodiments, the target shortest path determining unit is configured to determine k paths with minimum cost in the first shortest path and the second shortest path as the k target shortest paths.

[0085] In some optional embodiments, the computing module 402 includes:

[0086] a weight value calculating unit, configured to calculate weight values based on costs of the k target shortest paths, respectively;

[0087] a total calculating unit, configured to calculate a total of the weight values corresponding to the k target shortest paths;

[0088] a sum calculating unit, configured to calculate a sum of the weight values corresponding to the target shortest paths containing the target routing node;

[0089] a score determining unit, configured to determine a score of the target routing node based on the sum of the weight values and the total of the weight values.

[0090] Further function descriptions of the above various modules and units are the same as those of the corresponding embodiments, which will not be repeated here.

[0091] The evaluation device of the key bearing point in network communication in the embodiment is presented in the form of functional units, and the units refer to ASIC (Application Specific Integrated Circuit) circuit, processor and memory executing one or more software or fixed program, and / or other devices capable of providing the above functions.

[0092] The embodiment of the application further provides a computer device having the above Figure 4 evaluation device of the key bearing point in network communication.

[0093] Please refer to Figure 5 , Figure 5 is a structural schematic diagram of a computer device provided by an optional embodiment of the application, as Figure 5 shown, the computer device can be used as a communication network device, which comprises 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. Various components are communicatively connected to each other by different buses, and can be installed on a common mainboard or in other ways as needed. The processor can process instructions executed in the computer device, including instructions stored in the memory or on the memory to display graphical information of a GUI on an external input / output device (such as a display device coupled to the interface). In some optional embodiments, multiple processors and / or multiple buses can be used with multiple memories and multiple memories, if necessary. Similarly, multiple computer devices can be connected, each providing part of the necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Figure 5 The processor 10 is taken as an example in the embodiment.

[0094] The processor 10 can be a central processor, a network processor or a combination thereof. The processor 10 can further include a hardware chip. The hardware chip can be an application specific integrated circuit, a programmable logic device or a combination thereof. The programmable logic device can be a complex programmable logic device, a field programmable logic gate array, a general array logic or any combination thereof.

[0095] The memory 20 stores instructions executable by the 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 can include a program storage area and a data storage area. The program storage area can store an operating system, application programs required for at least one function, etc. The data storage area can store data created by the computer device, etc. In addition, the memory 20 can include a high-speed random access memory, and can also include a non-transitory memory such as at least one disk storage device, a flash memory device, or other non-transitory solid state memory device. In some alternative embodiments, the memory 20 can optionally include memory that is remotely located with respect to the processor 10, and which can be connected to the computer device through a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communications network, and combinations thereof.

[0097] The memory 20 can include a volatile memory, such as a random access memory, and can also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-transitory solid state memory device. The memory 20 can also include a combination of the above-mentioned types of memory.

[0098] The computer device also includes a communication interface for communicating with other devices or communication networks.

[0099] The embodiments of the present application also provide a computer readable storage medium, and the above-mentioned method according to the embodiments of the present application can be implemented in hardware, firmware, or recorded in a storage medium, or stored in a remote storage medium or a non-transitory machine readable storage medium and downloaded from a network and stored in a local storage medium, so that the method described herein can be processed by such software on a storage medium using a general purpose computer, a special purpose processor, or programmable or special purpose hardware. The storage medium can be a disk, an optical disk, a read-only memory, a random access memory, a flash memory, a hard disk, or a solid state disk, etc. Further, the storage medium can also include a combination of the above-mentioned types of memory. It can be understood that the computer, the processor, the microprocessor controller, or the 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 the computer, the processor, or the hardware, the method shown in the above embodiments is implemented.

[0100] Part of the present application can be applied as a computer program product, for example, computer program instructions, when executed by a computer, through the operation of the computer, can invoke or provide the method and / or technical solutions according to the present application. Those skilled in the art should understand that the form of computer program instructions in computer readable medium includes but is not limited to source files, executable files, installation package files and the like, and accordingly, the way of computer program instructions executed by computer includes but is not limited to: the computer directly executes the instructions, or the computer compiles the instructions and then executes the corresponding compiled program, or the computer reads and executes the instructions, or the computer reads and installs the instructions and then executes the corresponding installed program. Here, the computer readable medium can be any available computer readable storage medium or communication medium accessible to the computer.

[0101] Although the embodiments of the present application are described in conjunction with the drawings, various modifications and changes can be made by those skilled in the art without departing from the spirit and scope of the present application, and such modifications and changes fall within the scope defined by the appended claims.

Claims

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

2. The method of claim 1, wherein, The obtaining of the k target shortest paths between the starting routing node and the target routing node of information transmission comprises: obtaining a first shortest path between the starting routing node and the target routing node, the first shortest path being the shortest path between the starting routing node and the target routing node; logically deleting 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; determining the k target shortest paths based on the first shortest path and the second shortest paths.

3. The method of claim 2, wherein, The determination of the k target shortest paths based on the first shortest path and the second shortest paths comprises: determining the k target shortest paths based on the first shortest path and the first k-1 second shortest paths obtained earliest.

4. The method of claim 2, wherein, The determination of the k target shortest paths based on the first shortest path and the second shortest paths comprises: determining the k target shortest paths based on the k paths with the smallest cost in the first shortest path and the second shortest paths.

5. The method of claim 1, wherein, The calculation of 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 paths containing the target routing node respectively comprises: calculating a weight value based on the cost of the k target shortest paths respectively; calculating a total sum of the weight values corresponding to the k target shortest paths; calculating a sum value of the weight values corresponding to the target shortest paths containing the target routing node; determining the score of the target routing node based on the sum value of the weight values and the total sum of the weight values.

6. The method of claim 5, wherein, The weight value corresponding to the target shortest path is the reciprocal of the cost of the target shortest path.

7. An evaluation device for critical bearer points in network communication, characterized in that, The apparatus comprises: an obtaining module configured to obtain k target shortest paths between a starting routing node and a target routing node of information transmission; wherein the starting routing node and the target routing node are routing nodes of a target communication network; a calculating module configured to calculate a score of each target routing node in the target communication network based on a cost of the k target shortest paths and a cost of the target shortest paths containing the target routing node respectively; a selecting module configured to select one or more key bearing points from the target routing nodes based on the scores.

8. A computer device, comprising: The apparatus comprises: A memory and a processor, which are connected in communication with each other, the memory storing computer instructions, and the processor executing the computer instructions to perform the method for evaluating a critical point of a network communication according to any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that, The computer readable storage medium stores computer instructions for causing a computer to perform the method for evaluating a critical point of a network communication according to any one of claims 1 to 6.

10. A computer program product, characterised in that, The computer readable storage medium stores computer instructions for causing a computer to perform the method for evaluating a critical point of a network communication according to any one of claims 1 to 6.

Images