CN112433913A - Transaction path generation method, system, computer device and storage medium - Google Patents
Transaction path generation method, system, computer device and storage medium Download PDFInfo
- Publication number
- CN112433913A CN112433913A CN202011321460.6A CN202011321460A CN112433913A CN 112433913 A CN112433913 A CN 112433913A CN 202011321460 A CN202011321460 A CN 202011321460A CN 112433913 A CN112433913 A CN 112433913A
- Authority
- CN
- China
- Prior art keywords
- transaction
- path
- transaction path
- node
- details
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 239000003999 initiator Substances 0.000 claims description 10
- 238000012545 processing Methods 0.000 claims description 9
- 230000004044 response Effects 0.000 claims description 7
- 230000000295 complement effect Effects 0.000 claims description 6
- 238000012544 monitoring process Methods 0.000 abstract description 13
- 238000012423 maintenance Methods 0.000 abstract description 10
- 239000013589 supplement Substances 0.000 abstract description 10
- 238000004458 analytical method Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000004883 computer application Methods 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000153 supplemental effect Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3065—Monitoring arrangements determined by the means or processing involved in reporting the monitored data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0766—Error or fault reporting or storing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/079—Root cause analysis, i.e. error or fault diagnosis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3089—Monitoring arrangements determined by the means or processing involved in sensing the monitored data, e.g. interfaces, connectors, sensors, probes, agents
- G06F11/3093—Configuration details thereof, e.g. installation, enabling, spatial arrangement of the probes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/32—Monitoring with visual or acoustical indication of the functioning of the machine
- G06F11/323—Visualisation of programs or trace data
Abstract
The present disclosure provides a transaction path generation method, system, computer device and storage medium. The method comprises the following steps: grouping the transaction details according to the global event tracking number; generating at least one first transaction path for the transaction details in each group according to a series rule; taking one transaction path containing the maximum number of nodes in the first transaction path as a main transaction path, and taking the rest first transaction paths as slave transaction paths; and aiming at the transaction details which are not connected in series to the first transaction path in the group, and the slave transaction path, the slave transaction path is connected with the main transaction path according to the supplement rule, so that the unique transaction path of each group is obtained. The transaction path generation method provided by the disclosure determines grouping of the transaction details based on the global event tracking number, and further connects all the transaction details in the group according to the series rule and the supplement rule to obtain a complete and reliable unique transaction path, so that operation and maintenance personnel can realize high-reliability transaction tracking and monitoring based on the transaction path.
Description
Technical Field
The present invention relates to the field of computer application technologies, and in particular, to a transaction path generation method, a transaction path generation system, a computer device, and a storage medium.
Background
The large-scale banking business is complex, the transaction links are numerous, and how to obtain the business transaction path of the business is important, so that operation and maintenance personnel can timely position and analyze the fault root and the business influence range according to the transaction path and the transaction indexes.
The existing method for acquiring the transaction path comprises a transaction-based global event tracking number and generates the transaction path according to a series rule, however, under the condition that details with the same global event tracking number cannot be all connected in series to form a transaction path, a complete and reliable transaction path cannot be directly generated, and operation and maintenance personnel cannot realize accurate and comprehensive transaction monitoring and fault location based on the transaction path.
Disclosure of Invention
In order to solve the problems or some problems in the prior art, embodiments of the present invention provide a transaction path generation method, a system, a computer device, and a storage medium, where transaction details are grouped based on a global event tracking number, and then all transaction details are connected in a group according to a series rule and a supplement rule, so as to obtain a complete and reliable unique transaction path, thereby enabling an operation and maintenance staff to implement comprehensive and reliable transaction tracking and monitoring based on the transaction path.
According to a first aspect of the present invention, an embodiment of the present invention provides a transaction path generation method, including: grouping the transaction details according to the global event tracking number of the transaction details; generating at least one first transaction path for the transaction details in each group according to a set series rule; taking one transaction path containing the maximum number of nodes in the first transaction path as a main transaction path, and taking the rest first transaction paths as slave transaction paths; and aiming at the transaction details which are not connected in series to the first transaction path in the group and the slave transaction path, connecting the slave transaction path with the main transaction path according to a set supplementary rule to obtain a unique transaction path of each group.
According to the embodiment of the invention, the grouping of the transaction details is determined by using the global event tracking number, the main transaction path and the slave transaction path are generated in the group according to the series rule, and the residual transaction details are connected with the main transaction path and the slave transaction path according to the supplement rule, so that a complete and reliable unique transaction path is obtained, and the operation and maintenance personnel can realize high-reliability transaction tracking and monitoring based on the transaction path.
In some embodiments of the present invention, generating at least one first transaction path according to the set concatenation rule for the transaction details in each group comprises: acquiring an initiator of the transaction as a root node of the first transaction path; inquiring a receiver node corresponding to the root node, and acquiring the transaction details of the receiver node; inquiring a receiver node corresponding to the receiver node aiming at each receiver node, and acquiring the transaction details of the receiver node; and identifying the sequence of each receiver node according to the naming rule of the sub-transaction serial number to obtain the first transaction path.
In some embodiments of the present invention, generating at least one first transaction path for the transaction details in each group according to the set concatenation rule further comprises: when the sub-transaction serial numbers are incorrect, identifying the sequence of each receiver node on the first transaction path by using a transaction code; and when the transaction codes are the same, determining the sequence of the transaction codes on the first transaction path according to the starting time of the transaction details of each receiver node.
In some embodiments of the present invention, for a transaction detail in a packet that is not serially connected to the first transaction path, and the slave transaction path is connected to the master transaction path according to a set complementary rule, obtaining a unique transaction path for each packet includes: serially connecting the transaction detail which is not serially connected to the first transaction path in the group with the slave transaction path according to the time stamp sequence of the transaction detail to obtain a second transaction path; and connecting the second transaction path with the main transaction path according to the time stamp sequence of the transaction details.
In some embodiments of the invention, connecting the second transaction path to the primary transaction path according to a time-stamped order of transaction detail comprises: searching all leaf nodes of the main transaction path; when only one first node which does not contain leaf nodes exists in the main transaction path, taking a father node of the first node as a connection point; when more than one second node which does not contain leaf nodes exists in the main transaction path, searching the father node of the second node, and selecting the father node with the minimum timestamp in the father node of the second node as a connection point; and connecting the transaction detail with the first order in the second path to the connection point.
In some embodiments of the invention, the transaction path generation method further comprises: the following indices for each unique transaction path are calculated: the transaction amount, the transaction amount corresponding to each branch code, the average response time, the system success rate, the service success rate, the long transaction number and the long transaction rate; the following indices are calculated for each node on each unique transaction path: the transaction amount, the transaction amount corresponding to each branch code, the average processing time, the system success rate and the service success rate; and converging each unique transaction path and each index thereof to generate a transaction line topology.
According to the embodiment of the invention, by calculating the index of each unique transaction path and the index of each node on each transaction path and generating the transaction line topology for displaying, a transaction analysis basis with high reliability and global property can be provided, so that the transaction monitoring and fault positioning are more accurate.
According to a second aspect of the present invention, an embodiment of the present invention provides a transaction path generating system, including: the grouping module is used for grouping the transaction details according to the global event tracking number of the transaction details; the first transaction path generation module is used for generating at least one first transaction path for the transaction details in each group according to a set series rule; the first transaction path generation module is further used for taking one transaction path containing the maximum number of nodes in the first transaction path as a main transaction path, and taking the rest first transaction paths as slave transaction paths; and the unique transaction path generation module is used for connecting the slave transaction path and the main transaction path according to a set supplementary rule aiming at the transaction details which are not connected in series to the first transaction path in the group and the slave transaction path to obtain the unique transaction path of each group.
According to the embodiment of the invention, the grouping of the transaction details is determined by using the global event tracking number, the main transaction path and the slave transaction path are generated in the group according to the series rule, and the residual transaction details are connected with the main transaction path and the slave transaction path according to the supplement rule, so that a complete and reliable unique transaction path is obtained, and the operation and maintenance personnel can realize high-reliability transaction tracking and monitoring based on the transaction path.
In some embodiments of the present invention, generating at least one first transaction path according to the set concatenation rule for the transaction details in each group comprises: acquiring an initiator of the transaction as a root node of the first transaction path; inquiring a receiver node corresponding to the root node, and acquiring the transaction details of the receiver node; inquiring a receiver node corresponding to the receiver node aiming at each receiver node, and acquiring the transaction details of the receiver node; and identifying the sequence of each receiver node according to the naming rule of the sub-transaction serial number to obtain the first transaction path.
In some embodiments of the present invention, generating at least one first transaction path for the transaction details in each group according to the set concatenation rule further comprises: when the sub-transaction serial numbers are incorrect, identifying the sequence of each receiver node on the first transaction path by using a transaction code; and when the transaction codes are the same, determining the sequence of the transaction codes on the first transaction path according to the starting time of the transaction details of each receiver node.
In some embodiments of the present invention, for a transaction detail in a packet that is not serially connected to the first transaction path, and the slave transaction path is connected to the master transaction path according to a set complementary rule, obtaining a unique transaction path for each packet includes: serially connecting the transaction detail which is not serially connected to the first transaction path in the group with the slave transaction path according to the time stamp sequence of the transaction detail to obtain a second transaction path; and connecting the second transaction path with the main transaction path according to the time stamp sequence of the transaction details.
In some embodiments of the invention, connecting the second transaction path to the primary transaction path according to a time-stamped order of transaction detail comprises: searching all leaf nodes of the main transaction path; when only one first node which does not contain leaf nodes exists in the main transaction path, taking a father node of the first node as a connection point; when more than one second node which does not contain leaf nodes exists in the main transaction path, searching the father node of the second node, and selecting the father node with the minimum timestamp in the father node of the second node as a connection point; and connecting the transaction detail with the first order in the second path to the connection point.
In some embodiments of the invention, the transaction path generation method further comprises: the following indices for each unique transaction path are calculated: the transaction amount, the transaction amount corresponding to each branch code, the average response time, the system success rate, the service success rate, the long transaction number and the long transaction rate; the following indices are calculated for each node on each unique transaction path: the transaction amount, the transaction amount corresponding to each branch code, the average processing time, the system success rate and the service success rate; and converging each unique transaction path and each index thereof to generate a transaction line topology.
According to the embodiment of the invention, by calculating the index of each unique transaction path and the index of each node on each transaction path and generating the transaction line topology for displaying, a transaction analysis basis with high reliability and global property can be provided, so that the transaction monitoring and fault positioning are more accurate.
According to a third aspect of the present invention, an embodiment of the present invention provides a computer storage medium having computer-readable instructions stored thereon, which, when executed by a processor, cause a computer to perform the following operations: the operation includes the steps included in the transaction path generation method according to any one of the above embodiments.
According to a fourth aspect of the present invention, the present invention provides a computer device including a memory and a processor, the memory being used for storing one or more computer instructions, wherein the one or more computer instructions, when executed by the processor, can implement the transaction path generation method according to any one of the above embodiments.
As can be seen from the above description, the transaction path generation method, the transaction path generation system, the related computer storage medium, and the related computer storage device according to the embodiments of the present invention group the transaction details based on the global event tracking number, and respectively connect all the transaction details in each group according to the concatenation rule and the supplement rule to obtain a complete and reliable unique transaction path, so that comprehensive and reliable transaction monitoring and fault location can be achieved based on the transaction path.
Drawings
FIG. 1 is a schematic flow diagram of a transaction path generation method according to one embodiment of the invention;
FIG. 2 is a schematic flow diagram of a transaction path generation method according to another embodiment of the invention;
fig. 3 is an architecture diagram of a transaction path generation system according to one embodiment of the invention.
Detailed Description
Various aspects of the invention are described in detail below with reference to the figures and the detailed description. Well-known modules, units and their interconnections, links, communications or operations with each other are not shown or described in detail. Furthermore, the described features, architectures, or functions can be combined in any manner in one or more implementations. It will be understood by those skilled in the art that the various embodiments described below are illustrative only and are not intended to limit the scope of the present invention. It will also be readily understood that the modules or units or processes of the embodiments described herein and illustrated in the figures can be combined and designed in a wide variety of different configurations.
The terms used herein are briefly described below.
spark: a fast general purpose computing engine designed specifically for large scale data processing.
ELK: acronyms for the three open source software, Elasticsearch, Logstash, Kibana. The Elasticsearch is a distributed, high-expansion and high-real-time search and data analysis engine, the logstack is a platform for transmission, processing, management and search of application program logs and events, and the Kibana is an open-source analysis and visualization platform.
Kafka: distributed, partitioned, multi-replica, multi-subscriber, zookeeper coordination based distributed log systems (which may also be considered message queue MQ systems), commonly available for web/nginx logs, access logs, message services, and the like. The main application scenarios are as follows: a log collection system and a messaging system.
ZooKeeper: distributed, open source distributed application coordination services.
glb: the serial number (global event tracking number) is used for uniquely identifying and tracking an event (transaction/affair) and all levels of sub-events (sub-transactions/sub-affairs) triggered by the event.
Seq: the sub-transaction sequence number.
St: a time stamp.
Fig. 1 is a flow chart illustrating a transaction path generation method according to an embodiment of the present invention.
As shown in fig. 1, in one embodiment of the present invention, a transaction path generating method may include: step S11, step S12, step S13, and step S14, which are described in detail below.
In step S11, the transaction details are grouped according to their global event tracking number. In an optional implementation manner, the global event tracking number is a serial number which is generated when a transaction initiator node triggers a transaction and is used for uniquely identifying the transaction, and is inherited by each receiver node which subsequently processes the transaction, and for the transaction, the transaction initiator node and each receiver node generate corresponding transaction messages according to a transaction message specification. In other words, the same transaction event/transaction inherits the same global event tracking number when each platform, each component or each transaction flow is processed, and if one event triggers a plurality of sub-events, the sub-events also inherit the same global event tracking number.
In step S12, at least one first transaction path is generated for the transaction details in each group according to the set concatenation rule.
In an alternative embodiment, generating at least one first transaction path according to the set concatenation rule for the transaction details in each group may be implemented by:
(1) acquiring an initiator of the transaction as a root node of the first transaction path;
(2) inquiring a receiver node corresponding to the root node, and acquiring the transaction details of the receiver node;
(3) inquiring a receiver node corresponding to the receiver node aiming at each receiver node, and acquiring the transaction details of the receiver node;
(4) and identifying the sequence of each receiver node according to the naming rule of the sub-transaction serial number to obtain the first transaction path.
Optionally, when the sub-transaction serial number is incorrect, identifying the sequence of each receiver node on the first transaction path by using a transaction code; and when the transaction codes are the same, determining the sequence of the transaction codes on the first transaction path according to the starting time of the transaction details of each receiver node.
In step S13, one of the first transaction paths including the transaction path with the largest number of nodes is used as a master transaction path, and the rest of the first transaction paths are used as slave transaction paths.
In step S14, for the transaction details that are not concatenated to the first transaction path in the group, and the slave transaction path, the slave transaction path is connected to the master transaction path according to the set supplementary rule, so as to obtain a unique transaction path for each group.
In an optional embodiment, for the transaction details in the packet that are not serially connected to the first transaction path, and the slave transaction path, which is connected to the master transaction path according to the set complementary rule, the obtaining of the unique transaction path for each packet may specifically include: serially connecting the transaction detail which is not serially connected to the first transaction path in the group with the slave transaction path according to the time stamp sequence of the transaction detail to obtain a second transaction path; and connecting the second transaction path with the main transaction path according to the time stamp sequence of the transaction details.
In other optional embodiments, connecting the second transaction path with the main transaction path according to the time stamp sequence of the transaction details may specifically include: searching all leaf nodes of the main transaction path; when only one first node which does not contain leaf nodes exists in the main transaction path, taking a father node of the first node as a connection point; when more than one second node which does not contain leaf nodes exists in the main transaction path, searching the father node of the second node, and selecting the father node with the minimum timestamp in the father node of the second node as a connection point; and connecting the transaction detail with the first order in the second path to the connection point.
By adopting the method of the embodiment of the invention, all transaction details can be grouped according to the global event tracking number, and then the transaction details are connected in each group according to the series rule and the supplement rule, so that a complete and reliable unique transaction path is obtained, and operation and maintenance personnel can realize high-reliability transaction tracking and monitoring based on the transaction path.
In an alternative embodiment, the following metrics for each unique transaction path are calculated: the transaction amount, the transaction amount corresponding to each branch code, the average response time, the system success rate, the service success rate, the long transaction number and the long transaction rate; the following indices are calculated for each node on each unique transaction path: the transaction amount, the transaction amount corresponding to each branch code, the average processing time, the system success rate and the service success rate; and converging each unique transaction path and each index thereof to generate a transaction line topology.
By calculating the indexes of each unique transaction path and the indexes of each node on each transaction path, generating the transaction line topology for displaying, a transaction analysis basis with high reliability and global property can be provided, so that the transaction monitoring and fault positioning are more accurate.
Fig. 2 is a flow chart illustrating a transaction path generation method according to another embodiment of the present invention.
As shown in fig. 2, in an embodiment of the present invention, a transaction path generating method may include: step S21, step S22, step S23, step S24, and step S25, which are specifically described below.
In step S21, hundreds of systems, thousands of transaction services, and billions of detailed data are obtained in real time by combining the technical scheme of the big data stream type computing engine spark and ELK.
In step S22, it is checked whether glb, status code, and error code meet the new generation specification for the consumption transaction details in Kafka, and a calculation window interval of the transaction details, i.e., a 10-bit timestamp of long type (long integer data), is calculated according to the 10 th bit to the 19 th bit in glb.
In step S23, the transaction details are aggregated according to a predetermined period and then grouped according to the global event tracking number. Optionally, transaction details are not summarized one time in ten minutes and transaction details with the same global event tracking number are grouped into the same group.
In step S24, a transaction path is obtained according to the concatenation rule and the supplemental rule.
In an alternative embodiment, the transaction path is obtained according to the following method:
firstly, the transaction details in the same group are connected in series into a single transaction according to fields such as a security node number, an initiator security node number, a sender security node number, a receiver security node number, a sub-transaction sequence number, a transaction code, a start time and the like. Wherein, the series rule can be set as follows:
(1) acquiring a root node of a transaction path, namely an initiator of a transaction;
(2) traversing the receiver node of the node, and finding all the transaction details corresponding to the receiver node;
(3) and (3) repeating the step (2) for each receiver node until the receiver node of the node is empty or the transaction details of the receiver node cannot be found.
(4) When the elements in the receiver list of one node are more than 1, identifying the sequence of the receiver nodes according to the naming rule of the sub-transaction sequence numbers; when the sub-transaction serial number is incorrect, the transaction codes are used for distinguishing the sequence, and if the transaction codes are the same, the outbound transaction sequence is determined according to the starting time.
Secondly, transaction details of a single transaction path which cannot be directly obtained according to the series rule in the same group are forcibly connected to one transaction path which is obtained according to the series rule according to the supplementary rule. Wherein, the supplement rule can be set as follows:
(1) taking one transaction path containing the maximum number of nodes in the transaction paths obtained according to the series rule as a main transaction path, and taking the rest transaction paths as slave transaction paths;
(2) connecting the residual transaction details in a group in series according to a series connection rule with the slave transaction paths obtained in the step (1) in series according to the time stamp sequence of the transaction details to obtain a second transaction path;
(3) and connecting the second transaction path with the main transaction path according to the time stamp of the first transaction detail on the second transaction path and the time stamp sequence of the transaction detail corresponding to each node on the main transaction path to obtain a final unique transaction path.
In an alternative embodiment, the method of connecting the second transaction path with the main transaction path may comprise: searching all leaf nodes of the main transaction path; when only one first node which does not contain leaf nodes exists in the main transaction path, taking a father node of the first node as a connection point; when more than one second node which does not contain leaf nodes exists in the main transaction path, searching the father node of the second node, and selecting the father node with the minimum timestamp in the father node of the second node as a connection point; and connecting the transaction detail with the first order in the second path to the connection point.
The present invention provides an example of forced connection according to the above step S24, so as to implement that all transaction details in the same group are connected to obtain a unique transaction path:
the total number of the global event tracking numbers in a certain packet is 10 details (A1, A2 … … A10), the global event tracking numbers can be connected in series according to the series rule A1-A7, the rest A8 and A9 have the relation of A8- > A9 (namely, A8 and A9 can be connected in series), and A10 is an isolated node. A1-A7 are main transaction paths, A8- > A9 is a slave transaction path, and A10 is the rest of nodes, the rules of the three parts connected in series to form a transaction path are as follows:
first, A8- > A9 and A10 are connected according to the timestamp size relationship of A8 and A10. For example, if the timestamp of A8 is less than a10, connecting a10 to A8- > a9 would result in A8- > a9- > a10 as the second transaction path.
Second, the second transaction path (A8- > A9- > A10) is connected into the main transaction path (A1-A7) according to the timestamp size. Specifically, the rule after searching which node of the main transaction path the first node should be connected to on the second transaction path is: searching all leaf nodes of the main transaction path to be connected, and if one node exists and only one node does not find a relevant node, connecting to a parent node of the node; if a plurality of docNotFound nodes exist, searching the father nodes of all the docNotFound nodes; if a plurality of father nodes exist, comparing the smallest seq (son transaction serial number) of all the father nodes as a connection point; if seq is the same or not, the connection point with the smallest st (timestamp) is selected.
In step S25, a transaction index is acquired. Specifically, first, indexes of each unique transaction path are calculated, and the indexes to be calculated may include, but are not limited to, one or more of the following indexes: the transaction amount, the transaction amount corresponding to each branch code, the average response time, the system success rate, the service success rate, the long transaction number and the long transaction rate. Secondly, calculating each index of each node on each unique transaction path, wherein each index needing to be calculated can include but is not limited to one or more of the following indexes: the transaction amount, the transaction amount corresponding to each branch code, the average processing time, the system success rate and the service success rate. And finally, converging each unique transaction path and each index thereof to generate a transaction line topology.
The transaction amount may include, but is not limited to, the following: the transaction amount corresponding to different deployment units, the transaction amount corresponding to different last-level menus and the transaction amount corresponding to different branch code menus.
In step S26, the operation and maintenance staff performs highly reliable transaction tracking and monitoring according to the unique transaction path and the transaction index.
By adopting the method of the embodiment of the invention, all transaction details can be grouped according to the global event tracking number, and then the transaction details are connected in each group according to the series rule and the supplement rule, so that a complete and reliable unique transaction path is obtained, and the operation and maintenance personnel can realize comprehensive and reliable transaction monitoring and fault positioning based on the transaction path.
Fig. 3 is an architecture diagram of a transaction path generation system according to one embodiment of the invention.
As shown in fig. 3, the transaction path generating system includes:
and the grouping module 310 is configured to group the transaction details according to the global event tracking number of the transaction details.
The first transaction path generating module 320 is configured to generate at least one first transaction path for the transaction details in each group according to a set concatenation rule; and taking one transaction path containing the maximum number of nodes in the first transaction path as a main transaction path, and taking the rest first transaction paths as slave transaction paths.
In an alternative embodiment, generating at least one first transaction path according to the set concatenation rule for the transaction details in each group may be implemented by:
(1) acquiring an initiator of the transaction as a root node of the first transaction path;
(2) inquiring a receiver node corresponding to the root node, and acquiring the transaction details of the receiver node;
(3) inquiring a receiver node corresponding to the receiver node aiming at each receiver node, and acquiring the transaction details of the receiver node;
(4) and identifying the sequence of each receiver node according to the naming rule of the sub-transaction serial number to obtain the first transaction path.
Optionally, when the sub-transaction serial number is incorrect, identifying the sequence of each receiver node on the first transaction path by using a transaction code; and when the transaction codes are the same, determining the sequence of the transaction codes on the first transaction path according to the starting time of the transaction details of each receiver node.
And the unique transaction path generating module 330 is configured to, for the transaction details that are not serially connected to the first transaction path in the packet and the slave transaction path, connect with the master transaction path according to a set supplementary rule to obtain a unique transaction path for each packet.
In an optional embodiment, for the transaction details in the packet that are not serially connected to the first transaction path, and the slave transaction path, which is connected to the master transaction path according to the set complementary rule, the obtaining of the unique transaction path for each packet may specifically include: serially connecting the transaction detail which is not serially connected to the first transaction path in the group with the slave transaction path according to the time stamp sequence of the transaction detail to obtain a second transaction path; and connecting the second transaction path with the main transaction path according to the time stamp sequence of the transaction details.
In other optional embodiments, connecting the second transaction path with the main transaction path according to the time stamp sequence of the transaction details may specifically include: searching all leaf nodes of the main transaction path; when only one first node which does not contain leaf nodes exists in the main transaction path, taking a father node of the first node as a connection point; when more than one second node which does not contain leaf nodes exists in the main transaction path, searching the father node of the second node, and selecting the father node with the minimum timestamp in the father node of the second node as a connection point; and connecting the transaction detail with the first order in the second path to the connection point.
A transaction line topology generation module 340 for performing the following operations: the following indices for each unique transaction path are calculated: the transaction amount, the transaction amount corresponding to each branch code, the average response time, the system success rate, the service success rate, the long transaction number and the long transaction rate; the following indices are calculated for each node on each unique transaction path: the transaction amount, the transaction amount corresponding to each branch code, the average processing time, the system success rate and the service success rate; and converging each unique transaction path and each index thereof to generate a transaction line topology.
By adopting the transaction path generation system of the embodiment of the invention, all transaction details are firstly grouped according to the global event tracking number, and then the transaction details are connected in each group according to the series rule and the supplement rule, so that a complete and reliable unique transaction path is obtained, and operation and maintenance personnel can realize comprehensive and reliable transaction monitoring and fault positioning based on the transaction path.
Through the above description of the embodiments, those skilled in the art will clearly understand that the present invention can be implemented by combining software and a hardware platform. With this understanding in mind, all or part of the technical solutions of the present invention that contribute to the background can be embodied in the form of a software product, which can be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., and includes instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods according to the embodiments or some parts of the embodiments.
Correspondingly, the embodiment of the invention also provides a computer readable storage medium, on which computer readable instructions or a program are stored, and when the computer readable instructions or the program are executed by a processor, the computer is enabled to execute the following operations: the operation includes the steps included in the transaction path generating method according to any of the above embodiments, and details are not repeated here. Wherein the storage medium may include: such as optical disks, hard disks, floppy disks, flash memory, magnetic tape, etc.
In addition, the present invention also provides a computer device including a memory and a processor, where the memory is used for storing one or more computer instructions or programs, and when the processor executes the one or more computer instructions or programs, the transaction path generation method according to any one of the above embodiments can be implemented. The computer device may be, for example, a server, a desktop computer, a notebook computer, or the like.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solutions of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may be modified or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention. Therefore, the protection scope of the present invention should be subject to the claims.
Claims (14)
1. A transaction path generation method is characterized by comprising the following steps:
grouping the transaction details according to the global event tracking number of the transaction details;
generating at least one first transaction path for the transaction details in each group according to a set series rule;
taking one transaction path containing the maximum number of nodes in the first transaction path as a main transaction path, and taking the rest first transaction paths as slave transaction paths;
and aiming at the transaction details which are not connected in series to the first transaction path in the group and the slave transaction path, connecting the slave transaction path with the main transaction path according to a set supplementary rule to obtain a unique transaction path of each group.
2. The transaction path generation method of claim 1, wherein generating at least one first transaction path for the transaction details in each group according to the set concatenation rule comprises:
acquiring an initiator of the transaction as a root node of the first transaction path;
inquiring a receiver node corresponding to the root node, and acquiring the transaction details of the receiver node;
inquiring a receiver node corresponding to the receiver node aiming at each receiver node, and acquiring the transaction details of the receiver node;
and identifying the sequence of each receiver node according to the naming rule of the sub-transaction serial number to obtain the first transaction path.
3. The transaction path generation method of claim 2, wherein generating at least one first transaction path for the transaction details in each group according to the set concatenation rule further comprises:
when the sub-transaction serial numbers are incorrect, identifying the sequence of each receiver node on the first transaction path by using a transaction code;
and when the transaction codes are the same, determining the sequence of the transaction codes on the first transaction path according to the starting time of the transaction details of each receiver node.
4. The transaction path generation method of claim 3, wherein for the transaction details in the group that are not serially connected to the first transaction path, and the slave transaction path is connected to the master transaction path according to the set complementary rule, obtaining the unique transaction path for each group comprises:
serially connecting the transaction detail which is not serially connected to the first transaction path in the group with the slave transaction path according to the time stamp sequence of the transaction detail to obtain a second transaction path;
and connecting the second transaction path with the main transaction path according to the time stamp sequence of the transaction details.
5. The transaction path generation method of claim 4, wherein connecting the second transaction path with the primary transaction path according to a time-stamped order of transaction detail comprises:
searching all leaf nodes of the main transaction path;
when only one first node which does not contain leaf nodes exists in the main transaction path, taking a father node of the first node as a connection point;
when more than one second node which does not contain leaf nodes exists in the main transaction path, searching the father node of the second node, and selecting the father node with the minimum timestamp in the father node of the second node as a connection point;
and connecting the transaction detail with the first order in the second path to the connection point.
6. The transaction path generation method of claim 5, further comprising:
the following indices for each unique transaction path are calculated: the transaction amount, the transaction amount corresponding to each branch code, the average response time, the system success rate, the service success rate, the long transaction number and the long transaction rate;
the following indices are calculated for each node on each unique transaction path: the transaction amount, the transaction amount corresponding to each branch code, the average processing time, the system success rate and the service success rate;
and converging each unique transaction path and each index thereof to generate a transaction line topology.
7. A transaction path generation system, comprising:
the grouping module is used for grouping the transaction details according to the global event tracking number of the transaction details;
the first transaction path generation module is used for generating at least one first transaction path for the transaction details in each group according to a set series rule;
the first transaction path generation module is further used for taking one transaction path containing the maximum number of nodes in the first transaction path as a main transaction path, and taking the rest first transaction paths as slave transaction paths;
and the unique transaction path generation module is used for connecting the slave transaction path and the main transaction path according to a set supplementary rule aiming at the transaction details which are not connected in series to the first transaction path in the group and the slave transaction path to obtain the unique transaction path of each group.
8. The transaction path generation system of claim 7, wherein generating at least one first transaction path for the transaction details in each group according to the set concatenation rules comprises:
acquiring an initiator of the transaction as a root node of the first transaction path;
inquiring a receiver node corresponding to the root node, and acquiring the transaction details of the receiver node;
inquiring a receiver node corresponding to the receiver node aiming at each receiver node, and acquiring the transaction details of the receiver node;
and identifying the sequence of each receiver node according to the naming rule of the sub-transaction serial number to obtain the first transaction path.
9. The transaction path generation system of claim 8, wherein generating at least one first transaction path for the transaction details in each group according to the set concatenation rules further comprises:
when the sub-transaction serial numbers are incorrect, identifying the sequence of each receiver node on the first transaction path by using a transaction code;
and when the transaction codes are the same, determining the sequence of the transaction codes on the first transaction path according to the starting time of the transaction details of each receiver node.
10. The transaction path generation system of claim 9, wherein for transaction details in a group that are not concatenated to the first transaction path, and the slave transaction path is connected to the master transaction path according to a set complementary rule, obtaining a unique transaction path for each group comprises:
serially connecting the transaction detail which is not serially connected to the first transaction path in the group with the slave transaction path according to the time stamp sequence of the transaction detail to obtain a second transaction path;
and connecting the second transaction path with the main transaction path according to the time stamp sequence of the transaction details.
11. The transaction path generation system of claim 10, wherein connecting the second transaction path with the primary transaction path according to a time-stamped order of transaction detail comprises:
searching all leaf nodes of the main transaction path;
when only one first node which does not contain leaf nodes exists in the main transaction path, taking a father node of the first node as a connection point;
when more than one second node which does not contain leaf nodes exists in the main transaction path, searching the father node of the second node, and selecting the father node with the minimum timestamp in the father node of the second node as a connection point;
and connecting the transaction detail with the first order in the second path to the connection point.
12. The transaction path generation system of claim 11, further comprising a transaction line topology generation module to implement the following:
the following indices for each unique transaction path are calculated: the transaction amount, the transaction amount corresponding to each branch code, the average response time, the system success rate, the service success rate, the long transaction number and the long transaction rate;
the following indices are calculated for each node on each unique transaction path: the transaction amount, the transaction amount corresponding to each branch code, the average processing time, the system success rate and the service success rate;
and converging each unique transaction path and each index thereof to generate a transaction line topology.
13. A computer storage medium storing computer software instructions for execution by a processor to implement the transaction path generation method of any of claims 1-6.
14. A computer device comprising a memory and a processor;
wherein the memory is to store one or more computer instructions that are executed by the processor to implement the transaction path generation method of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011321460.6A CN112433913B (en) | 2020-11-23 | 2020-11-23 | Transaction path generation method, system, computer device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011321460.6A CN112433913B (en) | 2020-11-23 | 2020-11-23 | Transaction path generation method, system, computer device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112433913A true CN112433913A (en) | 2021-03-02 |
| CN112433913B CN112433913B (en) | 2024-04-09 |
Family
ID=74693653
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011321460.6A Active CN112433913B (en) | 2020-11-23 | 2020-11-23 | Transaction path generation method, system, computer device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112433913B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113495982A (en) * | 2021-07-08 | 2021-10-12 | 上海大智觉润实业有限公司 | Transaction node management method and device, computer equipment and storage medium |
| CN113868089A (en) * | 2021-09-30 | 2021-12-31 | 中国建设银行股份有限公司 | Transaction data processing method and device |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070179873A1 (en) * | 2003-04-29 | 2007-08-02 | Solberg Eric L | Transaction allocation |
| 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 |
| CN110895784A (en) * | 2018-08-23 | 2020-03-20 | 京东数字科技控股有限公司 | Data processing method and device |
| CN111192130A (en) * | 2019-12-11 | 2020-05-22 | 中国建设银行股份有限公司 | Method, system, device and storage medium for determining fault source in transaction monitoring |
| CN111210029A (en) * | 2019-12-26 | 2020-05-29 | 中国建设银行股份有限公司 | Device and method for auxiliary analysis of service and related equipment |
| CN111553670A (en) * | 2020-04-28 | 2020-08-18 | 腾讯科技（深圳）有限公司 | Transaction processing method and device and computer readable storage medium |
| CN111724158A (en) * | 2020-05-25 | 2020-09-29 | 中国建设银行股份有限公司 | Transaction path generation method and system, and related computer device and storage medium |
| CN111796955A (en) * | 2020-05-28 | 2020-10-20 | 中国建设银行股份有限公司 | Fault source positioning method, system, device and storage medium |
-
2020
- 2020-11-23 CN CN202011321460.6A patent/CN112433913B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070179873A1 (en) * | 2003-04-29 | 2007-08-02 | Solberg Eric L | Transaction allocation |
| CN110895784A (en) * | 2018-08-23 | 2020-03-20 | 京东数字科技控股有限公司 | Data processing method and device |
| 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 |
| CN111192130A (en) * | 2019-12-11 | 2020-05-22 | 中国建设银行股份有限公司 | Method, system, device and storage medium for determining fault source in transaction monitoring |
| CN111210029A (en) * | 2019-12-26 | 2020-05-29 | 中国建设银行股份有限公司 | Device and method for auxiliary analysis of service and related equipment |
| CN111553670A (en) * | 2020-04-28 | 2020-08-18 | 腾讯科技（深圳）有限公司 | Transaction processing method and device and computer readable storage medium |
| CN111724158A (en) * | 2020-05-25 | 2020-09-29 | 中国建设银行股份有限公司 | Transaction path generation method and system, and related computer device and storage medium |
| CN111796955A (en) * | 2020-05-28 | 2020-10-20 | 中国建设银行股份有限公司 | Fault source positioning method, system, device and storage medium |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113495982A (en) * | 2021-07-08 | 2021-10-12 | 上海大智觉润实业有限公司 | Transaction node management method and device, computer equipment and storage medium |
| CN113495982B (en) * | 2021-07-08 | 2022-10-28 | 上海大智觉润实业有限公司 | Transaction node management method and device, computer equipment and storage medium |
| CN113868089A (en) * | 2021-09-30 | 2021-12-31 | 中国建设银行股份有限公司 | Transaction data processing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112433913B (en) | 2024-04-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106656536B (en) | Method and equipment for processing service calling information | |
| CN109684181B (en) | Alarm root cause analysis method, device, equipment and storage medium | |
| CN112073208B (en) | Alarm analysis method, device, chip system and storage medium | |
| Mi et al. | Toward fine-grained, unsupervised, scalable performance diagnosis for production cloud computing systems | |
| US10303539B2 (en) | Automatic troubleshooting from computer system monitoring data based on analyzing sequences of changes | |
| US11269718B1 (en) | Root cause detection and corrective action diagnosis system | |
| US9009539B1 (en) | Identifying and grouping program run time errors | |
| CN111459766A (en) | Calling chain tracking and analyzing method for micro-service system | |
| CN111724158B (en) | Transaction path generation method, system, related computer equipment and storage medium | |
| CN112433913B (en) | Transaction path generation method, system, computer device and storage medium | |
| EP1279211A2 (en) | Topology-based reasoning apparatus for root-cause analysis of network faults | |
| US11321155B2 (en) | Automatic resource dependency tracking and structure for maintenance of resource fault propagation | |
| CN112968805B (en) | Alarm log processing method and device | |
| US10346281B2 (en) | Obtaining and analyzing a reduced metric data set | |
| CN109284331B (en) | Certificate making information acquisition method based on service data resources, terminal equipment and medium | |
| CN113296991B (en) | Abnormality detection method and device | |
| US9443196B1 (en) | Method and apparatus for problem analysis using a causal map | |
| CN116974805A (en) | Root cause determination method, apparatus and storage medium | |
| CN111694721A (en) | Fault monitoring method and device for microservice | |
| CN108984362A (en) | Log collection method and device, storage medium, electronic equipment | |
| CN115809179A (en) | Alarm method, system, equipment and storage medium based on application performance data | |
| US11838171B2 (en) | Proactive network application problem log analyzer | |
| WO2021249629A1 (en) | Device and method for monitoring communication networks | |
| CN114297037A (en) | Alarm clustering method and device | |
| Cao et al. | Incident management process for the cloud computing environments |
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 |