Method and apparatus for evaluating application services, and electronic device

Abstract

The application discloses an application service evaluation method and device and electronic equipment. The method comprises the following steps: determining a plurality of objects that have accessed a target address port of a target application within a preset time range, and obtaining connection information of a communication protocol connection created by each object within the preset time range; generating a sub-directed graph based on the connection information associated with each object respectively, and constructing a target directed graph according to the sub-directed graphs of the objects; screening a plurality of first address ports belonging to the target application from the destination address ports contained in the target directed graph; calculating a target score of each first address port of the target application based on the target directed graph, and determining the importance of the service provided by each first address port according to the target score of each first address port. The application solves the technical problem of low accuracy of the importance evaluation of various services in the related art.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of Internet, in particular to an application service evaluation method and device and electronic equipment. BACKGROUND

[0002] Currently, in the field of network performance monitoring, there are methods such as ICMP (Inter Control Message Protocol) Ping, TCP (Transmission Control Protocol) Ping active detection, web homepage loading delay, and tunnel UDP (User Datagram Protocol) packet transmission and reception active test, which can measure the detection of the quality of service in the application to a certain extent. However, these methods cannot reflect the importance difference between different services in the application, so it is difficult to effectively control the overall quality of the application according to the detection results of these methods. In related technologies, if the importance of various services in the application is to be evaluated, only manual judgment can be used, which has the problem of low evaluation accuracy.

[0003] At present, no effective solution has been proposed for the above problems. SUMMARY

[0004] The embodiments of the present application provide an application service evaluation method, device and electronic equipment to at least solve the technical problem of low accuracy of evaluating the importance of various services in the application in related technologies.

[0005] According to an aspect of the embodiments of the present application, an application service evaluation method is provided, comprising: determining a plurality of objects that have accessed a target address port of a target application within a preset time range, and obtaining connection information of a communication protocol connection created by each object within the preset time range, wherein the connection information refers to the connection information between the source address port and the destination address port, the source address port is the address port of the terminal where the object is located, and the plurality of destination address ports at least includes the target address port; generating a sub-directed graph based on the connection information associated with each object, and constructing a target directed graph according to the sub-directed graphs of each object, wherein the target directed graph is composed of a plurality of nodes and directed edges connected between the nodes, one node represents one destination address port, and the directed edge represents the jump of the object from one destination address port to another destination address port; screening a plurality of first address ports belonging to the target application from the destination address ports contained in the target directed graph; calculating the target score of each first address port of the target application based on the target directed graph, and determining the importance of the service provided by the first address port according to the target score of each first address port.

[0006] Further, the application service evaluation method further comprises: determining, for each object, a start destination address port and an end destination address port of the directed jump of the current object within the target time range according to the connection information associated with the current object, to obtain a plurality of second address ports; determining a probability of the directed jump of the current object between any two second address ports within the target time range according to the connection information associated with the current object; taking each second address port connected by the current object as a node, taking the directed jump between any two second address ports within the target time range as a directed edge, and taking the probability of the directed jump between any two second address ports within the target time range as an attribute value of the directed edge, to construct a sub-directed graph of the current object.

[0007] Further, the application service evaluation method further comprises: determining a connection creation time of each communication protocol connection created by the current object according to the connection information associated with the current object; screening, from the connection information associated with the current object, connection information with a target address port and the earliest connection creation time, to obtain first connection information; screening, from all the connection information associated with the current object, connection information with a connection creation time later than the connection creation time of the first connection information, to obtain at least one second connection information; determining a start destination address port and an end destination address port of the directed jump of the current object within the target time range according to the first connection information and the at least one second connection information, to obtain a plurality of second address ports.

[0008] Further, the application service evaluation method further comprises: determining, based on the connection information associated with each object, a number of jumps between the second address ports connected by the object within the target time range; determining, based on the number of jumps of each object, a weight value of the activity level of the object; constructing a first matrix based on the attribute values of the directed edges between the nodes in each sub-directed graph, wherein the elements in the first matrix are the attribute values of the directed edges; calculating a second matrix based on the weight value of each object and the first matrix associated with each object, and constructing a target directed graph according to the element values in the second matrix.

[0009] Further, the application service evaluation method further comprises: determining a target matrix dimension based on the nodes in the sub-directed graph associated with each object; comparing the dimensions of the first matrix associated with each object with the target matrix dimension, and determining whether there is at least one third matrix based on the comparison result, wherein the third matrix is a first matrix with a different dimension from the target matrix dimension; in the case where there is at least one third matrix, respectively expanding the dimension of each third matrix to be the same as the target matrix dimension to obtain an expanded third matrix; calculating the second matrix based on the weight value corresponding to each object and the matrix associated with each object with the dimension being the target matrix dimension.

[0010] Further, the application service evaluation method further comprises: determining the distance between any two nodes in the target directed graph based on the attribute value of the directed edge in the target directed graph; taking the node corresponding to the target address port as a core node, clustering the nodes in the target directed graph according to the distance between the core node and the nodes other than the core node in the target directed graph, and obtaining a target cluster; and determining the destination address port represented by the node contained in the target cluster as the first address port.

[0011] Further, the application service evaluation method further comprises: setting an initial score for each first address port; recalculating the score of each first address port based on the initial score of each first address port, the attribute value of the directed edge in the target directed graph, and the number of first address ports, until the difference between the current score and the score calculated last time is less than a preset threshold, and determining the current score of each first address port as the target score of the first address port.

[0012] According to another aspect of the embodiment of the application, an application service evaluation device is further provided, comprising: a first determination module configured to determine a plurality of objects of a target address port accessing a target application within a preset time range, and obtain connection information of a communication protocol connection created by each object within the preset time range, wherein the connection information refers to the connection information between a source address port and a destination address port, the source address port is the address port of a terminal where the object is located, and the plurality of destination address ports at least include the target address port; a construction module configured to generate a sub-directed graph based on the connection information associated with each object respectively, and construct a target directed graph according to the sub-directed graphs of the objects, wherein the target directed graph is composed of a plurality of nodes and directed edges connected between the nodes, one node represents one destination address port, and the directed edge represents the jump of the object from one destination address port to another destination address port; a screening module configured to screen a plurality of first address ports belonging to the target application from the destination address ports contained in the target directed graph; and a second determination module configured to calculate the target score of each first address port of the target application based on the target directed graph, and determine the importance of the service provided by each first address port according to the target score of each first address port.

