CN111784516B - Service path determining method and device and electronic equipment - Google Patents
Service path determining method and device and electronic equipment Download PDFInfo
- Publication number
- CN111784516B CN111784516B CN202010545849.2A CN202010545849A CN111784516B CN 111784516 B CN111784516 B CN 111784516B CN 202010545849 A CN202010545849 A CN 202010545849A CN 111784516 B CN111784516 B CN 111784516B
- Authority
- CN
- China
- Prior art keywords
- transaction
- processing node
- matching code
- field
- matching
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 54
- 238000012545 processing Methods 0.000 claims abstract description 246
- 230000004044 response Effects 0.000 claims description 14
- 238000013507 mapping Methods 0.000 claims description 12
- 238000007619 statistical method Methods 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 14
- 230000008569 process Effects 0.000 description 10
- 238000004891 communication Methods 0.000 description 9
- 230000005540 biological transmission Effects 0.000 description 8
- 238000012544 monitoring process Methods 0.000 description 5
- 238000011161 development Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 238000004519 manufacturing process Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000000007 visual effect Effects 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 238000000802 evaporation-induced self-assembly Methods 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Abstract
The invention provides a method, a device and electronic equipment for determining a service path, which relate to the technical field of computers and comprise the following steps: determining a plurality of transaction processing nodes for processing the target traffic; determining transaction data of transaction operations corresponding to each transaction processing node; and carrying out matching operation on the first transaction operation entering each transaction processing node and the second transaction operation sent by each transaction processing node according to the transaction characteristic field in the transaction data, thereby obtaining a target business transaction tracking path. The invention can reduce the requirement of the matching code when matching the first transaction operation entering each transaction processing node with the second transaction operation sent by each transaction processing node based on the transaction data, thereby providing powerful help for timely finding and positioning the application performance faults and further relieving the technical problem of poor path tracking performance caused by non-uniform transaction serial numbers in the traditional transaction path tracking method.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a method and an apparatus for determining a service path, and an electronic device.
Background
With the rapid development of new business and new technology, the key of the current operation and maintenance work is to monitor the health condition of the whole business process and to rapidly find and locate problems. In schemes employing performance monitoring, transaction tracking is a relatively advanced and popular technique.
The existing transaction tracking method mainly comprises the steps of analyzing a transaction flow log or a network data packet to obtain transaction information of each transaction processing link, and forming a transaction path diagram according to a network access relation. On the basis, a transaction is tracked from an initiating end to a final processing link by extracting a transaction serial number in a network session or a log so as to find out a fault point or a performance bottleneck in the whole process. However, the actual situation is that the transaction processing link does not have a unified transaction serial number when crossing the system modules. This requires an overall change in the production environment for such monitoring requirements, but the method is risky and not cost effective.
Disclosure of Invention
In view of the above, the present invention aims to provide a method, an apparatus and an electronic device for determining a service path, which can reduce the requirement of a matching code when matching a first transaction operation entering each transaction processing node with a second transaction operation sent by each transaction processing node, thereby providing a powerful help for timely finding and locating an application performance fault.
In a first aspect, an embodiment of the present invention provides a method for determining a service path, including: determining a plurality of transaction processing nodes for processing the target traffic; determining transaction data of transaction operations corresponding to each transaction processing node; the transaction operation comprises a first transaction operation entering a current transaction processing node and a second transaction operation sent by the current transaction processing node, and the transaction data comprises various network fields and various transaction characteristic fields; matching the first transaction operation entering each transaction processing node with the second transaction operation sent by each transaction processing node according to the transaction characteristic field in the transaction data, so as to obtain a target business transaction tracking path, wherein the transaction characteristic field comprises at least one of the following: user ID, topic ID and genre ID.
Further, determining transaction data for the transaction operation corresponding to each transaction processing node includes: sending a call request to a target database; wherein the call request is to call transaction data of each transaction processing node; and acquiring response information which is fed back by the target database based on the calling request and carries the transaction data.
Further, determining transaction data for the transaction operation corresponding to each transaction processing node further includes: acquiring target data of at least one service, wherein the target data comprises: network traffic data packets, or transaction flow log data; and analyzing the network flow data packet to obtain transaction data of the transaction operation corresponding to each transaction processing node.
Further, performing a matching operation on the first transaction operation entering each transaction processing node and the second transaction operation sent by each transaction processing node according to the transaction characteristic field in the transaction data comprises: determining a transaction matching code of a first transaction operation of each transaction processing node and a second transaction operation sent by each transaction processing node to obtain the first transaction matching code and the second transaction matching code; and matching the first transaction operation with the second transaction operation according to the first transaction matching code and the second transaction matching code.
Further, the first transaction matching code and the second transaction matching code may include any one of: the first transaction matching code and the second transaction matching code are fields with the same or different field names and the same field content; or, the first transaction matching code comprises at least one first field, the second transaction matching code comprises at least one second field, and the field content of the at least one first field is matched with the field content of the at least one second field; or the first transaction matching code is a partial field in the first field, and the second transaction matching code is a second field, wherein the partial field in the first field and the field content of the second field are the same.
Further, the first transaction operation is plural, and the second transaction operation is plural; according to the first transaction matching code and the second transaction matching code, performing the matching operation on the first transaction operation and the second transaction operation includes: determining a second transaction matching code which is the same as the current first transaction matching code in a plurality of second transaction matching codes aiming at each first transaction matching code; if the same second transaction matching code is determined, establishing an association relationship between the current first transaction matching code and the matched same second transaction matching code; if the same second transaction matching code is not determined, determining that the business transaction tracking path corresponding to the current first transaction matching code is ended.
Further, determining a transaction matching code for the first transaction operation of each transaction processing node and the second transaction operation issued by each transaction processing node includes: searching node attribute information of each transaction processing node in a target mapping table; and determining a transaction matching code of a first transaction operation of each transaction processing node and a second transaction operation sent by each transaction processing node according to the node attribute information.
Further, the method further comprises: performing statistical analysis on the target business transaction tracking path to obtain transaction processing performance information of the target business transaction tracking path at each transaction processing node, wherein the transaction processing performance information comprises at least one of the following: and the target business transaction tracks transaction processing nodes contained in the path, transaction processing time of each transaction processing node, transaction field information of transaction data of each transaction processing node and response state of each transaction processing node.
In a second aspect, an embodiment of the present invention further provides a device for determining a service path, including: a first determining unit configured to determine a plurality of transaction processing nodes for processing a target service; a second determining unit, configured to determine transaction data of a transaction operation corresponding to each transaction processing node; the transaction operation comprises a first transaction operation entering a current transaction processing node and a second transaction operation sent by the current transaction processing node, and the transaction data comprises various network fields and various transaction characteristic fields; the matching unit is used for carrying out matching operation on the first transaction operation entering each transaction processing node and the second transaction operation sent by each transaction processing node according to the transaction characteristic field in the transaction data so as to obtain a target business transaction tracking path, and the transaction characteristic field comprises at least one of the following: user ID, topic ID and genre ID.
In a third aspect, an embodiment of the present invention provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method of any one of the first aspects when the computer program is executed.
In an embodiment of the present invention, a plurality of transaction processing nodes for processing a target service are first determined; then determining transaction data of the transaction operation corresponding to each transaction processing node; and finally, matching the first transaction operation entering each transaction processing node with the second transaction operation sent by each transaction processing node according to the transaction characteristic field in the transaction data, thereby obtaining a target business transaction tracking path. In this embodiment, by means of matching the first transaction operation and the second transaction operation by the transaction feature field, when the first transaction operation entering each transaction processing node and the second transaction operation sent by each transaction processing node are matched based on transaction data, the requirement of a matching code is reduced, so that powerful help is provided for timely finding and positioning application performance faults, and the technical problem of poor path tracking performance caused by non-uniform transaction serial numbers in the traditional transaction path tracking method is solved.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
In order to make the above objects, features and advantages of the present invention more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are needed in the description of the embodiments or the prior art will be briefly described, and it is obvious that the drawings in the description below are some embodiments of the present invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of a service path determining method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of transaction data according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a business transaction tracking path of a mobile banking according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a business transaction trace path according to an embodiment of the present invention;
fig. 5 is a waterfall model display effect diagram of a service transaction tracking path according to an embodiment of the present invention;
fig. 6 is a schematic diagram of a service path determining apparatus according to an embodiment of the present invention;
fig. 7 is a schematic diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Embodiment one:
according to an embodiment of the present invention, there is provided an embodiment of a method of determining a traffic path, it being noted that the steps shown in the flowchart of the figures may be performed in a computer system such as a set of computer executable instructions, and that although a logical order is shown in the flowchart, in some cases the steps shown or described may be performed in an order other than that shown or described herein.
Fig. 1 is a flowchart of a method for determining a traffic path according to an embodiment of the present invention, as shown in fig. 1, the method includes the steps of:
step S102, determining a plurality of transaction processing nodes for processing the target service.
Target service: a transaction that is transacted for the end user includes all transaction operations from the originating end to the final transaction processing session. For example: one transfer, one deposit, etc.
Transaction processing node: is an abstract concept, specifically referring to each transaction processing link. The transaction processing nodes not only correspond to one or a group of IP addresses or ports, but may also be defined by transaction characteristics. Such as a certain transaction type code or channel number.
Step S104, determining transaction data of the transaction operation corresponding to each transaction processing node; the transaction operation comprises a first transaction operation entering the current transaction processing node and a second transaction operation sent by the current transaction processing node, and the transaction data comprises various network fields and various transaction characteristic fields.
Transaction operations: a primary request and a corresponding response occurs between two processing links. For example, in a transfer process, the request of the WEB server to the APP server, the response or the non-response is calculated as a transaction operation.
Fig. 2 is a schematic diagram of transaction data, which includes various network fields including IP and port, and various transaction characteristic fields including transaction parameters and service return codes. When a target service is processed in the background, the target service is composed of all transaction data, and the field number and the field value of each transaction data can be different.
Step S106, matching the first transaction operation entering each transaction processing node with the second transaction operation sent by each transaction processing node according to the transaction characteristic field in the transaction data, so as to obtain a target business transaction tracking path, wherein the transaction characteristic field comprises at least one of the following: user ID, topic ID and genre ID.
It should be noted that, in the present application, the user ID is a field useid, the subject ID is a field tid, and the type ID is a field typeid. Target business transaction trace path: a target business is composed of a plurality of transaction operations, and all transaction processing links passed by the transaction operations form a target business transaction tracking path.
As shown in fig. 3, a service path of a mobile banking is presented, a transaction is initiated from a WEB node of the mobile banking, and finally reaches a core, a DB node and the like through each logic node. As shown in fig. 3, the mobile banking WEB is a logical node, and the mobile banking APP, the mobile banking F5, and the like are all logical nodes. It should be noted that, in the present application, a logical node is a transaction processing node in the present application. Wherein, the logical node is different from the physical node, and in the application, the logical node is an abstract concept, specifically refers to each transaction processing link. The transaction processing nodes not only correspond to one or a group of IP addresses or ports, but may also be defined by transaction characteristics.
For the transaction processing nodes shown in fig. 3, a transaction characteristic field is extracted from each segment of transaction processing nodes. If the original transaction tracking means is adopted, each transaction processing node is required to have a unique transaction serial number, such as the uid shown in fig. 3, so that the matching tracking of the transaction can be realized, and the transaction is identified as a service.
However, in practical situations, the production system often does not have the condition, different application modules in the production system are developed by different people, and the production system does not have a unique identification which is unchanged from beginning to end, so that the improvement cost is high. However, the inventors have found that the transaction operations entered into each transaction processing node and the transaction operations issued by each transaction processing node have feature fields that can be matched. For example, the mobile banking APP has a field of userid before and after, and the two fields have the same value, so that the matching can be performed.
However, the transaction before and after the mobile phone bank F5 does not have transaction fields with the same name, but the inventor finds that the tid field of the previous section and the typeid field of the next section have the same actual business meaning, and the matching can be performed when the values of the two fields are the same. As shown in fig. 3, the ESB front node and the ESB front node are not exactly identical in terms of transaction field, but the value of the typeid field of the previous segment is identical to the value of the tt field of the next segment by six digits, so that matching can be achieved similarly.
As can be seen from the above description, in the present application, the manner of matching the first transaction operation entered into each transaction processing node with the second transaction operation sent out by each transaction processing node according to the transaction feature field in the transaction data greatly reduces the severe requirements for transaction matching, and finally achieves the transaction tracking of the whole service path by matching section by section.
In this embodiment, by matching the first transaction operation and the second transaction operation through the transaction feature field, when the first transaction operation entering each transaction processing node and the second transaction operation sent by each transaction processing node are matched based on the transaction data, the requirement of the matching code is reduced, so that powerful help is provided for timely finding and positioning the application performance fault, and the technical problem of poor path tracking performance caused by non-uniform transaction serial numbers in the traditional transaction path tracking method is solved.
Step S102 to step S106 will be described below in connection with the specific embodiment.
As can be seen from the above description, in the present application, a plurality of transaction processing nodes for processing a target service are first determined, and then transaction data of a transaction operation corresponding to each transaction processing node is determined, specifically, by the following several ways.
A mode one,
Firstly, sending a call request to a target database; wherein the call request is to call transaction data of each transaction processing node;
and then, acquiring response information which is fed back by the target database based on the calling request and carries the transaction data.
In this application, the transaction data may be obtained from a development department. Specifically, because various business systems are realized by the development department in a floor mode, the complete transaction data corresponding to one business at each transaction processing node can be obtained from the development department.
For example, the user may send a call request to a target database storing transaction data, and the target database feeds back complete transaction data carrying respective services at respective transaction processing nodes to the user after acquiring the call request. Such as transaction data as shown in fig. 2.
By the acquisition mode, accurate transaction data can be acquired, and based on the accurate transaction data, more accurate path tracking results can be obtained when determining a transaction tracking path based on the transaction data.
A second mode,
First, target data of at least one service is acquired, wherein the target data comprises: network traffic data packets, or transaction flow log data;
And secondly, analyzing the network flow data packet to obtain transaction data of the transaction operation corresponding to each transaction processing node.
In this application, in addition to the manner described in the foregoing manner one, target data of at least one service may be obtained, where the target data may be a network traffic packet or transaction flow log data. And analyzing the network flow data packet or the transaction flow log data to obtain transaction data of transaction operation corresponding to each transaction processing node.
It should be noted that, the transaction data obtained after parsing is organized according to the communication pairs, when mapping to the service transaction tracking path, physical concepts such as an IP address, a port and the like are combined or split according to the asset information, and transaction feature fields such as a service code, a channel number and the like are added to jointly define a transaction processing node, so that a real service path is formed.
In this application, the analysis process for analyzing the network traffic data packet is the same as the analysis process for analyzing the transaction flow log data, and will not be described here again.
By the acquisition mode, transaction data can be acquired quickly, and based on the transaction data, a required service path can be monitored quickly when the service path is determined based on the transaction data.
It should be noted that, in the present application, the first mode and the second mode may be combined, so as to obtain the service transaction tracking path required for monitoring more quickly and more completely.
After the service transaction tracking path is obtained, the service transaction tracking path can be displayed in a visual mode, as shown in fig. 4, namely, a visual display diagram of the service transaction tracking path, and as can be seen from fig. 4, the service transaction tracking path is formed by a directed connection line between a transaction processing node and a transaction processing node.
Specifically, A, B, C in fig. 4 are transaction processing nodes, and AB represents a second transaction operation sent by the transaction processing node a, that is, a first transaction operation entering the transaction processing node B. Likewise, BC represents a second transaction operation issued by the transaction processing node B, i.e. a first transaction operation entered into the transaction processing node C.
In the present application, after determining the transaction data of the transaction operation corresponding to each transaction processing node in the above-described manner, the matching operation may be performed on the first transaction operation entering each transaction processing node and the second transaction operation sent by each transaction processing node according to the transaction feature field in the transaction data, so as to obtain the target transaction tracking path.
In an optional embodiment, step S106, performing a matching operation on the first transaction operation entered into each transaction processing node and the second transaction operation issued by each transaction processing node according to the transaction characteristic field in the transaction data includes:
step S1061, determining a transaction matching code of a first transaction operation entering each transaction processing node and a second transaction operation sent by each transaction processing node, so as to obtain a first transaction matching code and a second transaction matching code;
step S1062, performing a matching operation on the first transaction operation and the second transaction operation according to the first transaction matching code and the second transaction matching code.
In this embodiment, first, a first transaction matching code before each transaction processing node and a second transaction matching code after each transaction processing node are determined. The first transaction matching code before each transaction processing node refers to the transaction matching code of the first transaction operation entering each transaction processing node, and the second transaction matching code after each transaction processing node refers to the transaction matching code of the second transaction operation sent by each transaction processing node.
After the first transaction matching code and the second transaction matching code are obtained, the first transaction operation and the second transaction operation can be matched according to the first transaction matching code and the second transaction matching code, so that whether the first transaction operation and the second transaction operation belong to the same target business transaction tracking path or not can be determined according to the matching result.
Taking fig. 4 as an example for illustration, a first transaction matching code before the transaction processing node B (i.e., the transaction matching code of a first transaction operation entering the transaction processing node B) is first determined, and a second transaction matching code after the transaction processing result B (i.e., the transaction matching code of a second transaction operation issued by the transaction processing node B) is determined. The first transaction operation entering the transaction processing node B is transaction operation AB, and the second transaction operation sent by the transaction processing node B is transaction operation BC.
Then, the first transaction operation AB and the second transaction operation BC are matched according to the first transaction matching code and the second transaction matching code.
In an alternative embodiment, the first transaction matching code and the second transaction matching code include any one of the following:
first, the first transaction matching code and the second transaction matching code are fields with the same or different field names and the same field content.
Specifically, the first transaction matching code may be a transmission id, and at this time, the second transaction matching code may also be a transmission id, where the field contents of the first transaction matching code transmission id and the second transaction matching code transmission id are the same. If the first transaction matching code is a transaction id, the second transaction matching code may be a transaction code, wherein the field contents of the first transaction matching code and the second transaction matching code are the same.
That is, the field names of the first transaction matching code and the second transaction matching code may be the same or different, but the field contents of the first transaction matching code and the second transaction matching code are the same.
For example, as shown in fig. 4, the transaction matching code of the transaction operation AB may be a transaction id, denoted as a transaction 1, and the transaction matching code in the transaction operation BC may be a transaction id, denoted as a transaction 2, and at this time, the field contents of the transaction 1 and the transaction 2 may be matched, so as to determine whether the transaction operation AB and the transaction operation BC are matched according to the matching result.
The transaction matching code of the transaction operation AB may be a transaction id, and the transaction matching code in the transaction operation BC may be a transaction code, where the field contents of the transaction id and the transaction code may be matched, so as to determine whether the transaction operation AB and the transaction operation BC are matched according to the matching result.
Second, the first transaction matching code comprises at least one first field, the second transaction matching code comprises at least one second field, the field content of the at least one first field is matched with the field content of the at least one second field, and the at least one first field and the at least one second field comprise fields with the same field names.
Specifically, the first transaction matching code may be a transaction+code, and at this time, the second transaction matching code may be a transaction, where the field content of the first transaction matching code+code is the same as the field content of the second transaction matching code. If the first transaction matching code is a transmission+code, the second transaction matching code may be a transmission+code, where the field content of the first transaction matching code transmission+code is the same as the field content of the second transaction matching code transmission+code.
That is, the first transaction matching code includes at least one first field, the second transaction matching code includes at least one second field, and the field contents of the at least one first field and the field contents of the at least one second field match.
For example, as shown in fig. 4, the transaction matching code of the transaction operation AB may be a transaction+code, denoted as a transaction 1+code 1, and the transaction matching code of the transaction operation BC may be a transaction 2. At this time, the field contents of the transid1+transcode1 and the field contents of the transid2 may be matched, thereby determining whether the transaction operation AB and the transaction operation BC are matched according to the matching result.
For another example, the transaction matching code of transaction operation AB may be a transaction+code, denoted as transaction 1+code 1, and the transaction matching code of transaction operation BC may be a transaction+code, denoted as transaction 2+code 2. At this time, the field contents of the transid1+transcode1 and the field contents of the transid2+transcode2 may be matched, thereby determining whether the transaction operation AB and the transaction operation BC are matched according to the matching result.
Third, the first transaction matching code is a partial field in the first field, and the second transaction matching code is a second field, wherein the partial field in the first field and the field content of the second field are the same.
Specifically, the first transaction matching code may be a first three-bit field of the transaction id, and at this time, the second transaction matching code may be the transaction id, where the field content of the first transaction matching code is the same as the field content of the second transaction matching code.
That is, the first transaction matching code is a partial field in the first field, and the second transaction matching code is a second field, wherein the partial field in the first field and the field content of the second field are the same.
For example, as shown in fig. 4, the transaction matching code of the transaction operation AB may be the first three-bit field of the transaction id, the first three-bit field of the transaction id is denoted as the transaction 1, the transaction matching code in the transaction operation BC may be the transaction id, denoted as the transaction 2, and at this time, the field contents of the transaction 1 and the field contents of the transaction 2 may be matched, so that whether the transaction operation AB and the transaction operation BC are matched may be determined according to the matching result.
In the present application, the transaction matching code of the first transaction operation of each transaction processing node and the second transaction operation sent by each transaction processing node may be determined in the following manner, which specifically includes:
first, node attribute information of each transaction processing node is searched in a target mapping table.
In the present application, a target mapping table may be pre-constructed, where the target mapping table includes a correspondence between a transaction processing node and a transaction matching code. The target mapping table may be a key-value form table. Key represents node attribute information of the transaction processing node, and value represents a first transaction matching code and a second transaction matching code corresponding to the node attribute information.
And then, determining a transaction matching code of the first transaction operation of each transaction processing node and the second transaction operation sent by each transaction processing node according to the node attribute information.
It should be noted that the target mapping table may be a data table preset by a related technician. When determining the transaction matching codes of the first transaction operation of each transaction processing node and the second transaction operation sent by each transaction processing node, the target mapping table can be firstly called from the database, and then node attribute information of the transaction processing node is found in the target mapping table, so that the first transaction matching code and the second transaction matching code corresponding to the node attribute information are searched in the target mapping table.
In this application, after the first transaction matching code and the second transaction matching code are determined according to the above cases, the matching operation may be performed according to the first transaction matching code and the second transaction matching code, where the specific process is described as follows:
step S11, determining a second transaction matching code which is the same as the current first transaction matching code in a plurality of second transaction matching codes aiming at each first transaction matching code;
step S12, if the same second transaction matching code is determined, establishing an association relationship between the current first transaction matching code and the matched same second transaction matching code;
step S13, if the same second transaction matching code is not determined, determining that the business transaction tracking path corresponding to the current first transaction matching code is ended.
In this application, for all the transaction processing nodes except the head-to-tail transaction processing node, the matching processing may be performed according to the procedures described in steps S11 to S13.
It is assumed that for any one transaction processing node, the first transaction operation is plural and the second transaction operation is plural.
At this point, each first transaction operation may be matched with each second transaction operation of the plurality of second transaction operations. The specific matching principle is to match the first transaction matching code of the first transaction operation with the second transaction matching code of each second transaction operation. If the second transaction matching code identical to the first transaction matching code is determined from the plurality of second transaction matching codes, an association relationship between the first transaction matching code and the identical second transaction matching code is established.
Specifically, when the association relationship between the first transaction matching code and the matched same second transaction matching code is established, the same identification information can be set for the first transaction operation of the first transaction matching code and the second transaction operation corresponding to the same second transaction matching code.
If the second transaction matching code which is the same as the first transaction matching code is not determined, the transaction processing node corresponding to the first transaction operation is the last transaction processing node of the corresponding target business transaction tracking path, and at the moment, the path tracking is finished.
All transaction processing nodes except the head transaction processing node and the tail transaction processing node are matched by adopting the process, and the target transaction tracking path of each service can be finally obtained through the segment-by-segment matching.
In this application, after obtaining the target transaction trace paths of each transaction in the above-described manner, statistical analysis may be performed on the target transaction trace paths to obtain transaction processing performance information of the target transaction trace paths at each transaction processing node, where the transaction processing performance information includes at least one of: and the target business transaction tracks transaction processing nodes contained in the path, transaction processing time of each transaction processing node, transaction field information of transaction data of each transaction processing node and response state of each transaction processing node.
In the present application, transaction characteristic rules such as source IP, destination IP, source port, destination port, transaction parameters, and service return code may also be defined on the transaction processing node or the directed link. The transaction data is defined according to the rules to form an index, can be counted to obtain indexes such as transaction amount, response time and the like, and contains all relevant field information of the target service in the processing process.
Specifically, in the present application, after obtaining the target transaction tracking path, transaction data corresponding to transaction operations sent by each transaction processing node of the transaction in the target transaction tracking path may be extracted according to the transaction matching code, and statistical analysis is performed on the transaction data, so as to obtain transaction processing performance information of each transaction processing node of the transaction in the target transaction tracking path, where the transaction processing performance information includes at least one of the following: the transaction processing nodes (i.e. the transaction processing nodes included in the target transaction tracking path) through which the transaction passes in the processing procedure, each transaction processing node receives the time required by the request of the previous transaction processing node to the request of the next transaction processing node (i.e. the transaction processing time of each transaction processing node), and the feedback result (i.e. the response state of each transaction processing node) of the request of the next transaction processing node to the previous transaction processing node and the transaction field information of the transaction data of each transaction processing node.
In this embodiment, after the target transaction tracking path is completed, the transaction tracking path of the transaction and the transaction processing performance information of the transaction at each transaction processing node may be displayed in a visual form, and the display effect diagram is shown in fig. 5.
Taking fig. 5 as an example for illustration, firstly, determining transaction processing nodes included in a target service according to a target service transaction tracking path, and then, from the perspective of application performance monitoring, obtaining transaction processing performance information of each transaction processing node by performing statistical analysis on transaction data corresponding to transaction operations sent by each transaction processing node in the target service transaction tracking path, and displaying the transaction processing performance information by using a waterfall model diagram, as shown in fig. 5. From fig. 5, it is possible to visually observe the respective transaction processing nodes through which the target transaction passes in the transaction trace path, and the transaction processing time of each transaction processing node. In addition, the transaction field information and the response state of the target business at each transaction processing node can be observed, so that the operation and maintenance work is provided with the greatest help.
From the above description, the present application has the following technical effects:
(1) And determining a target service transaction tracking path through the transaction processing node, so as to realize the fine monitoring of the target service. And, the transaction processing nodes include, but are not limited to, various transaction characteristics such as IP address, port, transaction type, transaction return code, etc.
(2) And obtaining target business transaction tracking paths of all the businesses through the piecewise transaction tracking matching. The unified transaction serial number is not required in the target business transaction tracking process, only a unique transaction matching code is required between the first transaction operation entering each transaction processing node and the second transaction operation sent by each transaction processing node, and the requirement on the transaction matching code in the target business transaction tracking process is reduced.
(3) The target business transaction tracking path and the transaction processing performance information of each business can be displayed, and the transaction processing nodes through which the tracked business passes are displayed through a business path diagram; displaying the transaction processing time on each transaction processing node through a waterfall model diagram; and provides transaction field information for each transaction operation tracked.
Embodiment two:
the embodiment of the invention also provides a service path determining device which is mainly used for executing the service path determining method provided by the embodiment of the invention, and the service path determining device provided by the embodiment of the invention is specifically introduced below.
Fig. 6 is a schematic diagram of a traffic path determining apparatus according to an embodiment of the present invention, and as shown in fig. 6, the traffic path determining apparatus mainly includes a first determining unit 10, a second determining unit 20, and a matching unit 30, wherein:
a first determining unit 10 for determining a plurality of transaction processing nodes for processing a target service;
a second determining unit 20, configured to determine transaction data of a transaction operation corresponding to each transaction processing node; the transaction operation comprises a first transaction operation entering a current transaction processing node and a second transaction operation sent by the current transaction processing node, and the transaction data comprises various network fields and various transaction characteristic fields;
a matching unit 30, configured to perform a matching operation on a first transaction operation entered into each transaction processing node and a second transaction operation sent out by each transaction processing node according to a transaction characteristic field in the transaction data, so as to obtain a target transaction tracking path, where the transaction characteristic field includes at least one of the following: user ID, topic ID and genre ID.
In an embodiment of the present invention, a plurality of transaction processing nodes for processing a target service are first determined; then determining transaction data of the transaction operation corresponding to each transaction processing node; and finally, matching the first transaction operation entering each transaction processing node with the second transaction operation sent by each transaction processing node according to the transaction characteristic field in the transaction data, thereby obtaining a target business transaction tracking path. In this embodiment, by matching the first transaction operation and the second transaction operation through the transaction feature field, when the first transaction operation entering each transaction processing node and the second transaction operation sent by each transaction processing node are matched based on the transaction data, the requirement of the matching code is reduced, so that powerful help is provided for timely finding and positioning the application performance fault, and the technical problem of poor path tracking performance caused by non-uniform transaction serial numbers in the traditional transaction path tracking method is solved.
Alternatively, the second determining unit 20 is configured to: sending a call request to a target database; wherein the call request is to call transaction data of each transaction processing node; and acquiring response information which is fed back by the target database based on the calling request and carries the transaction data.
Optionally, the second determining unit 20 is further configured to: acquiring target data of at least one service, wherein the target data comprises: network traffic data packets, or transaction flow log data; and analyzing the network flow data packet to obtain transaction data of the transaction operation corresponding to each transaction processing node.
Alternatively, the matching unit 30 is configured to: determining a transaction matching code of a first transaction operation of each transaction processing node and a second transaction operation sent by each transaction processing node to obtain the first transaction matching code and the second transaction matching code; and matching the first transaction operation with the second transaction operation according to the first transaction matching code and the second transaction matching code.
Optionally, the first transaction matching code and the second transaction matching code include any one of the following: the first transaction matching code and the second transaction matching code are fields with the same or different field names and the same field content; or the first transaction matching code comprises at least one first field, the second transaction matching code comprises at least one second field, and the field content of the at least one first field is matched with the field content of the at least one second field; or the first transaction matching code is a partial field in the first field, and the second transaction matching code is a second field, wherein the partial field in the first field and the field content of the second field are the same.
Optionally, if the first transaction operation is plural and the second transaction operation is plural; the matching unit 30 is further adapted to: determining a second transaction matching code which is the same as the current first transaction matching code in a plurality of second transaction matching codes aiming at each first transaction matching code; if the same second transaction matching code is determined, establishing an association relationship between the current first transaction matching code and the matched same second transaction matching code; if the same second transaction matching code is not determined, determining that the business transaction tracking path corresponding to the current first transaction matching code is ended.
Optionally, the matching unit 30 is further configured to: searching node attribute information of each transaction processing node in a target mapping table; and determining a transaction matching code of a first transaction operation of each transaction processing node and a second transaction operation sent by each transaction processing node according to the node attribute information.
Optionally, the device is further configured to: performing statistical analysis on the target business transaction tracking path to obtain transaction processing performance information of the target business transaction tracking path at each transaction processing node, wherein the transaction processing performance information comprises at least one of the following: and the target business transaction tracks transaction processing nodes contained in the path, transaction processing time of each transaction processing node, transaction field information of transaction data of each transaction processing node and response state of each transaction processing node.
The device provided by the embodiment of the present invention has the same implementation principle and technical effects as those of the foregoing method embodiment, and for the sake of brevity, reference may be made to the corresponding content in the foregoing method embodiment where the device embodiment is not mentioned.
Embodiment III:
referring to fig. 7, an embodiment of the present invention further provides an electronic device 100, including: a processor 40, a memory 41, a bus 42 and a communication interface 43, the processor 40, the communication interface 43 and the memory 41 being connected by the bus 42; the processor 40 is arranged to execute executable modules, such as computer programs, stored in the memory 41.
The memory 41 may include a high-speed random access memory (RAM, randomAccessMemory) and may further include a non-volatile memory (non-volatile memory), such as at least one magnetic disk memory. The communication connection between the system network element and the at least one other network element is achieved via at least one communication interface 43 (which may be wired or wireless), which may use the internet, a wide area network, a local network, a metropolitan area network, etc.
Bus 42 may be an ISA bus, a PCI bus, an EISA bus, or the like. The buses may be classified as address buses, data buses, control buses, etc. For ease of illustration, only one bi-directional arrow is shown in FIG. 7, but not only one bus or type of bus.
The memory 41 is configured to store a program, and the processor 40 executes the program after receiving an execution instruction, and the method executed by the apparatus for flow defining disclosed in any of the foregoing embodiments of the present invention may be applied to the processor 40 or implemented by the processor 40.
The processor 40 may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuitry in hardware or instructions in software in processor 40. The processor 40 may be a general-purpose processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but may also be a digital signal processor (Digital Signal Processing, DSP for short), application specific integrated circuit (Application Specific Integrated Circuit, ASIC for short), off-the-shelf programmable gate array (Field-Programmable Gate Array, FPGA for short), or other programmable logic device, discrete gate or transistor logic device, discrete hardware components. The disclosed methods, steps, and logic blocks in the embodiments of the present invention may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present invention may be embodied directly in the execution of a hardware decoding processor, or in the execution of a combination of hardware and software modules in a decoding processor. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in a memory 41 and the processor 40 reads the information in the memory 41 and in combination with its hardware performs the steps of the method described above.
In addition, in the description of embodiments of the present invention, unless explicitly stated and limited otherwise, the terms "mounted," "connected," and "connected" are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; can be directly connected or indirectly connected through an intermediate medium, and can be communication between two elements. The specific meaning of the above terms in the present invention will be understood in specific cases by those of ordinary skill in the art.
In the description of the present invention, it should be noted that the directions or positional relationships indicated by the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc. are based on the directions or positional relationships shown in the drawings, are merely for convenience of describing the present invention and simplifying the description, and do not indicate or imply that the devices or elements referred to must have a specific orientation, be configured and operated in a specific orientation, and thus should not be construed as limiting the present invention. Furthermore, the terms "first," "second," and "third" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.
In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. The above-described apparatus embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and there may be other manners of division in actual implementation, and for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer readable storage medium executable by a processor. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Finally, it should be noted that: the above examples are only specific embodiments of the present invention, and are not intended to limit the scope of the present invention, but it should be understood by those skilled in the art that the present invention is not limited thereto, and that the present invention is described in detail with reference to the foregoing examples: any person skilled in the art may modify or easily conceive of the technical solution described in the foregoing embodiments, or perform equivalent substitution of some of the technical features, while remaining within the technical scope of the present disclosure; such modifications, changes or substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention, and are intended to be included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A method for determining a traffic path, comprising:
determining a plurality of transaction processing nodes for processing the target traffic;
determining transaction data of transaction operations corresponding to each transaction processing node; the transaction operation comprises a first transaction operation entering a current transaction processing node and a second transaction operation sent by the current transaction processing node, and the transaction data comprises various network fields and various transaction characteristic fields;
matching the first transaction operation entering each transaction processing node with the second transaction operation sent by each transaction processing node according to the transaction characteristic field in the transaction data, so as to obtain a target business transaction tracking path, wherein the transaction characteristic field comprises at least one of the following: user ID, topic ID and genre ID.
2. The method of claim 1, wherein determining transaction data for the transaction operation corresponding to each transaction processing node comprises:
sending a call request to a target database; wherein the call request is to call transaction data of each transaction processing node;
and acquiring response information which is fed back by the target database based on the calling request and carries the transaction data.
3. The method of claim 1, wherein determining transaction data for the transaction operation for each transaction processing node further comprises:
acquiring target data of at least one service, wherein the target data comprises: network traffic data packets, or transaction flow log data;
and analyzing the network flow data packet to obtain transaction data of the transaction operation corresponding to each transaction processing node.
4. The method of claim 1, wherein matching the first transaction operation entered into each transaction processing node with the second transaction operation issued by each transaction processing node based on the transaction characteristic field in the transaction data comprises:
determining transaction matching codes of a first transaction operation entering each transaction processing node and a second transaction operation sent by each transaction processing node to obtain a first transaction matching code and a second transaction matching code;
and matching the first transaction operation with the second transaction operation according to the first transaction matching code and the second transaction matching code.
5. The method of claim 4, wherein the first transaction matching code and the second transaction matching code comprise any one of:
The first transaction matching code and the second transaction matching code are fields with the same or different field names and the same field content; or alternatively
The first transaction matching code comprises at least one first field, the second transaction matching code comprises at least one second field, and the field content of the at least one first field is matched with the field content of the at least one second field; or alternatively
The first transaction matching code is a part of fields in a first field, and the second transaction matching code is a second field, wherein the part of fields in the first field and the field content of the second field are the same.
6. The method of claim 4, wherein the first transaction operation is a plurality and the second transaction operation is a plurality;
according to the first transaction matching code and the second transaction matching code, performing the matching operation on the first transaction operation and the second transaction operation includes:
determining a second transaction matching code which is the same as the current first transaction matching code in a plurality of second transaction matching codes aiming at each first transaction matching code;
if the same second transaction matching code is determined, establishing an association relationship between the current first transaction matching code and the matched same second transaction matching code;
If the same second transaction matching code is not determined, determining that the business transaction tracking path corresponding to the current first transaction matching code is ended.
7. The method of claim 4, wherein determining a transaction matching code for the first transaction operation of each transaction processing node and the second transaction operation issued by each transaction processing node comprises:
searching node attribute information of each transaction processing node in a target mapping table;
and determining a transaction matching code of a first transaction operation of each transaction processing node and a second transaction operation sent by each transaction processing node according to the node attribute information.
8. The method according to claim 1, wherein the method further comprises:
performing statistical analysis on the target business transaction tracking path to obtain transaction processing performance information of the target business transaction tracking path at each transaction processing node, wherein the transaction processing performance information comprises at least one of the following: and the target business transaction tracks transaction processing nodes contained in the path, transaction processing time of each transaction processing node, transaction field information of transaction data of each transaction processing node and response state of each transaction processing node.
9. A traffic path determining apparatus, comprising:
a first determining unit configured to determine a plurality of transaction processing nodes for processing a target service;
a second determining unit, configured to determine transaction data of a transaction operation corresponding to each transaction processing node; the transaction operation comprises a first transaction operation entering a current transaction processing node and a second transaction operation sent by the current transaction processing node, and the transaction data comprises various network fields and various transaction characteristic fields;
the matching unit is used for carrying out matching operation on the first transaction operation entering each transaction processing node and the second transaction operation sent by each transaction processing node according to the transaction characteristic field in the transaction data so as to obtain a target business transaction tracking path, and the transaction characteristic field comprises at least one of the following: user ID, topic ID and genre ID.
10. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method of any of the preceding claims 1 to 8 when the computer program is executed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010545849.2A CN111784516B (en) | 2020-06-15 | 2020-06-15 | Service path determining method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010545849.2A CN111784516B (en) | 2020-06-15 | 2020-06-15 | Service path determining method and device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111784516A CN111784516A (en) | 2020-10-16 |
| CN111784516B true CN111784516B (en) | 2023-12-22 |
Family
ID=72756579
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010545849.2A Active CN111784516B (en) | 2020-06-15 | 2020-06-15 | Service path determining method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111784516B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112737869A (en) * | 2021-04-02 | 2021-04-30 | 北京宇信科技集团股份有限公司 | Link tracking method and system of ESB (Enterprise service bus) system |
| CN113868089A (en) * | 2021-09-30 | 2021-12-31 | 中国建设银行股份有限公司 | Transaction data processing method and device |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011034298A (en) * | 2009-07-31 | 2011-02-17 | Sumitomo Mitsui Banking Corp | Method for foreign remittance auto process control, and program |
| CN105719072A (en) * | 2016-01-18 | 2016-06-29 | 上海天旦网络科技发展有限公司 | System and method for associating multistage assembly transactions |
| CN110428325A (en) * | 2019-07-31 | 2019-11-08 | 中国工商银行股份有限公司 | Transaction tracking and device |
| CN110502426A (en) * | 2019-07-08 | 2019-11-26 | 中国工商银行股份有限公司 | The test method and device of distributed data processing system |
| CN110795003A (en) * | 2019-10-30 | 2020-02-14 | 邵忠 | Interface display method and device |
| CN111105235A (en) * | 2019-12-31 | 2020-05-05 | 深圳市网心科技有限公司 | Supply chain transaction privacy protection system and method based on block chain and related equipment |
| CN111177246A (en) * | 2019-12-27 | 2020-05-19 | 腾讯云计算（北京）有限责任公司 | Service data processing method and device |
| CN111177252A (en) * | 2019-11-26 | 2020-05-19 | 腾讯云计算（北京）有限责任公司 | Service data processing method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| AUPR384701A0 (en) * | 2001-03-20 | 2001-04-12 | Department of Natural Resources and Environment for and on Behalf of the Crown in Right of the State of Victoria, The | Electronic financial instrument |
-
2020
- 2020-06-15 CN CN202010545849.2A patent/CN111784516B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011034298A (en) * | 2009-07-31 | 2011-02-17 | Sumitomo Mitsui Banking Corp | Method for foreign remittance auto process control, and program |
| CN105719072A (en) * | 2016-01-18 | 2016-06-29 | 上海天旦网络科技发展有限公司 | System and method for associating multistage assembly transactions |
| CN110502426A (en) * | 2019-07-08 | 2019-11-26 | 中国工商银行股份有限公司 | The test method and device of distributed data processing system |
| CN110428325A (en) * | 2019-07-31 | 2019-11-08 | 中国工商银行股份有限公司 | Transaction tracking and device |
| CN110795003A (en) * | 2019-10-30 | 2020-02-14 | 邵忠 | Interface display method and device |
| CN111177252A (en) * | 2019-11-26 | 2020-05-19 | 腾讯云计算（北京）有限责任公司 | Service data processing method and device |
| CN111177246A (en) * | 2019-12-27 | 2020-05-19 | 腾讯云计算（北京）有限责任公司 | Service data processing method and device |
| CN111105235A (en) * | 2019-12-31 | 2020-05-05 | 深圳市网心科技有限公司 | Supply chain transaction privacy protection system and method based on block chain and related equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111784516A (en) | 2020-10-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2021135532A1 (en) | Cloud network vulnerability discovery method, apparatus, electronic device, and medium | |
| CN107633016B (en) | Data processing method and device and electronic equipment | |
| US8751184B2 (en) | Transaction based workload modeling for effective performance test strategies | |
| CN114185708A (en) | Data analysis method and device based on distributed link tracking and electronic equipment | |
| CN111784516B (en) | Service path determining method and device and electronic equipment | |
| US7831709B1 (en) | Flexible grouping for port analysis | |
| RU2631769C2 (en) | Method and device for determining objective of information processing | |
| CN107835132B (en) | Method and device for tracking flow source | |
| CN111181799A (en) | Network traffic monitoring method and equipment | |
| CN111352760B (en) | Data processing method and related device | |
| CN109241733A (en) | Crawler Activity recognition method and device based on web access log | |
| CN108306749B (en) | Monitoring system alarming method, monitoring system and monitoring device | |
| CN111654414A (en) | Application system monitoring method and device and electronic equipment | |
| CN108206769A (en) | Method, apparatus, equipment and the medium of screen quality alarm | |
| CN112463772A (en) | Log processing method and device, log server and storage medium | |
| CN110830500B (en) | Network attack tracking method and device, electronic equipment and readable storage medium | |
| CN114022151A (en) | Block chain data visualization method and system, electronic device and storage medium | |
| CN110599278B (en) | Method, apparatus, and computer storage medium for aggregating device identifiers | |
| CN111767481B (en) | Access processing method, device, equipment and storage medium | |
| CN110825609B (en) | Service testing method, device and system | |
| CN111654405A (en) | Method, device, equipment and storage medium for fault node of communication link | |
| CN108197253B (en) | Equipment query method, device and equipment of cloud monitoring platform | |
| CN114285786B (en) | Construction method and device of network link library | |
| CN114610689A (en) | Method for recording and analyzing request log in distributed environment | |
| CN112738175B (en) | Request processing method and related equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |