WO2021051546A1

WO2021051546A1 - Link abnormality recognition method, server and computer-readable storage medium

Info

Publication number: WO2021051546A1
Application number: PCT/CN2019/117338
Authority: WO
Inventors: 洪耿杰
Original assignee: 平安科技（深圳）有限公司
Priority date: 2019-09-16
Filing date: 2019-11-12
Publication date: 2021-03-25
Also published as: CN110737592B; CN110737592A

Abstract

The present application relates to the technical field of data processing. Disclosed is a link abnormality recognition method. The method comprises: acquiring, according to a link tracking ID corresponding to an abnormal request, a plurality of pieces of software module information of one or more service systems called when a second server processes the abnormal request; sorting a plurality of software module identifiers and interface identifiers according to a first preset rule and splicing same to generate a data number; and comparing the data number with a preconstructed prefix tree, so as to recognize an abnormal software module identifier and an abnormal interface identifier. Further disclosed are a server and a computer-readable storage medium. By means of the present application, the accurate tracing and positioning of an abnormal software module and an abnormal interface in an application calling process are realized.

Description

Method for identifying link abnormality, server and computer readable storage medium

Based on the Paris Convention, this application declares that it enjoys the priority of the Chinese patent application filed on September 16, 2019, with the application number CN201910878476.8 and titled "A method for link anomaly identification, server and computer-readable storage medium". The entire content of the Chinese patent application is incorporated into this application by reference.

Technical field

This application relates to the field of data processing technology, and in particular to a link abnormality identification method, a server and a computer-readable storage medium.

Background technique

With the popularity of microservice frameworks, the implementation of Internet services is becoming more and more complex. An Internet request (for example, a search service request) often involves multiple services. Internet applications are built on different sets of software modules. These software modules include: It may be developed by different teams, may be implemented in different programming languages, and may be deployed on thousands of servers. At the same time, a software module will provide a large number of interfaces. The link generated by the system per unit time (the server responds to the user’s Request, the multiple software modules and interfaces that are called are connected in series according to the calling sequence. The path formed by the link is thousands of data. When the system is abnormal, it is difficult to accurately locate the abnormal software modules and interfaces.

In summary, how to accurately trace and locate abnormal software modules and interfaces in the application call process has become a technical problem to be solved urgently.

Summary of the invention

In view of the above, it is necessary to provide a link anomaly identification method, which aims to achieve accurate traceability and positioning of abnormal software modules and interfaces during application invocation.

A method for identifying link abnormalities provided in this application includes:

The first obtaining step: obtaining, in real time, abnormal request information that the second server fails to respond normally over timeout, and the abnormal request information includes the link tracking ID corresponding to the abnormal request;

The second obtaining step: obtaining multiple software module information of one or more business systems invoked by the second server when processing the abnormal request according to the link tracking ID corresponding to the abnormal request, where the software module information includes the software module identifier And interface identification, data generation time and link tracking ID;

Recognition step: sort the multiple software module identifiers and interface identifiers according to the first preset rule, splice the sorted software module identifiers and interface identifiers to generate a data number, and combine the data number with the pre-built The prefix tree is compared to identify abnormal software module identifiers and interface identifiers.

In order to achieve the above objective, the present application also provides a first server, the first server includes: a memory, a processor, the memory stores a link abnormality recognition program that can run on the processor, and the link When the path abnormality recognition program is executed by the processor, any steps in the above-mentioned link abnormality recognition method are realized.

The present application also provides a computer-readable storage medium having a link abnormality recognition program stored on the computer-readable storage medium, and the link abnormality recognition program can be executed by one or more processors to realize the above-mentioned link Any step of the anomaly identification method.

Compared with the prior art, this application obtains multiple software module identifiers and interface identifiers of one or more business systems called by the second server when processing the abnormal request according to the link tracking ID corresponding to the abnormal request, and performs Sorting and splicing, generate a data number, and compare the data number with a pre-constructed prefix tree to identify abnormal software module identifiers and interface identifiers. It realizes the accurate traceability and positioning of abnormal software modules and interfaces in the application calling process.

Description of the drawings

FIG. 1 is a schematic diagram of an application environment of an embodiment of the first server of this application;

FIG. 2 is a schematic structural diagram of an embodiment of the first server in FIG. 1;

FIG. 3 is a schematic diagram of an embodiment of a prefix tree constructed in advance in this application;

Fig. 4 is a flowchart of an embodiment of a method for identifying link anomalies according to this application.

detailed description

In order to make the purpose, technical solutions, and advantages of this application clearer, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present application, and are not used to limit the present application. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of this application.

It should be noted that the descriptions related to "first", "second", etc. in this application are only for descriptive purposes, and cannot be understood as indicating or implying their relative importance or implicitly indicating the number of indicated technical features . Therefore, the features defined with "first" and "second" may explicitly or implicitly include at least one of the features. In addition, the technical solutions between the various embodiments can be combined with each other, but it must be based on what can be achieved by a person of ordinary skill in the art. When the combination of technical solutions is contradictory or cannot be achieved, it should be considered that such a combination of technical solutions does not exist. , Is not within the scope of protection required by this application.

As shown in FIG. 1, it is a schematic diagram of the application environment of an embodiment of the first server of this application. In this embodiment, the user sends a request to the second server 2 through the client 3, and the second server 2 responds to the request and sends the result data to the client 3. The first server 1 responds to the request of the second server 2 in real time. Time to monitor.

The first server 1 and the second server 2 can be computing devices such as rack servers, blade servers, tower servers, or cabinet servers. The first server 1 and the second server 2 can be independent servers or multiple servers. A server cluster composed of two servers.

The client 3 can be a desktop computer, a notebook, a tablet computer, a mobile phone, or other terminal devices that can communicate with the first server 1.

In an embodiment of the present application, the first server 1 is used to:

Acquire in real time abnormal request information that the second server 2 fails to respond normally over time, the abnormal request information includes the link tracking ID corresponding to the abnormal request; obtain the second server 2 to handle the abnormality according to the link tracking ID corresponding to the abnormal request Information about multiple software modules of one or more business systems called upon request, where the software module information includes the software module identification and interface identification, the time when the data is generated, and the link tracking ID; Sort the software module identifiers and interface identifiers, splicing the sorted software module identifiers and interface identifiers to generate a data number, and compare the data number with a pre-constructed prefix tree to identify abnormal software Module identification and interface identification.

As shown in FIG. 2, it is a schematic structural diagram of an embodiment of the first server 1 in FIG. 1 of this application.

In this embodiment, the first server 1 includes, but is not limited to, a memory 11, a processor 12, and a network interface 13 that can be communicably connected to each other through a system bus. The memory 11 stores a link abnormality recognition program 10, The link abnormality recognition program 10 can be executed by the processor 12. FIG. 2 only shows the first server 1 with components 11-13 and the link abnormality recognition program 10. Those skilled in the art can understand that the structure shown in FIG. 2 does not constitute a limitation on the first server 1. It may include fewer or more components than shown, or a combination of certain components, or a different component arrangement.

Among them, the memory 11 includes a memory and at least one type of readable storage medium. The memory provides a cache for the operation of the first server 1; the readable storage medium can be, for example, flash memory, hard disk, multimedia card, card-type memory (for example, SD or DX memory, etc.), random access memory (RAM), static random access memory ( Non-volatile storage media such as SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, magnetic disks, and optical disks. In some embodiments, the readable storage medium may be an internal storage unit of the first server 1, for example, the hard disk of the first server 1. In other embodiments, the non-volatile storage medium may also be the first server 1. The external storage device of 1, such as the plug-in hard disk, Smart Media Card (SMC), Secure Digital (SD) card, Flash Card (Flash Card), etc., equipped on the first server 1. In this embodiment, the readable storage medium of the memory 11 is generally used to store the operating system and various application software installed in the first server 1, for example, to store the code of the link abnormality identification program 10 in an embodiment of the present application. In addition, the memory 11 can also be used to temporarily store various types of data that have been output or will be output.

In some embodiments, the processor 12 may be a central processing unit (Central Processing Unit, CPU), a controller, a microcontroller, a microprocessor, or other data processing chips. The processor 12 is generally used to control the overall operation of the first server 1, such as performing data interaction or communication-related control and processing with other devices. In this embodiment, the processor 12 is used to run the program code or processing data stored in the memory 11, for example, to run the link abnormality recognition program 10 and so on.

The network interface 13 may include a wireless network interface or a wired network interface, and the network interface 13 is used to establish a communication connection between the first server 1 and the second server 2.

Optionally, the first server 1 may further include a user interface. The user interface may include a display (Display) and an input unit such as a keyboard (Keyboard). The optional user interface may also include a standard wired interface and a wireless interface. Optionally, in some embodiments, the display may be an LED display, a liquid crystal display, a touch liquid crystal display, an OLED (Organic Light-Emitting Diode, organic light-emitting diode) touch device, etc. Among them, the display can also be appropriately called a display screen or a display unit, which is used to display the information processed in the first server 1 and to display a visualized user interface.

In an embodiment of the present application, when the link anomaly recognition program 10 is executed by the processor 12, the following first acquisition step, second acquisition step, and identification step are implemented.

The first obtaining step: obtaining, in real time, abnormal request information that the second server 2 does not respond normally after a timeout, and the abnormal request information includes the link tracking ID corresponding to the abnormal request.

When the user initiates a request (for example, a search service request) to the second server 2 based on the client 3, the second server 2 generates a random number, and uses a hash algorithm to calculate the random number to generate a unique chain Path tracking ID, the link tracking ID will be recorded in the information of each software module called when the second server 2 processes the request.

When the second server 2 exceeds a preset time threshold (for example, 20 seconds) and has not sent the result data corresponding to a certain request to the client 3, the request is an abnormal request that has not responded normally after a timeout.

The second obtaining step: obtaining, according to the link tracking ID corresponding to the abnormal request, multiple software module information of one or more business systems invoked by the second server 2 when processing the abnormal request, the software module information includes software modules Identification and interface identification, time of data generation, and link tracking ID.

For example, the second server 2 calls the query module, cleaning module, and summary module when processing a search service request, and the first server 1 obtains the query module, cleaning module, and summary module through the link tracking ID corresponding to the search service request I1082 Module information, the query module information includes: query module identifier S101, query interface identifier A001, link tracking ID I1082, the time point when the query module created the query interface June 4, 2019, 12:05 minutes and 02 seconds; cleaning module information Including: cleaning module identification S102, cleaning interface identification A002, link tracking ID I1082, the time point when the cleaning module created the cleaning interface June 4, 2019, 12:05 minutes and 03 seconds; summary module information includes: summary module identification S103, summary Interface identification A003, link tracking ID I1082, and the time point when the summary module created the summary interface is 12:05:05 on June 4, 2019.

In an embodiment of the present application, the first preset rule is to sort according to the time sequence of data generation.

The time sequence in which the data of each software module information is generated is the sequence in which each software module and interface is called by the second server 2. For example, according to the chronological order of data generation of query module information, cleaning module information, and summary module information, it can be confirmed that the calling sequence of the second server 2 when processing the search service request is: query module and query interface, cleaning module and cleaning interface, Summary module and summary interface. After the first server splicing the query module identifier and query interface identifier, cleaning module identifier and cleaning interface identifier, summary module identifier and summary interface identifier, the generated data number is S101A001S102A002S103A003.

As shown in FIG. 3, it is a schematic diagram of an embodiment of a prefix tree constructed in advance in this application.

The prefix tree, also known as the dictionary tree, is a multi-way tree structure. It mainly uses the common prefix of the string to improve the query speed and efficiency.

Comparing the data number S101A001S102A002S103A003 with the prefix tree shown in Figure 3, you will find that the data number corresponds to the first branch on the left side of the prefix tree, and the data number only includes the first three nodes after the branch root node , The fourth and fifth nodes are missing. Because the prefix tree is constructed according to the order in which the software modules and interfaces are called by the second server 2, it can be determined that the second server 2 is calling the software module corresponding to the fourth node S104A004 An exception occurred during the interface.

In another embodiment of the present application, the identification step is replaced with:

Sort the multiple software module identifiers and interface identifiers according to the first preset rule, splice the sorted software modules and interface identifiers to generate a data number, and combine the data number with a predetermined regular expression set Make comparisons to identify abnormal software module IDs and interface IDs.

For example, according to the chronological order of data generation of query module information, cleaning module information, and summary module information, it can be confirmed that the calling sequence of the second server 2 when processing the search service request is: query module and query interface, cleaning module and cleaning interface, Summary module and summary interface. After the first server 1 splices the query module identification and the query interface identification, the cleaning module identification and the cleaning interface identification, the summary module identification and the summary interface identification, the generated data number is S101A001S102A002S103A003.

Regular expression is a kind of logical formula for string manipulation. It uses some pre-defined specific characters and the combination of these specific characters to form a "rule string". This "rule string" is used to express the pair of characters. A kind of filtering logic for strings. A regular expression is a text pattern that describes one or more strings to be matched when searching for text.

The following is part of a predetermined set of regular expressions:

^S101A001S102A002S103A003S104A004S104A004$

^S201A101S202A102S203A103$

^(S201A101){2}S202A102S201A101S202A102S203A103$

...

Comparing the data number S101A001S102A002S103A003 with the regular expression set, it is found that the data number corresponds to the first regular expression in the regular expression set. The missing string is "S104A004S105A005", because the regular expression is based on the identification and interface of each software module The identification is generated in the calling sequence, so it can be determined that the second server 2 is abnormal when calling the software module and interface corresponding to S104A104.

In an embodiment of the present application, the construction process of the prefix tree includes:

The third acquiring step: acquiring historical link data in a predetermined database, where the historical link data includes multiple software module information of the one or more business systems called when the second server 2 processes the user request, so The software module information includes software module identification and interface identification, link tracking ID and data generation time.

Grouping step: grouping the multiple software module identifiers and interface identifiers according to a second preset rule.

In an embodiment of the present application, the second preset rule is to group each software module identifier and interface identifier according to the link tracking ID, and group the software module identifiers and interface identifiers that contain the same link tracking ID into the same A group, the software module identifiers and interface identifiers containing different link tracking IDs are grouped into different groups.

For example, the inventory module information in the historical link data (inventory module identification S201, inventory interface identification A101, link tracking ID I2291, the time point when the inventory module created the inventory interface December 1, 2018 12:05 minutes and 02 seconds), Order module information (order module identification S202, order interface identification A102, link tracking ID I2291, the time point when the order module created the order interface December 1, 2018 12:05 minutes and 03 seconds), payment module information (payment module identification S203 , Payment interface identification A103, link tracking ID I2291, the time point when the inventory module created the inventory interface December 1, 2018 12:05:05) contains the same link tracking ID I2291, so the inventory module identification and interface identification, order Module identification and interface identification, payment module identification and interface identification are grouped into the same group. If the link tracking ID of the cleaning module information is 15043, the inventory module identification and interface identification and the cleaning module identification and interface identification are classified into different groups.

Numbering step: sort the multiple software module identifiers and interface identifiers in the same group according to the first preset rule, and splice each group of sorted software module identifiers and interface identifiers to provide each group of software module identifiers and interfaces The identification generates a corresponding data number.

For example, from the data generation sequence of inventory module information, order module information, and payment module information, the calling sequence of the software modules and interfaces corresponding to the link tracking ID I2291 can be determined as inventory module and inventory interface, order module and order interface, payment Module and payment interface. The first server 1 splices the sorted software module identifiers and interface identifier groups, and the generated data numbers are S201A101S202A102S203A103.

In an embodiment of the present application, if the same software module and interface in the same group are called by the second server 2 multiple times, the module identification and interface identification of the software module need to be spliced multiple times according to the time sequence of data generation To generate the data number.

For example, the first server 1 sorts the software module information corresponding to the link tracking ID of I1084 according to the time sequence of data generation: inventory module and inventory interface, inventory module and inventory interface, order module and order interface, inventory Interface and inventory interface, order module and order interface, payment module and payment interface. The inventory module and inventory interface are called three times, the order module is called twice, and the payment module and payment interface are called once. The corresponding data number is S201A101S201A101S202A102S201A101S202A102S203A103.

Construction steps: Construct a prefix tree according to each data number.

In an embodiment of the present application, the constructing a prefix tree according to each data number includes:

B1. Take the user request as the root node of the prefix tree;

B2. Read a data number, and use the first module identifier and interface identifier in the data number as the first-level node after the root node of the prefix tree in the order from left to right, and the second module in the data number The identifier and interface identifier are used as the second-level nodes after the root node of the prefix tree, and so on, until the last module identifier and interface identifier in the data number are used as the leaf nodes of the prefix tree;

B3. Repeat step B2 until all data numbers are added to the prefix tree.

For example, if the data number corresponding to the link tracking ID I2291 is S201A101S202A102S203A103, the user request is the root node of the prefix tree, S201A101 is the first layer node after the prefix tree root node, and S202A102 is the second layer node after the prefix tree root node. S203A103 is the third-level node after the root node of the prefix tree, that is, the leaf node.

In another embodiment of the present application, the process of generating the regular expression set includes a third obtaining step, a grouping step, and a generating step.

Wherein, the third obtaining step and grouping step in the process of generating the regular expression set are the same as the third obtaining step and grouping step in the construction process of the prefix tree described above, and will not be repeated here.

Generation steps: sort the multiple software module IDs and interface IDs in the same group according to the time sequence of data generation, splicing each group of sorted software module IDs and interface IDs, according to the regular expression writing rules for each group The software module identification and interface identification generate a corresponding regular expression.

A regular expression is a text pattern that includes ordinary characters (for example, the letters between a and z) and special characters (called "metacharacters"). "^" means the beginning of a character string, "$" means the end of a character string, and "{}" means the number of times a character or a string of characters repeats.

For example, from the data generation sequence of inventory module information, order module information, and payment module information, the calling sequence of the software modules and interfaces corresponding to the link tracking ID I2291 can be determined as inventory module and inventory interface, order module and order interface, payment Module and payment interface. The first server 1 splices the ordered software module IDs and interface ID groups, and the generated regular expression is ^S201A101S202A102S203A103$.

In an embodiment of the present application, if the same software module and interface in the same group are called by the second server 2 multiple times, the module identification and interface identification of the software module need to be spliced multiple times according to the time sequence of data generation To generate regular expressions.

For example, the first server 1 sorts the software module information corresponding to the link tracking ID of I1084 according to the time sequence of data generation: inventory module and inventory interface, inventory module and inventory interface, order module and order interface, inventory Interface and inventory interface, order module and order interface, payment module and payment interface, where inventory module and inventory interface are called three times, order module is called twice, payment module and payment interface are called once, the corresponding regular expression is ^(S201A101){2}S202A102S201A101S202A102S203A103$.

In an embodiment of the present application, when the link abnormality recognition program 10 is executed by the processor 12, the following steps are further implemented:

Every preset time (for example, one month), the prefix tree is updated according to the historical link data updated in the predetermined database.

As shown in FIG. 4, this is a flowchart of an embodiment of a method for identifying link anomalies according to this application. The method for identifying link anomalies includes steps S1-S3.

S1. Acquire in real time abnormal request information that the second server 2 does not respond normally after a timeout, and the abnormal request information includes a link tracking ID corresponding to the abnormal request.

When the second server 2 has exceeded the preset time threshold (for example, 20 seconds) and has not returned the result data corresponding to a certain request to the client 3, the request is an abnormal request that has not responded normally after a timeout.

S2. Acquire multiple software module information of one or more business systems called by the second server 2 when processing the abnormal request according to the link tracking ID corresponding to the abnormal request, where the software module information includes a software module identifier and an interface Identification, time of data generation, and link tracking ID.

S3. Sort the multiple software module identifiers and interface identifiers according to the first preset rule, splicing the sorted software module identifiers and interface identifiers to generate a data number, and combine the data number with a pre-constructed data number The prefix tree is compared to identify abnormal software module identifiers and interface identifiers.

The following is part of a predetermined set of regular expressions:

^S101A001S102A002S103A003S104A004S104A004$

^S201A101S202A102S203A103$

^(S201A101){2}S202A102S201A101S202A102S203A103$

...

Grouping step: grouping the plurality of software module identifiers and interface identifiers according to a second preset rule.

Construction steps: Construct a prefix tree according to each data number.

B1. Take the user request as the root node of the prefix tree;

B3. Repeat step B2 until all data numbers are added to the prefix tree.

For example, from the data generation sequence of inventory module information, order module information, and payment module information, the calling sequence of the software modules and interfaces corresponding to the link tracking ID I2291 can be determined as inventory module and inventory interface, order module and order interface, payment Module and payment interface. The first server 1 splices the sorted software module identifiers and interface identifier groups, and the generated regular expression is ^S201A101S202A102S203A103$.

In addition, the embodiment of the present application also proposes a computer-readable storage medium. The computer-readable storage medium may be a hard disk, a multimedia card, an SD card, a flash memory card, an SMC, a read-only memory (ROM), an erasable programmable read-only Any one or any combination of memory (EPROM), portable compact disk read-only memory (CD-ROM), USB memory, etc. The computer-readable storage medium includes the link abnormality recognition program 10. The specific implementation of the computer-readable storage medium of this application is substantially the same as the specific implementation of the above-mentioned link abnormality recognition method and the electronic device, and will not be repeated here.

The serial numbers of the foregoing embodiments of the present application are only for description, and do not represent the advantages and disadvantages of the embodiments.

Through the description of the above implementation manners, those skilled in the art can clearly understand that the above-mentioned embodiment method can be implemented by means of software plus the necessary general hardware platform, of course, it can also be implemented by hardware, but in many cases the former is better.的实施方式。 Based on this understanding, the technical solution of this application essentially or the part that contributes to the existing technology can be embodied in the form of a software product, and the computer software product is stored in a storage medium (such as ROM/RAM, magnetic disk, The optical disc) includes several instructions to enable a terminal device (which can be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to execute the method described in each embodiment of the present application.

The above are only the preferred embodiments of the application, and do not limit the scope of the patent for this application. Any equivalent structure or equivalent process transformation made using the content of the description and drawings of the application, or directly or indirectly applied to other related technical fields , The same reason is included in the scope of patent protection of this application.

Claims

A method for identifying link abnormalities, applied to a first server, and the first server is communicatively connected to a second server, characterized in that the method includes:

The first obtaining step: obtaining, in real time, abnormal request information that the second server fails to respond normally over timeout, and the abnormal request information includes the link tracking ID corresponding to the abnormal request;

The second obtaining step: obtaining multiple software module information of one or more business systems invoked by the second server when processing the abnormal request according to the link tracking ID corresponding to the abnormal request, where the software module information includes the software module identifier And interface identification, data generation time and link tracking ID;

Recognition step: sort the multiple software module identifiers and interface identifiers according to the first preset rule, splice the sorted software module identifiers and interface identifiers to generate a data number, and combine the data number with the pre-built The prefix tree is compared to identify abnormal software module identifiers and interface identifiers.
The method for identifying link anomalies according to claim 1, wherein the identifying step is replaced with:

Sort the multiple software module identifiers and interface identifiers according to the first preset rule, splice the sorted software modules and interface identifiers to generate a data number, and combine the data number with a predetermined regular expression set Make comparisons to identify abnormal software module IDs and interface IDs.
The method for identifying link anomalies according to claim 1, wherein the process of constructing the prefix tree comprises:

The third obtaining step: obtaining historical link data in a predetermined database, where the historical link data includes multiple software module information of the one or more business systems invoked when the second server processes a user request, and The software module information includes the software module identification and interface identification, link tracking ID and the time of data generation;

Grouping step: grouping the plurality of software module identifiers and interface identifiers according to a second preset rule;

Numbering step: sort the multiple software module identifiers and interface identifiers in the same group according to the first preset rule, and splice each group of sorted software module identifiers and interface identifiers to provide each group of software module identifiers and interfaces The identification generates a corresponding data number;

Construction steps: Construct a prefix tree according to each data number.
The method for link anomaly identification according to claim 3, wherein said constructing a prefix tree according to each data number comprises:

B1. Take the user request as the root node of the prefix tree;

B2. Read a data number, and use the first module identifier and interface identifier in the data number as the first-level node after the root node of the prefix tree in the order from left to right, and the second module in the data number The identifier and interface identifier are used as the second-level nodes after the root node of the prefix tree, and so on, until the last module identifier and interface identifier in the data number are used as the leaf nodes of the prefix tree;

B3. Repeat step B2 until all data numbers are added to the prefix tree.
The method for identifying link abnormalities according to claim 1 or 2 or 3, wherein the first preset rule is to sort according to the time sequence of data generation.
The method for identifying link abnormalities according to claim 3, wherein the second preset rule is to group software module identifiers and interface identifiers according to the link tracking ID, and group software that includes the same link tracking ID. The module identifiers and interface identifiers are grouped into the same group, and the software module identifiers and interface identifiers containing different link tracking IDs are grouped into different groups.
The method for identifying link anomalies according to claim 3, wherein the method further comprises:

Every preset time, the prefix tree is updated according to the historical link data updated in the predetermined database.
A first server that is communicatively connected to a second server, wherein the first server includes: a memory and a processor, and the memory stores a link abnormality identification that can run on the processor A program, when the link abnormality recognition program is executed by the processor, the following steps are implemented:

The first obtaining step: obtaining, in real time, abnormal request information that the second server fails to respond normally over timeout, and the abnormal request information includes the link tracking ID corresponding to the abnormal request;

The second obtaining step: obtaining multiple software module information of one or more business systems invoked by the second server when processing the abnormal request according to the link tracking ID corresponding to the abnormal request, where the software module information includes the software module identifier And interface identification, data generation time and link tracking ID;

Recognition step: sort the multiple software module identifiers and interface identifiers according to the first preset rule, splice the sorted software module identifiers and interface identifiers to generate a data number, and combine the data number with the pre-built The prefix tree is compared to identify abnormal software module identifiers and interface identifiers.
The first server according to claim 8, wherein the identifying step is replaced with:

Sort the multiple software module identifiers and interface identifiers according to the first preset rule, splice the sorted software modules and interface identifiers to generate a data number, and combine the data number with a predetermined regular expression set Make comparisons to identify abnormal software module IDs and interface IDs.
The first server according to claim 8, wherein the construction process of the prefix tree comprises:

The third obtaining step: obtaining historical link data in a predetermined database, where the historical link data includes multiple software module information of the one or more business systems invoked when the second server processes a user request, and The software module information includes the software module identification and interface identification, link tracking ID and the time of data generation;

Grouping step: grouping the plurality of software module identifiers and interface identifiers according to a second preset rule;

Numbering step: sort the multiple software module identifiers and interface identifiers in the same group according to the first preset rule, and splice each group of sorted software module identifiers and interface identifiers to provide each group of software module identifiers and interfaces The identification generates a corresponding data number;

Construction steps: Construct a prefix tree according to each data number.
The first server according to claim 10, wherein said constructing a prefix tree according to each data number comprises:

B1. Take the user request as the root node of the prefix tree;

B2. Read a data number, and use the first module identifier and interface identifier in the data number as the first-level node after the root node of the prefix tree in the order from left to right, and the second module in the data number The identifier and interface identifier are used as the second-level nodes after the root node of the prefix tree, and so on, until the last module identifier and interface identifier in the data number are used as the leaf nodes of the prefix tree;

B3. Repeat step B2 until all data numbers are added to the prefix tree.
The first server according to claim 8 or 9 or 10, wherein the first preset rule is to sort according to the time sequence of data generation.
The first server according to claim 10, wherein the second preset rule is to group each software module ID and interface ID according to the link tracking ID, and group the software module IDs that include the same link tracking ID And interface identifiers are grouped into the same group, and software module identifiers and interface identifiers containing different link tracking IDs are grouped into different groups.
11. The first server according to claim 10, wherein the following steps are further implemented when the link abnormality recognition program is executed by the processor:

Every preset time, the prefix tree is updated according to the updated historical link data in the predetermined database.
A computer-readable storage medium, characterized in that a link abnormality recognition program is stored on the computer-readable storage medium, and the link abnormality recognition program can be executed by one or more processors to implement the following steps:

The first obtaining step: obtaining, in real time, abnormal request information that the second server fails to respond normally over timeout, and the abnormal request information includes the link tracking ID corresponding to the abnormal request;

The second obtaining step: obtaining multiple software module information of one or more business systems invoked by the second server when processing the abnormal request according to the link tracking ID corresponding to the abnormal request, where the software module information includes the software module identifier And interface identification, data generation time and link tracking ID;

Recognition step: sort the multiple software module identifiers and interface identifiers according to the first preset rule, splice the sorted software module identifiers and interface identifiers to generate a data number, and combine the data number with the pre-built The prefix tree is compared to identify abnormal software module identifiers and interface identifiers.
15. The computer-readable storage medium of claim 15, wherein the identifying step is replaced with:

Sort the multiple software module identifiers and interface identifiers according to the first preset rule, splice the sorted software modules and interface identifiers to generate a data number, and combine the data number with a predetermined regular expression set Make comparisons to identify abnormal software module IDs and interface IDs.
15. The computer-readable storage medium of claim 15, wherein the construction process of the prefix tree comprises:

The third obtaining step: obtaining historical link data in a predetermined database, where the historical link data includes multiple software module information of the one or more business systems invoked when the second server processes a user request, and The software module information includes the software module identification and interface identification, link tracking ID and the time of data generation;

Grouping step: grouping the plurality of software module identifiers and interface identifiers according to a second preset rule;

Numbering step: sort the multiple software module identifiers and interface identifiers in the same group according to the first preset rule, and splice each group of sorted software module identifiers and interface identifiers to provide each group of software module identifiers and interfaces The identification generates a corresponding data number;

Construction steps: Construct a prefix tree according to each data number.
The computer-readable storage medium of claim 17, wherein the constructing a prefix tree according to each data number comprises:

B1. Take the user request as the root node of the prefix tree;

B2. Read a data number, and use the first module identifier and interface identifier in the data number as the first-level node after the root node of the prefix tree in the order from left to right, and the second module in the data number The identifier and interface identifier are used as the second-level nodes after the root node of the prefix tree, and so on, until the last module identifier and interface identifier in the data number are used as the leaf nodes of the prefix tree;

B3. Repeat step B2 until all data numbers are added to the prefix tree.
The computer-readable storage medium according to claim 15 or 16 or 17, wherein the first preset rule is to sort according to the time sequence of data generation.
The computer-readable storage medium according to claim 17, wherein the second preset rule is to group software module identifiers and interface identifiers according to the link tracking ID, and group software that includes the same link tracking ID. The module identifiers and interface identifiers are grouped into the same group, and the software module identifiers and interface identifiers containing different link tracking IDs are grouped into different groups.