[0013] According to another aspect of the embodiment of the application, a computer readable storage medium is further provided, and the computer readable storage medium stores a computer program, wherein the computer program is configured to execute the application service evaluation method when running.

[0014] According to another aspect of the embodiments of the present application, an electronic device is also provided, which includes one or more processors; a memory for storing one or more programs, which, when executed by the one or more processors, cause the one or more processors to implement a program for running, wherein the program is configured to perform the above-mentioned method for evaluating the application service when running.

[0015] In the embodiments of the present application, the importance of each service of the target application is determined according to the user traffic information, by determining a plurality of objects that have accessed the target address port of the target application within a preset time range, and obtaining connection information of a communication protocol connection created by each object within the preset time range, then generating a sub-directed graph based on the connection information associated with each object respectively, and constructing a target directed graph according to the sub-directed graphs of each object, then screening a plurality of first address ports belonging to the target application from the destination address ports contained in the target directed graph, so as to calculate a target score of each first address port of the target application based on the target directed graph, and determine the importance of the service provided by the first address port according to the target score of each first address port. Wherein, the connection information refers to the connection information between the source address port and the destination address port, the source address port is the address port of the terminal where the object is located, the plurality of destination address ports at least includes the target address port, the target directed graph is composed of a plurality of nodes and directed edges connected between the nodes, a node represents a destination address port, and a directed edge represents that the object jumps from one destination address port to another destination address port.

[0016] In the above process, by constructing the sub-directed graph according to the connection information associated with each object, the jump information of the user traffic information in which the user jumps between different address ports when using the target application is effectively represented, and by constructing the target directed graph according to the sub-directed graph, the comprehensive representation of the jump information of all users jumping between address ports is realized. Further, by determining the importance of the service provided by the first address port according to the target directed graph, the importance of each service in the target application is determined according to the actual traffic of the target application, so as to realize the accurate evaluation of the importance of each service in the target application, and improve the evaluation accuracy.

[0017] Therefore, the scheme provided in the present application achieves the purpose of determining the importance of each service of the target application according to the user traffic information, thereby realizing the technical effect of improving the evaluation accuracy, and further solving the technical problem of low accuracy of the importance evaluation of various services in the related art. BRIEF DESCRIPTION OF DRAWINGS

[0018] The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiments of the application and together with the description serve to explain the application. In the drawings:

[0019] Figure 1 is a schematic diagram of an optional application service evaluation method according to an embodiment of the present application;

[0020] Figure 2 is a schematic diagram of an optional sub-directed graph according to an embodiment of the present application;

[0021] Figure 3 is a schematic diagram of another optional sub-directed graph according to an embodiment of the present application;

[0022] Figure 4 is a schematic diagram of an optional target-directed graph according to an embodiment of the present application;

[0023] Figure 5 is a schematic diagram of an optional application service evaluation device according to an embodiment of the present application;

[0024] Figure 6 is a schematic diagram of an optional electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0025] In order to make the person skilled in the art better understand the present application, 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 only a part of the embodiments of the present application, but not all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work should belong to the protection scope of the present application.

[0026] It should be noted that the terms "first", "second", and the like in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and do not necessarily indicate a specific order or a chronological sequence. It should be understood that the data thus used can be interchanged under appropriate circumstances, so that the embodiments of the present application described herein can be implemented in an order other than that illustrated or described herein. In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusion, for example, a process, method, system, product or device including a series of steps or units does not necessarily have to include only those steps or units clearly listed, but can include other steps or units not clearly listed or inherent to the process, method, product or device.

[0027] It should be noted that the user information (including but not limited to user equipment information, user personal information, etc.) and data (including but not limited to data for display, data for analysis, etc.) involved in the present disclosure are all information and data authorized by the user or authorized by all parties.

[0028] Embodiment 1

[0029] According to an embodiment of the present application, an embodiment of an application service evaluation method is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described herein can be executed in a different order.

[0030] Figure 1 is a schematic diagram of an optional application service evaluation method according to an embodiment of the present application, as shown in Figure 1 The method comprises the following steps:

[0031] Step S101, determining a plurality of objects that have accessed a target address port of a target application within a preset time range, and obtaining connection information of a communication protocol connection created by each object within the preset time range, wherein the connection information refers to the connection information between the source address port and the destination address port, the source address port is the address port of the terminal where the object is located, and the plurality of destination address ports at least includes the target address port.

[0032] Optionally, electronic devices, application systems, servers and the like can be used as the execution subject of the present embodiment. In the present embodiment, the evaluation system is used as the execution subject to determine a plurality of objects that have accessed a target address port of a target application within a preset time range. The target address port is selected by relevant staff from a plurality of address ports included in the target application. The target application is used to provide different services through different address ports included therein. For example, when the target application is a shopping application, the target address port can be the address port corresponding to the home page of the shopping application. When the target application is a game application, the target address port can be the address port for providing login service in the game application. The object is a user. For example, when the target application is a shopping application, the object can be a consumer. When the target application is a game, the object can be a game player, etc. It should be noted that in the present application, the address port includes both the address (IP) and the port (PORT).

[0033] Optionally, the evaluation system can determine the plurality of objects that have accessed the target address port of the target application within the preset time range based on DPI (Deep Packet Inspection) information of actual traffic of the user in the access process. Specifically, when the user accesses a certain address port, a communication protocol connection between the user and the address port needs to be created first, for example, a TCP connection is created. By performing DPI processing on the connection request packet when the communication protocol connection is created through the evaluation system or other related systems, the DPI information corresponding to the communication protocol connection can be obtained, wherein the DPI information is the aforementioned connection information. The connection information at least includes a timestamp, an object identifier, a source address port, and a destination address port, wherein the timestamp represents the connection creation time of the communication protocol connection. Optionally, the evaluation system or other related systems can also perform DPI analysis on the data packets transmitted under the communication protocol connection after the establishment of the communication protocol connection is completed, to obtain connection information including a timestamp, an object identifier, a source address port, a destination address port, and a connection performance indicator, wherein the connection performance indicator includes but is not limited to packet loss rate, retransmission rate, out-of-order rate, and link establishment delay, so as to realize the enrichment of the aforementioned connection information. It should be noted that after the evaluation system or other related systems generate the connection information, the connection information can be stored in a DPI data pool. An optional connection information is shown in Table 1:

[0034] Table 1-Connection information table

[0035]

[0036] Further, the evaluation system can filter all connection information with a connection creation time within the preset time range from the DPI data pool according to the timestamp in the DPI information. Then, the plurality of objects that have accessed the target address port within the preset time range are filtered according to the destination address port in the DPI information. The aforementioned preset time range can be one hour, one day, etc., and the aforementioned preset time range is used to limit the number of data samples for calculating the importance of each service.

[0037] Further, the evaluation system can filter the connection information of the communication protocol connection created by each object within the preset time range from all the connection information with the connection creation time within the preset time range according to the object identifier of the plurality of objects filtered out, so as to be the connection information associated with the object.

[0038] In step S102, a sub-directed graph is generated based on the connection information associated with each object, respectively, and a target directed graph is constructed according to the sub-directed graph of each object, wherein the target directed graph is composed of a plurality of nodes and directed edges connected between the nodes, and one node represents one destination address port, and the directed edge represents that the object jumps from one destination address port to another destination address port.

[0039] In step S102, for each object, the evaluation system can generate a sub-directed graph according to the connection information associated with the current object. Further, the evaluation system can construct a unique target directed graph according to the sub-directed graph of each object, wherein the sub-directed graph and the target directed graph are both composed of multiple nodes and directed edges connected between the nodes, and in the sub-directed graph or the target directed graph, a node represents a destination address port and a directed edge represents a jump from one destination address port to another destination address port.

[0040] It should be noted that by constructing a sub-directed graph according to the connection information associated with each object, the jump information of the user in the user traffic information when the user jumps between different address ports when using the target application is effectively represented, and by constructing a target directed graph according to the sub-directed graph, the comprehensive representation of the jump information of all users jumping between address ports is realized.

[0041] In step S103, multiple first address ports belonging to the target application are screened out from the destination address ports contained in the target directed graph.

[0042] Wherein, when the user uses the target application, it is considered that he starts from any node in the target directed graph and performs random walk in the graph. However, these nodes in the target directed graph are not necessarily all belong to the target application, because a single user can use multiple applications at the same time, but in the target directed graph generated based on the behavior of a large number of users using the target application, if the relationship between part of the nodes is closer or the association degree is higher, then the destination address ports represented by these nodes are more likely to be address ports of the target application.

[0043] Therefore, in step S103, the evaluation system can cluster the nodes in the target directed graph based on a preset clustering algorithm, so as to screen out multiple first address ports belonging to the target application according to the clustering result, wherein the aforementioned clustering algorithm can be DBSCAN (Density-Based Spatial Clustering of Applications with Noise) density clustering, or other clustering algorithms.

[0044] It should be noted that by screening out multiple first address ports belonging to the target application from the target directed graph, the calculation of the target score of the first address port in combination with the related information of the destination address port in the target directed graph which does not belong to the target application is avoided, thereby improving the accuracy of the target score calculation.

[0045] In step S104, the target score of each first address port of the target application is calculated based on the target directed graph, and the importance of the service provided by each first address port is determined according to the target score of each first address port.

[0046] Optionally, the evaluation system can calculate the target score of each first address port of the target application according to the directed edges between the nodes in the target directed graph. For example, the evaluation system can calculate the target score of the first address port represented by a first node according to the number of directed edges connected to the first node. For another example, the directed edges have attribute values, and the evaluation system can calculate the target score of the first address port represented by a first node according to the attribute values of the directed edges connected to the first node.

[0047] Further, the evaluation system can directly use the target score of each first address port to represent the importance of the service provided by the first address port. For example, when it is determined that the target score of a first address port is higher, it is determined that the service provided by the first address port is more important. For another example, when it is determined that the target score of a first address port is lower, it is determined that the service provided by the first address port is less important. When a first address port is more important, the influence on the user experience of using the target application is greater when the first address port has a problem or the routing line connected to the first address port has performance loss or congestion.

[0048] It should be noted that by determining the importance of the service provided by the first address port according to the target directed graph, the importance of each service in the target application is determined according to the actual traffic condition of the target application, thereby achieving accurate evaluation of the importance of each service in the target application.

[0049] Based on the scheme defined in steps S101-S104, it can be known that, in the embodiment of the application, the importance of each service of the target application is determined according to the user traffic information, a plurality of objects accessing the target address port of the target application within a preset time range are determined, connection information of a communication protocol connection created by each object within the preset time range is obtained, a sub-directed graph is generated based on the connection information associated with each object respectively, the target directed graph is constructed according to the sub-directed graphs of the objects, a plurality of first address ports belonging to the target application are selected from the destination address ports contained in the target directed graph, and then the target score of each first address port of the target application is calculated based on the target directed graph, and the importance of the service provided by each first address port is determined according to the target score of each first address port. The connection information refers to the connection information between the source address port and the destination address port, the source address port is the address port of the terminal where the object is located, the plurality of destination address ports include at least the target address port, the target directed graph is composed of a plurality of nodes and directed edges connected between the nodes, one node represents one destination address port, and the directed edge represents the jump of the object from one destination address port to another destination address port.

[0050] It is easy to note that, in the above process, the jump information of the user in the user traffic information when the user jumps between different address ports when using the target application is effectively represented by constructing the sub-directed graph according to the connection information associated with each object, and the comprehensive representation of the jump information of all users jumping between address ports is realized by constructing the target directed graph according to the sub-directed graph. Further, the importance of the service provided by the first address port is determined according to the target directed graph, which realizes the determination of the importance of each service in the target application according to the actual traffic of the target application, thereby realizing the accurate evaluation of the importance of each service in the target application and improving the evaluation accuracy.

[0051] Therefore, the scheme provided in the application achieves the purpose of determining the importance of each service of the target application according to the user traffic information, thereby realizing the technical effect of improving the evaluation accuracy, and further solving the technical problem of low accuracy of the importance evaluation of various services in the related art.

[0052] In an optional embodiment, in the process of generating the sub-directed graph based on the connection information associated with each object respectively, for each object, the evaluation system can determine the start destination address port and the end destination address port of the directed jump of the current object within the target time range according to the connection information associated with the current object, to obtain a plurality of second address ports, and then determine the probability of the directed jump of the current object between any two second address ports within the target time range according to the connection information associated with the current object, so as to take each second address port connected by the current object as a node, take the directed jump between any two second address ports of the current object within the target time range as a directed edge, and take the probability of the directed jump between any two second address ports of the current object within the target time range as the attribute value of the directed edge, to construct the sub-directed graph of the current object.

[0053] Optionally, for the connection information associated with each object, the evaluation system can sort the connection information from early to late according to the connection creation time. Specifically, when the evaluation system determines that the object accesses another destination address port within Δt after accessing a certain destination address port according to the connection information associated with the current object, it is considered that the object randomly jumps from the former destination address port to the latter destination address port, so as to determine the two destination address ports as second address ports. Further, the evaluation system can traverse the connection information associated with the current object based on the foregoing method of determining the second address ports, to determine all destination address ports that can randomly jump to any other destination address port as second address ports, so as to realize the determination of all second address ports associated with the current object. Wherein, the start of the target time range is the connection creation time associated with the start destination address port, i.e. the Δt after the current object accesses a certain destination address port is equivalent to the target time range. According to the experience model, in this embodiment, Δt is set to 60s. It should be noted that the jump relationship between the start destination address port and the end destination address port within the target time range for the directed jump is direct jump. For example, if the destination address ports include A, B and C address ports, and the directed jump of the current object within Δt is from A address port to B address port and then to C address port, it is considered that A address port is the start destination address port relative to B address port, B address port is the end destination address port relative to A address port, and B address port is the start destination address port relative to C address port, and C address port is the end destination address port relative to B address port, i.e. A address port, B address port and C address port are all determined as second address ports.

[0054] Further, after determining the second address port associated with the current object, the evaluation system can determine the weight between any two second address ports based on the number of times that the current object makes a directed jump between the any two second address ports within the target time range. For example, if the second address ports associated with the current object include address port A and address port B, when the current object jumps from address port A to address port B within At after accessing address port A, the weight W AB between address ports A and B is increased by 1, and when the current object jumps from address port B to address port A within At after accessing address port B, the weight W BA between address ports B and A is increased by 1.

[0055] Further, the evaluation system can normalize the weight between any two second address ports to obtain the probability of the current object making a directed jump between the any two second address ports within the target time range. Specifically, normalization can be performed based on the following formula:

[0056]

[0057] wherein, Pij represents the probability of the current object jumping from the i-th second address port to the j-th second address port within the target time range, W ij represents the number of times that the current object jumps from the i-th second address port to the j-th second address port within the target time range, W ik represents the number of times that the current object jumps from the i-th second address port to any second address port within the target time range.

[0058] Further, the evaluation system can construct a sub-directed graph of the current object by taking each second address port connected by the current object as a node, taking the directed jump between any two second address ports within the target time range as a directed edge, and taking the probability of the directed jump between any two second address ports within the target time range as the attribute value of the directed edge. As shown in Table 1 above, the connection information can further include the destination domain name associated with the destination address in the destination address port and the protocol type of the communication protocol connection, and the nodes in the sub-directed graph can include a triple attribute, which can be in the form of [destination address, destination port, protocol] or [destination domain name, destination port, protocol].

[0059] Figure 2 is a schematic diagram of an optional sub-directed graph according to an embodiment of the present application, Figure 3 is a schematic diagram of another optional sub-directed graph according to an embodiment of the present application, as shown in Figure 2 , Figure 3 Figure 2 ​For example, the graph structure of the sub-directed graph is described. In Figure 2 In the above example, the nodes A, B, C and D represent the address ports A, B, C and D respectively. Between the nodes A and B, there is a directed edge from the node A to the node B, indicating that the current object performs a directed jump from the node A to the node B within the target time range. The attribute value of the edge is 0.5, indicating that the probability of the directed jump from the node A to the node B within the target time range is 0.5. In addition, between the nodes A and B, there is also a directed edge from the node B to the node A, indicating that the current object performs a directed jump from the node B to the node A within the target time range. The attribute value of the edge is 0.6, indicating that the probability of the directed jump from the node B to the node A within the target time range is 0.6.

[0060] It should be noted that by taking the probability of the directed jump between any two second address ports within the target time range as the attribute value of the directed edge, the graph content of the sub-directed graph is enriched, thereby facilitating more accurate calculation of the target score.

[0061] In an optional embodiment, in the process of determining the start and end destination address ports of the directed jump of the current object within the target time range according to the connection information associated with the current object, the evaluation system can determine the connection creation time of each communication protocol connection created by the current object according to the connection information associated with the current object, and then filter out the connection information with the earliest connection creation time from the connection information associated with the current object, obtaining the first connection information, and then filter out the connection information with a connection creation time later than the connection creation time of the first connection information from all the connection information associated with the current object, obtaining at least one second connection information, so as to determine the start and end destination address ports of the directed jump of the current object within the target time range according to the first connection information and the at least one second connection information, and obtain the plurality of second address ports.

[0062] Optionally, the evaluation system can determine the connection creation time of each communication protocol connection created by the current object according to the timestamp in the connection information. Then, for the connection information associated with the current object, the evaluation system can sort the connection information according to the connection creation time from early to late, wherein the earlier the connection creation time associated with the earlier connection information is. Then, all the connection information associated with the current object is traversed, and the connection information with the target address port as the first destination address port is selected, so as to determine the connection information as the first connection information.

[0063] Afterwards, the evaluation system can determine the connection information ranked after the first connection information as the second connection information, and start traversing from the first connection information to determine the start destination address port and the end destination address port of the directed jump of the current object in the target time range, to obtain a plurality of second address ports.

[0064] It should be noted that by determining the second address port according to the first connection information and the second connection information, the connection information before the target address port accessed by the user to the target application is screened out, so that preliminary screening of the connection information can be realized, the amount of data processed when determining the second address port is reduced, and the work efficiency is improved.

[0065] In an optional embodiment, in the process of constructing the target directed graph according to the sub-directed graphs of each object, the evaluation system can determine the number of jumps between the second address ports connected by the object in the target time range based on the connection information associated with each object, and then determine the weight value of the activity degree of each object based on the number of jumps of each object, and then construct a first matrix based on the attribute values of the directed edges between the nodes in each sub-directed graph, wherein the elements in the first matrix are the attribute values of the directed edges, so as to calculate a second matrix based on the weight value of each object and the first matrix associated with each object, and construct the target directed graph according to the element values in the second matrix.

[0066] Optionally, for each object, the evaluation system can count the number of jumps between the second address ports connected by the object in the target time range, that is, calculate the sum of the number of jumps between any two second address ports of the current object in the target time range. Afterwards, the evaluation system can add up the number of jumps of all objects to obtain the total number of jumps, and then divide the number of jumps of the current object by the total number of jumps to obtain the weight value representing the activity degree of the current object in performing the access operation.

[0067] Further, the evaluation system can construct a first matrix based on the attribute values of the directed edges between the nodes in each sub-directed graph. The first matrix is a matrix with equal number of rows and columns, and the number of rows and columns of the first matrix is the same as the number of nodes in the sub-directed graph associated with the matrix. Different rows in the first matrix represent different start destination address ports, different columns in the first matrix represent different end destination address ports, and the elements in the first matrix are the attribute values of the directed edges from the start destination address port to the end destination address port. For example, Figure 2 The matrix corresponding to the sub-directed graph shown in FIG. 8A is as follows:

[0068]

[0069] Wherein, the rows of the matrix represent the A, B, C, D address ports from top to bottom, and the columns of the matrix represent the A, B, C, D address ports from left to right, for example, the element 0.5 in the first row and the second column of the matrix represents the attribute value of the directed edge from the A node (i.e. the A address port) to the B node (i.e. the B address port) is 0.5.

[0070] Further, the evaluation system can calculate a second matrix based on the weight value of each object and the first matrix associated with each object after determining the first matrix associated with each sub-directed graph, so as to construct the target directed graph according to the element value in the second matrix.

[0071] It should be noted that by constructing the first matrix based on the sub-directed graph and calculating the second matrix based on the weight value of each object and the first matrix associated with each object, more reasonable calculation of the second matrix is realized, thereby facilitating improvement of the accuracy of the target score calculation.

[0072] In an optional embodiment, in the process of calculating the second matrix based on the weight value of each object and the first matrix associated with each object, the evaluation system can determine the target matrix dimension based on the nodes in the sub-directed graph associated with each object, then compare the dimension of the first matrix associated with each object with the target matrix dimension, and determine whether there is at least one third matrix based on the comparison result, so that in the case that there is at least one third matrix, the dimension of each third matrix is expanded to be the same as the target matrix dimension to obtain the expanded third matrix, and then the second matrix is calculated based on the weight value corresponding to each object and the matrix associated with each object and having the dimension of the target matrix dimension, wherein the third matrix is the first matrix having the dimension different from the target matrix dimension.

[0073] Optionally, after determining the first matrix associated with each object, the evaluation system can take the union of the destination address ports represented by the nodes in the sub-directed graph associated with each object to obtain all the destination address ports for generating the target directed graph, so as to determine the target matrix dimension according to the destination address ports, for example, if the total number of destination address ports is 10, then the number of rows and the number of columns of the target matrix are both 10.

[0074] Further, after determining the target matrix dimension, the evaluation system can compare the dimension of the first matrix associated with each object with the target matrix dimension, so as to screen out at least one third matrix, wherein in this embodiment, the dimension of the third matrix is necessarily smaller than the target matrix dimension. Then, the evaluation system can expand the third matrix according to the address ports associated with the third matrix, and fill 0 between the two address ports without edges, so that each object is associated with a matrix having the dimension of the target matrix dimension. The matrix associated with each object and having the dimension of the target matrix dimension reflects the probability of jumping between the address ports when the user uses the target application.

[0075] Then, the evaluation system can calculate a second matrix based on the weight value corresponding to each object and the matrix with the dimension corresponding to the target matrix dimension associated with each object.

[0076] Optionally, the sub-directed graph shown in Figure 2 and Figure 3 illustrates the aforementioned process of calculating the second matrix. It is assumed that only the user A and the user B have accessed the target address port of the target application within a preset time range, wherein the sub-directed graph associated with the user A is as shown in Figure 2 , the sub-directed graph associated with the user B is as shown in Figure 3 , and in Figure 3 , the nodes A, B, C and E represent the address ports A, B, C and E respectively, and Figure 3 , the matrix corresponding to the sub-directed graph is as shown below:

[0077]

[0078] wherein the rows of the matrix represent the address ports A, B, C and E from top to bottom, and the columns of the matrix represent the address ports A, B, C and E from left to right, for example, the element 0.1 in the fourth row and the second column of the matrix represents that the attribute value of the directed edge from the node E (i.e. the address port E) to the node B (i.e. the address port B) is 0.1.

[0079] Thus, it can be determined that the number of rows and the number of columns of the target matrix dimension are both 5, and in the matrix with the dimension corresponding to the target matrix dimension, the rows of the matrix represent the address ports A, B, C, D and E from top to bottom, and the columns of the matrix represent the address ports A, B, C, D and E from left to right. Furthermore, it can be determined that the sub-directed graph shown in Figure 2 and the sub-directed graph shown in Figure 3 correspond to the third matrix, and it is determined that the expanded third matrix corresponding to the sub-directed graph shown in Figure 2 is as shown below:

[0080]

[0081] wherein the rows of the matrix represent the address ports A, B, C, D and E from top to bottom, and the columns of the matrix represent the address ports A, B, C, D and E from left to right.

[0082] and it is determined that the expanded third matrix corresponding to the sub-directed graph shown in Figure 3 is as shown below:

[0083]

[0084] Wherein, the rows of the matrix represent the A, B, C, D, E address ports from top to bottom, and the columns of the matrix represent the A, B, C, D, E address ports from left to right.

[0085] Further, assuming that the weight of user A is 0.25 and the weight of user B is 0.75, the calculation process of the second matrix is as follows:

[0086]

[0087] Wherein, the matrix on the right side of the equation is the second matrix, and the target directed graph constructed according to the element values in the second matrix is as shown in Figure 4

[0088] It should be noted that the dimensions of the first matrix associated with each object are unified to facilitate more accurate calculation of the second matrix.

[0089] In an alternative embodiment, in the process of screening the plurality of first address ports belonging to the target application from the destination address ports contained in the target directed graph, the evaluation system can determine the distance between any two nodes in the target directed graph based on the attribute values of the directed edges in the target directed graph, and then take the node corresponding to the target address port as the core node, and cluster the nodes in the target directed graph according to the distance between the core node and the nodes outside the core node in the target directed graph to obtain a target cluster, so as to determine the destination address ports represented by the nodes contained in the target cluster as the first address ports.

[0090] Optionally, in this embodiment, the evaluation system performs DBSCAN density clustering on the nodes in the target directed graph to distinguish the nodes belonging to the target application from the nodes not belonging to the target application. The attribute values of the directed edges in the target directed graph represent the probability of the user jumping between the nodes within the target time range, and the greater the jump probability, the more adjacent the nodes, and the smaller the distance between the nodes. In the target directed graph, the distance between two nodes connected by an edge can be calculated based on the following formula:

[0091]

[0092] Wherein, S mn represents the distance between the mth node and the nth node in the target directed graph, represents the attribute value of the directed edge from the mth node to the nth node in the target directed graph, represents the attribute value of the directed edge from the nth node to the mth node in the target directed graph.

[0093] ​Further, the target address is artificially defined as a core object (i.e., the aforementioned core node) in the DBSCAN density clustering method, and the MinPts parameter in the DBSCAN density clustering method is selected as 3 based on an empirical model.

[0094] The radius ∈ in the DBSCAN density clustering method is selected in the following manner: let the radius ∈ i = 0 + ik, starting from 0 and increasing by a certain step k, perform DBSCAN density clustering, and the number of nodes in the obtained clustering cluster is C i . Let C i = f(∈ i ), when f″(∈ i -1) > 0 and f″(∈ i ) < 0 and f″(∈ i +1) < 0 and f″(∈ i +2) < 0, that is, f″(∈ i ) determines the positive and negative changes, take ∈ i as the most appropriate ∈, and perform clustering and obtain a unique target cluster, so as to determine the first address port in the target cluster as the destination address port represented by the node. When the density clustering radius increases, the cluster is more likely to contain more nodes, and when the increase rate of the number of nodes contained in the cluster decreases, it indicates that the relevance of the newly added nodes to the application decreases, which is used as a basis for the style of the clustering cluster.

[0095] It should be noted that, by screening the destination address ports contained in the target directed graph based on the clustering algorithm, the plurality of first address ports belonging to the target application can be more efficiently and accurately screened out.

[0096] In an optional embodiment, in the process of calculating the target score of each first address port of the target application based on the target directed graph, the evaluation system can set an initial score of each first address port, and then recalculate the score of each first address port based on the initial score of each first address port, the attribute value of the directed edge in the target directed graph, and the number of first address ports, until the difference between the current score and the score calculated last time is less than a preset threshold, and the current score of each first address port is determined as the target score of the first address port.

[0097] Optionally, although the first address ports in the target cluster are address ports belonging to the target application, the performance influence degrees of different first address ports in the target cluster on the target application are not the same. Therefore, in order to measure the importance of the services provided by each first address port in the target cluster, the target score of the first address port can be calculated by the PageRank algorithm. The target score can be calculated by the following formula:

[0098]

[0099] wherein PR(m) represents the target score of the destination address port represented by the mth node in the target directed graph, PR(n) represents the target score of the destination address port represented by the nth node in the target directed graph, B represents the set of nodes n, that is, the set composed of the starting nodes of all the directed edges pointing to the mth node and having an attribute value greater than 0, represents the attribute value of the directed edge from the nth node to the u th node in the target directed graph, A represents the set of nodes u, that is, the set composed of the ending nodes of all the directed edges having an attribute value greater than 0 and sent by the node v, d represents the damping factor, and N represents the number of the first address ports in the target cluster. Optionally, in the embodiment, d can be set to 0.85 according to an empirical model.

[0100] Further, the PR(m) is calculated by using an iterative algorithm. Wherein the initial score of the first address port represented by all the nodes is set to 1, that is, PR(m) = 1, PR(l), and then the above model for calculating the target score is iterated t times, so that PR(m t ) ≈ PR(m t+1 ), the iteration is ended, wherein t represents the number of iterations.

[0101] In an optional embodiment, according to an empirical model, when |PR(m t )-PR(m t+1 )| < 0.001, the iteration is ended, and PR(m t+1 ) is determined as the target score of the destination address port represented by the mth node. Thus, the determination of the target score of each first address port is realized.

[0102] It should be noted that by determining the target score of the first address port based on the PageRank algorithm, the effective calculation of the target score of the first address port is realized. In addition, by introducing the damping factor d, the probability of the user not using the application according to the normal application process is simulated by 1-d, such as the user pausing, the user randomly jumping, the user abnormally offline, the user accessing through a straight chain, and the like, avoiding the occurrence of the phenomenon of grade silence caused by the target score of a node being 0 in the process of the PageRank algorithm, or the phenomenon of grade leakage caused by the existence of and the non-existence of when a certain node m exists.

[0103] Further, after the target score of each first address port is determined, the evaluation system can determine the importance degree of the service provided by each first address port based on the target score of each first address port, so as to realize the evaluation of the importance of different services of the target application.

[0104] Optionally, in an application scenario, the evaluation system can perform weighted calculation on the importance of different first address ports and the connection performance indicators in the connection information associated with the first address ports, so as to obtain the performance indicators of the target application, and then control the service quality of the application according to the application performance indicators.

[0105] Optionally, in another application scenario, the evaluation system can also perform intelligent routing scheduling with high accuracy for the address ports of more important services in the application, and allocate more high-quality routing lines for the address ports corresponding to the more important services, so as to improve the overall service quality of the application.

[0106] Optionally, in another application scenario, the evaluation system can also prioritize the troubleshooting of the address ports of more important services when the target application has a problem, so as to minimize the impact on the use of the target application by the user, thereby improving the user experience.

[0107] Optionally, the method provided in the present application can also be applied to other scenarios according to actual needs, and therefore will not be described here.

[0108] It should be noted that the method provided in the present application can reflect the actual application traffic situation compared with the active ICMP Ping and TCP Ping detection in the related art, can reflect more complete application service performance compared with the web homepage probe, and can obtain the weight difference of nodes based on actual user traffic compared with the full-link crawler test initiated from the homepage, while the nodes obtained by the simple crawler are not the more likely to be used by the user when using the service.

[0109] As can be seen, the scheme provided in the present application achieves the purpose of determining the importance of each service of the target application according to the user traffic information, thereby achieving the technical effect of improving the evaluation accuracy, and further solving the technical problem of low accuracy of the importance evaluation of various services in the application in the related art.

[0110] Embodiment 2

[0111] According to an embodiment of the present application, an embodiment of an application service evaluation device is provided, wherein, Figure 5 is a schematic diagram of an optional application service evaluation device according to an embodiment of the present application, as Figure 5 shown, the device comprises:

[0112] The first determining module 501 is configured to determine a plurality of objects that have accessed a target address port of a target application within a preset time range, and acquire connection information of a communication protocol connection created by each object within the preset time range, wherein the connection information refers to connection information between a source address port and a destination address port, the source address port is an address port of a terminal where the object is located, and the plurality of destination address ports at least include the target address port;

[0113] The constructing module 502 is configured to generate a sub-directed graph based on the connection information associated with each object respectively, and construct a target directed graph according to the sub-directed graphs of the objects, wherein the target directed graph is composed of a plurality of nodes and directed edges connected between the nodes, and one node represents one destination address port, and the directed edges represent that the object jumps from one destination address port to another destination address port.

[0114] The screening module 503 is configured to screen a plurality of first address ports belonging to the target application from the destination address ports included in the target directed graph.

[0115] The second determining module 504 is configured to calculate a target score of each first address port of the target application based on the target directed graph, and determine an importance degree of a service provided by each first address port according to the target score of each first address port.

[0116] It should be noted that the determining module 501, the constructing module 502, the screening module 503 and the determining module 504 correspond to steps S101 to S104 in the above embodiment, and the four modules have the same examples and application scenarios as the corresponding steps, but are not limited to the content disclosed in the above embodiment 1.

[0117] Optionally, the constructing module further includes: a first determining sub-module configured to, for each object, determine a start destination address port and an end destination address port of a directed jump of the object within a target time range according to the connection information associated with the object, to obtain a plurality of second address ports; a second determining sub-module configured to determine a probability of a directed jump between any two second address ports of the object within the target time range according to the connection information associated with the object; and a first constructing sub-module configured to take each second address port connected by the object as a node, take the directed jump between any two second address ports of the object within the target time range as a directed edge, and take the probability of the directed jump between any two second address ports of the object within the target time range as an attribute value of the directed edge, to construct a sub-directed graph of the object.

[0118] Optionally, the first determining sub-module further comprises: a first determining unit, configured to determine, according to the connection information associated with the current object, a connection creation time of each communication protocol connection created by the current object; a first screening unit, configured to screen, from the connection information associated with the current object, connection information with a destination address port being the target address port and a connection creation time being the earliest, to obtain first connection information; a second screening unit, configured to screen, from all the connection information associated with the current object, connection information with a connection creation time being later than the connection creation time of the first connection information, to obtain at least one second connection information; and a second determining unit, configured to determine, according to the first connection information and the at least one second connection information, a start point destination address port and an end point destination address port of the directed jump of the current object within the target time range, to obtain a plurality of second address ports.

[0119] Optionally, the constructing module further comprises: a third determining sub-module, configured to determine, based on the connection information associated with each object, a number of jumps between the second address ports connected by the object within the target time range; a fourth determining sub-module, configured to determine, based on the number of jumps of each object, a weight value of the activity level of the object; a second constructing sub-module, configured to construct a first matrix based on the attribute values of the directed edges between the nodes in each sub-directed graph, wherein an element in the first matrix is an attribute value of a directed edge; and a third constructing sub-module, configured to calculate a second matrix based on the weight value of each object and the first matrix associated with each object, and to construct the target directed graph according to the element values in the second matrix.

[0120] Optionally, the third constructing sub-module further comprises: a third determining unit, configured to determine a target matrix dimension based on the nodes in the sub-directed graph associated with each object; a fourth determining unit, configured to compare the dimension of the first matrix associated with each object with the target matrix dimension, and to determine, based on the comparison result, whether there is at least one third matrix, wherein the third matrix is a first matrix with a dimension different from the target matrix dimension; an expanding unit, configured to, in the case that there is at least one third matrix, expand the dimension of each third matrix to be the same as the target matrix dimension to obtain an expanded third matrix; and a calculating unit, configured to calculate the second matrix based on the weight value of each object and the matrix associated with each object and having the dimension of the target matrix dimension.

[0121] Optionally, the screening module further comprises: a fifth determining sub-module, configured to determine, based on the attribute values of the directed edges in the target directed graph, a distance between any two nodes in the target directed graph; a clustering module, configured to take the node corresponding to the target address port as a core node, and to cluster the nodes in the target directed graph according to the distance between the core node and the nodes other than the core node in the target directed graph, to obtain a target cluster; and a sixth determining sub-module, configured to determine the destination address port represented by the node contained in the target cluster as the first address port.

[0122] Optionally, the second determining module further comprises: a setting sub-module, configured to set an initial score of each first address port; and a calculating sub-module, configured to recalculate the score of each first address port based on the initial score of each first address port, the attribute value of the directed edge in the target directed graph, and the number of the first address ports, until the difference between the current score and the score calculated last time is less than a preset threshold, and determine the current score of each first address port as the target score of the first address port.

[0123] Embodiment 3

[0124] According to another aspect of the embodiments of the present application, there is also provided a computer readable storage medium having a computer program stored therein, wherein the computer program is configured to perform the above-mentioned method for evaluating application services when executed.

[0125] Embodiment 4

[0126] According to another aspect of the embodiments of the present application, there is also provided an electronic device, wherein, Figure 6 is a schematic diagram of an optional electronic device according to an embodiment of the present application, as Figure 6 shown, the electronic device comprises one or more processors; a memory configured to store one or more programs, which, when executed by the one or more processors, cause the one or more processors to implement a program configured to perform the above-mentioned method for evaluating application services when executed.

[0127] The above-mentioned embodiment numbers of the present application are only for description, and do not represent the advantages or disadvantages of the embodiments.

[0128] In the above-mentioned embodiments of the present application, the description of each embodiment has its own focus, and the parts not described in detail in a certain embodiment can be referred to the relevant description of other embodiments.

[0129] In several embodiments provided in the present application, it should be understood that the disclosed technical contents can be implemented by other ways. Among them, the above-mentioned device embodiments are only schematic, for example, the division of units can be a logical function division, and actual implementation can have another division way, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the displayed or discussed each other can be through some interface, indirect coupling or communication connection between units or modules, which can be electrical or other forms.

[0130] The units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, i.e. may be located in one place, or may be distributed to multiple units. Part or all of the units may be selected according to actual needs to achieve the purpose of the embodiment.

[0131] In addition, each functional unit in each embodiment of the present application can be integrated in one processing unit, or each unit can exist physically, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0132] If the integrated unit is realized in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer readable storage medium. Based on this understanding, the technical solutions of the present application or the part of the prior art that essentially contributes or the whole or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes a plurality of instructions for causing a computer device (which can be a personal computer, a server or a network device, etc.) to execute all or part of the steps of the method of each embodiment of the present application. The aforementioned storage medium includes: a U disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a mobile hard disk, a magnetic disk or an optical disk, and various program code storage media.

[0133] The above is only the preferred embodiment of the present application. It should be noted that for those skilled in the art, without departing from the principles of the present application, a number of improvements and refinements can be made, and these improvements and refinements should be considered as the protection scope of the present application.

Claims

1. A method of evaluating an application service, characterized by, The method comprises the following steps: determining a plurality of objects that have accessed a target address port of a target application within a preset time range, and obtaining connection information of a communication protocol connection created by each object within the preset time range, wherein the connection information refers to connection information between a source address port and a destination address port, the source address port is an address port of a terminal where the object is located, and the plurality of destination address ports at least includes the target address port; generating a sub-directed graph based on the connection information associated with each object respectively, and constructing a target directed graph according to the sub-directed graphs of each object, wherein the target directed graph is composed of a plurality of nodes and directed edges connected between the nodes, one node represents one destination address port, and the directed edge represents that the object jumps from one destination address port to another destination address port; screening a plurality of first address ports belonging to the target application from the destination address ports included in the target directed graph; calculating a target score of each first address port of the target application based on the target directed graph, and determining the importance of the service provided by the first address port according to the target score of each first address port respectively; wherein generating a sub-directed graph based on the connection information associated with each object respectively comprises: for each object, determining a starting destination address port and an ending destination address port of the current object for directed jumping within a target time range according to the connection information associated with the current object, to obtain a plurality of second address ports; determining the probability of directed jumping between any two second address ports by the current object within the target time range according to the connection information associated with the current object; taking each second address port connected by the current object as the node, taking the directed jumping between any two second address ports by the current object within the target time range as the directed edge, and taking the probability of directed jumping between any two second address ports by the current object within the target time range as the attribute value of the directed edge, to construct the sub-directed graph of the current object.

2. The method of claim 1, wherein, determining a starting destination address port and an ending destination address port of the current object for directed jumping within a target time range according to the connection information associated with the current object, to obtain a plurality of second address ports, comprises: determining the connection creation time of each communication protocol connection created by the current object according to the connection information associated with the current object; screening connection information with the target address port as the destination address port and the earliest connection creation time from the connection information associated with the current object, to obtain first connection information; screening connection information with the connection creation time later than the connection creation time of the first connection information from all connection information associated with the current object, to obtain at least one second connection information; determining a starting destination address port and an ending destination address port of the current object for directed jumping within the target time range according to the first connection information and the at least one second connection information, to obtain the plurality of second address ports.

3. The method of claim 1, wherein, The target directed graph is constructed according to the sub-directed graphs of each object, comprising: determining the number of hops of each object between the second address ports connected by the object within the target time range based on the connection information associated with the object; determining the weight value of the activity degree of each object based on the number of hops of the object; constructing a first matrix based on the attribute values of the directed edges between the nodes in each sub-directed graph, wherein the elements in the first matrix are the attribute values of the directed edges; calculating a second matrix based on the weight value of each object and the first matrix associated with each object, and constructing the target directed graph according to the element values in the second matrix.

4. The method of claim 3, wherein, The calculation of the second matrix based on the weight value of each object and the first matrix associated with each object comprises: determining the target matrix dimension based on the nodes in the sub-directed graph associated with each object; comparing the dimensions of the first matrix associated with each object with the target matrix dimension, and determining whether there is at least one third matrix based on the comparison result, wherein the third matrix is a first matrix with a different dimension from the target matrix dimension; in the case where there is at least one third matrix, the dimension of each third matrix is respectively expanded to the same as the target matrix dimension to obtain the expanded third matrix; calculating the second matrix based on the weight value corresponding to each object and the matrix associated with each object and having the dimension of the target matrix dimension.

5. The method of claim 1, wherein, The first address ports belonging to the target application are screened from the destination address ports contained in the target directed graph, comprising: determining the distance between any two nodes in the target directed graph based on the attribute values of the directed edges in the target directed graph; taking the node corresponding to the target address port as a core node, clustering the nodes of the target directed graph according to the distance between the core node and the nodes other than the core node in the target directed graph to obtain a target cluster; determining the destination address ports represented by the nodes contained in the target cluster as the first address ports.

6. The method of claim 1, wherein, The target score of each first address port of the target application is calculated based on the target directed graph, comprising: setting the initial score of each first address port; recomputing the score of each first address port based on the initial score of each first address port, the attribute values of the directed edges in the target directed graph and the number of first address ports until the difference between the current score and the score calculated last time is less than a preset threshold, and determining the current score of each first address port as the target score of the first address port.

7. An application service evaluation device, characterized in that, The method for executing any one of claims 1 to 6 comprises: The first determining module is configured to determine a plurality of objects that have accessed a target address port of a target application within a preset time range, and obtain connection information of a communication protocol connection created by each object within the preset time range, wherein the connection information refers to connection information between a source address port and a destination address port, the source address port is an address port of a terminal where the object is located, and the plurality of destination address ports at least include the target address port; The constructing module is configured to generate a sub-directed graph based on the connection information associated with each object, respectively, and construct a target directed graph according to the sub-directed graphs of the objects, wherein the target directed graph is composed of a plurality of nodes and directed edges connected between the nodes, one node represents one destination address port, and the directed edges represent that the objects jump from one destination address port to another destination address port. The screening module is configured to screen a plurality of first address ports belonging to the target application from the destination address ports included in the target directed graph. The second determining module is configured to calculate a target score of each first address port of the target application based on the target directed graph, and determine an importance degree of a service provided by the first address port according to the target score of each first address port.

8. A computer-readable storage medium, characterized in that, The computer readable storage medium stores a computer program, wherein the computer program is configured to execute the application service evaluation method in any one of claims 1 to 6 when running.

9. An electronic device, comprising: The electronic device includes one or more processors; The memory is configured to store one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement a program for running, wherein the program is configured to execute the application service evaluation method in any one of claims 1 to 6 when running.

Images