CN115225572A

CN115225572A - Routing information processing method and device, electronic equipment and storage medium

Info

Publication number: CN115225572A
Application number: CN202210827258.3A
Authority: CN
Inventors: 江河清; 罗毅; 郭浩; 刘军
Original assignee: Alibaba China Co Ltd
Current assignee: Alibaba China Co Ltd
Priority date: 2022-07-13
Filing date: 2022-07-13
Publication date: 2022-10-21
Anticipated expiration: 2042-07-13
Also published as: CN115225572B

Abstract

The embodiment of the application provides a method and a device for processing routing information, electronic equipment and a storage medium. The method comprises the following steps: determining a target conditional branch of a target routing rule and a target address jump path corresponding to the target conditional branch; determining a branch identifier for the target conditional branch to obtain a first mapping relation between the branch identifier of the target conditional branch and a target address jump path; obtaining a first backtracking basis based on the first mapping relation, and storing the first backtracking basis; the first backtracking is used for determining that the application request passes through a target address jump path under the condition that a branch identifier of a target conditional branch is obtained through analysis of routing information based on the application request; the routing information of the application request is obtained based on the branch identifications of the N conditional branches hit by the application request, wherein N is an integer greater than or equal to 1. According to the embodiment of the application, the cost and the difficulty of route diagnosis can be reduced, and the performance and the efficiency of route diagnosis are improved.

Description

Routing information processing method and device, electronic equipment and storage medium

Technical Field

The present application relates to the field of cloud computing technologies, and in particular, to a method and an apparatus for processing routing information, an electronic device, and a storage medium.

Background

With the advent of the cloud-native era, the complexity of applications and the amount of users touched is also increasing. Accordingly, the machine size of the application deployment is also more massive. In some scenarios, the number of service nodes of an application may even reach the order of hundreds of thousands. Meanwhile, the function diversification of the applied service node is more and more obvious. In the same application, machine groups with different performances and deployed in different machine rooms are endowed with different responsibilities.

Based on this, various routing rules (e.g., area-specific traffic blocking, near-access, etc.) have come into play, and the routing of the service framework is also becoming more complex. Because the routing process of the application request is often determined based on the condition of actual calling, it is difficult to construct a request reaching the same condition to reproduce the routing process in the post diagnosis, which causes great difficulty in routing diagnosis.

Disclosure of Invention

The embodiment of the application provides a method and a device for processing routing information, an electronic device and a storage medium, so as to solve the problems in the related art, and the technical scheme is as follows:

in a first aspect, an embodiment of the present application provides a method for processing routing information, including:

determining a target conditional branch of a target routing rule and a target address jump path corresponding to the target conditional branch;

determining a branch identifier for the target conditional branch to obtain a first mapping relation between the branch identifier of the target conditional branch and a target address jump path;

obtaining a first backtracking basis based on the first mapping relation, and storing the first backtracking basis; the first backtracking is used for determining that the application request passes through a target address jump path under the condition that the branch identifier of the target conditional branch is obtained through analysis of routing information based on the application request; the routing information of the application request is obtained based on branch identifications of N conditional branches hit by the application request, wherein N is an integer greater than or equal to 1.

In a second aspect, an embodiment of the present application provides a method for processing routing information, including:

responding to the target conditional branch hit by the application request determined based on the target routing rule, and distributing the application request to a target address jump path corresponding to the target conditional branch;

based on the branch identification of the target conditional branch, obtaining the routing information of the application request and storing the routing information; the routing information is used for determining that the application request passes through the target address jump path in combination with a first backtracking basis, and the first backtracking basis comprises a first mapping relation between a branch identifier of a target conditional branch and the target address jump path.

In a third aspect, an embodiment of the present application provides a method for processing routing information, including:

acquiring routing information of an application request;

analyzing the routing information of the application request to obtain N branch identifiers, wherein N is an integer greater than or equal to 1;

responding to the branch identifications of the target conditional branch including the target routing rule in the N branch identifications, and determining that the application request passes through a target address jump path according to a first backtracking basis; the first backtracking is based on a first mapping relation between a branch identifier including a target conditional branch and a target address jump path.

In a fourth aspect, an embodiment of the present application provides an apparatus for processing routing information, including:

the branch prediction module is used for determining a target conditional branch of a target routing rule and a target address jump path corresponding to the target conditional branch;

the branch marking module is used for determining a branch identifier for the target conditional branch to obtain a first mapping relation between the branch identifier of the target conditional branch and a target address jump path;

the first relation recording module is used for obtaining a first backtracking basis based on a first mapping relation and storing the first backtracking basis; the first backtracking is used for determining that the application request passes through a target address jump path under the condition that the branch identifier of the target conditional branch is obtained through analysis of routing information based on the application request; the routing information of the application request is obtained based on branch identifications of N conditional branches hit by the application request, wherein N is an integer greater than or equal to 1.

In a fifth aspect, an embodiment of the present application provides a device for processing routing information, including:

the rule judging module is used for responding to the condition branch of the target hit by the application request determined based on the target routing rule and distributing the application request to a target address jump path corresponding to the target condition branch;

the routing recording module is used for obtaining routing information of the application request based on the branch identification of the target conditional branch and storing the routing information; the routing information is used for determining that the application request passes through the target address jump path in combination with a first backtracking basis, and the first backtracking basis comprises a first mapping relation between a branch identifier of a target conditional branch and the target address jump path.

In a sixth aspect, an embodiment of the present application provides an apparatus for processing routing information, including:

the information acquisition module is used for acquiring the routing information of the application request;

the routing analysis module is used for analyzing the routing information of the application request to obtain N branch identifiers, wherein N is an integer greater than or equal to 1;

the path determining module is used for responding to the branch identifiers of the target conditional branches including the target routing rule in the N branch identifiers, and determining that the application request jumps through the target address according to a first backtracking basis; the first trace-back is based on a first mapping relation between a branch identifier including a target conditional branch and a target address jump path.

In a seventh aspect, an embodiment of the present application provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory, where the processor, when executing the computer program, implements the method provided in any embodiment of the present application.

In an eighth aspect, embodiments of the present application provide a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, and the computer program, when executed by a processor, implements the method provided in any embodiment of the present application.

According to the technical scheme of the embodiment of the application, the branch identification can be distributed aiming at the conditional branch of the routing rule in advance, the address jump path corresponding to the conditional branch is associated with the branch identification, and the backtracking basis is obtained by utilizing the mapping relation between the address jump path and the branch identification. When the application request is routed, the routing information is obtained based on the branch identification of the conditional branch hit by the application request. When the routing process of the application request needs to be traced back, the branch identifier of the conditional branch hit by the application request can be obtained by analyzing the routing information, so that the address jump path passed by the application request is determined by utilizing the tracing back basis, and the routing tracing back is realized. It can be seen that the technical solution of the embodiment of the present application dynamically records the hit conditional branch of the application request, and backtracks the routing process of the application request based on the recorded information, thereby avoiding the problem that the routing process needs to be reproduced by reconstructing the application request, and reducing the cost and difficulty of routing diagnosis. Moreover, since the branch identifiers are distributed to the conditional branches of the routing rule in advance, the backtracking basis is constructed based on the mapping relation between the branch identifiers and the address jump paths, the address jump paths of the application requests in the routing process can be backtracked only by recording the branch identifiers of the conditional branches actually hit by the application requests, the data volume of collection and storage is compressed, the collection of the routing information of the whole amount of application requests becomes possible, and the performance and efficiency of routing backtracking and diagnosis are improved.

The foregoing summary is provided for the purpose of description only and is not intended to be limiting in any way. In addition to the illustrative aspects, embodiments, and features described above, further aspects, embodiments, and features of the present application will be readily apparent by reference to the drawings and following detailed description.

Drawings

In the drawings, like reference numerals refer to the same or similar parts or elements throughout the several views unless otherwise specified. The figures are not necessarily to scale. It is appreciated that these drawings depict only some embodiments in accordance with the disclosure and are therefore not to be considered limiting of its scope.

Fig. 1 is a schematic diagram of an exemplary application scenario of the present application.

Fig. 2 is a flowchart of a method for processing routing information according to an embodiment of the present application.

Fig. 3 is a schematic diagram of an application example one of the routing information processing method.

Fig. 4 is a flowchart of a method for processing routing information according to another embodiment of the present application.

Fig. 5 is a flowchart of a method for processing routing information according to another embodiment of the present application.

Fig. 6 is a schematic diagram of an application example two of the routing information processing method.

Fig. 7 is a block diagram of a device for processing routing information according to an embodiment of the present application.

Fig. 8 is a block diagram of a processing apparatus for routing information according to another embodiment of the present application.

Fig. 9 is a block diagram of a routing information processing apparatus according to another embodiment of the present application.

Fig. 10 is a block diagram of a system for processing routing information according to an embodiment of the present application.

Fig. 11 is a block diagram of an electronic device according to an embodiment of the present application.

Detailed Description

In the following, only certain exemplary embodiments are briefly described. As those skilled in the art will recognize, the described embodiments may be modified in various different ways, all without departing from the spirit or scope of the present application. Accordingly, the drawings and description are to be regarded as illustrative in nature, and not as restrictive.

For the convenience of understanding of the technical solutions of the embodiments of the present application, the following related technologies of the embodiments of the present application are described below, and the following related technologies may be optionally combined with the technical solutions of the embodiments of the present application as alternatives, and all of them belong to the protection scope of the embodiments of the present application.

The technical scheme of the embodiment of the application can be applied to route diagnosis. The route diagnosis is mainly used for diagnosing whether a route result meets an expectation, for example, whether an application request initiated by a user reaches a target service node, whether the route time of the application request is within an expected range, and the like. An important means of route diagnosis is to determine whether each routing rule in the routing process is accurate by backtracking the routing process of the application request. In the related art, the routing process of the application request can be traced back in the following manner:

the first method is as follows: and constructing a similar application request through the processing result of the application request and information such as parameters and the like when the application log reversely deduces the request so as to simulate the routing scene of the application request. And judging the specific execution process of each routing rule in the modes of code diagnosis and the like to acquire routing information. The difficulty of data construction in this way is high, and intuitive judgment is required. In addition, developers who need routing rules intervene to assist judgment, and diagnosis cost is high.

The second method comprises the following steps: and (3) performing static point burying on all code branches passed by the application request, performing full-flow recording and output in the mode of logs and the like during the request, and finally judging the calling process according to the logs. This method requires a large amount of data to be temporarily stored, and consumes a large amount of memory space. In addition, in a scenario with a high concurrency number, log dropping significantly increases the pressure of disk IO (Input/Output). Due to the large output quantity, the method is not suitable for collecting all application requests, and the problematic requests cannot be collected correctly.

The third method comprises the following steps: on the basis of the second mode, the collection is carried out on the routing process of the application request of a specific abnormal scene (for example, no address is found after multiple routes are carried out). Since a processing result cannot be predicted when the application request is routed for the first time, secondary routing is required. Numerous context data can be lost during secondary routing, and the performance of the secondary routing can be seriously influenced under an extreme scene. In addition, because only part of the application requests are collected, the problem of routing decision errors which are not easy to find but have huge influence surfaces cannot be covered.

The method for processing routing information provided in the embodiment of the present application mainly aims to solve the above technical problems. In order to more clearly show the processing method of the routing information provided in the embodiment of the present application, an application scenario that can be used to implement the method is first introduced.

Fig. 1 shows a schematic diagram of an exemplary application scenario. As shown in fig. 1, the method for processing routing information provided in this embodiment of the present application may implement routing diagnosis for an application based on a branch prediction device, a collection device, and a check device, for example, to determine whether each routing rule is accurate in a routing process of an application request.

It should be noted that, the application in the embodiment of the present application specifically refers to a computer application for providing a user service. Illustratively, the application may comprise a cloud application, i.e., an application that runs using computer resources cooperatively provided by one or more server clusters in the cloud. Service nodes such as servers and server clusters for running applications can be deployed in different areas, and therefore, when the applications run, application requests need to be distributed according to a series of rules, so that the application requests can accurately reach target service nodes. For example, the routing rule in the embodiment of the present application may include a rule for performing distribution processing on the application request. Specifically, the routing rule is used for judging that the application request meets a certain condition based on the parameter of the application request, and distributing the application request to an address jump path corresponding to the condition. Here, the condition relating to the parameter of the application request belongs to a branch of the routing rule, and therefore, may be referred to as a conditional branch.

As shown in fig. 1, the branch prediction apparatus obtains a routing rule related to an application, enumerates each conditional branch that may occur in each routing rule in advance, identifies each conditional branch, and records a mapping relationship between each conditional branch and a corresponding address jump path. When the application runs, the acquisition device dynamically acquires the identifier of the conditional branch hit by the application request in the specific execution process of each routing rule to obtain routing information. When the routing state backtracking is triggered, for example, when the problem that the routing decision error exists in the application is found, the checking device backtracks the processing of each routing rule to the application request based on the routing information acquired by the acquisition device and the mapping relation determined by the branch prediction device.

So that the manner in which the above recited features and aspects of the present invention can be understood in detail, a more particular description of the embodiments of the invention, briefly summarized above, may be had by reference to the appended drawings, which are included to illustrate, but are not intended to limit the embodiments of the invention.

Fig. 2 is a flowchart illustrating a method for processing routing information according to an embodiment of the present application. The method may be performed by a processing means of routing information, such as the branch prediction means described above. As shown in fig. 2, the method may include the following steps.

Step S210: determining a target conditional branch of a target routing rule and a target address jump path corresponding to the target conditional branch;

step S220: determining a branch identifier for the target conditional branch to obtain a first mapping relation between the branch identifier of the target conditional branch and a target address jump path;

step S230: obtaining a first backtracking basis based on the first mapping relation, and storing the first backtracking basis; the first backtracking is used for determining that the application request passes through a target address jump path under the condition that the branch identifier of the target conditional branch is obtained through analysis of routing information based on the application request; the routing information of the application request is obtained based on branch identifications of N conditional branches hit by the application request, wherein N is an integer greater than or equal to 1.

Exemplarily, in the step S210, the target routing rule may include any routing rule related to the application. For example, a plurality of routing rules associated with an application may be traversed, and each traversal to a routing rule is determined to be a target routing rule. As explained before, conditions relating to parameters of the application request may be configured in the target routing rule, and these conditions may be referred to as conditional branches. Wherein, the application request may refer to a service request initiated by a user for the application.

Exemplarily, in the step S210, the target conditional branch may include any conditional branch of the target routing rule. For example, all conditional branches of the target routing rule may be enumerated in advance, and each conditional branch is taken as a target conditional branch for which the above processing procedure is performed. The way enumerated is, for example: and predicting the possible situations of each parameter for the parameters requested by the application, and taking each situation as a conditional branch, namely realizing the enumeration of the conditional branches.

During application run time, application requests may be routed to different paths for different conditional branches, each of which may point to a different node. For example, different paths may point to different clusters of servers. For another example, a plurality of condition determination nodes may correspond to the target routing rule, and the application request may be transferred to the server cluster through a different number of condition determination nodes, so that different paths may also point to different condition determination nodes and server clusters. These conditional access nodes and address information of the server cluster, such as IP addresses, may be used to characterize the path, and thus the path may be referred to as an address hop path.

Exemplarily, in the above step S220, the branch identifier is used for identifying the conditional branch, for example, the branch identifier may be a number of the conditional branch. Illustratively, the branch identification may be purely digital data, such as binary data. Since different conditional branches correspond to different address jump paths, the branch identifier has a mapping relationship with the address jump path, and in the embodiment of the present application, the mapping relationship between the branch identifier and the address jump path is referred to as a first mapping relationship. Because the target conditional branch corresponds to the target address jump path, when the branch identifier is allocated to the target conditional branch, a first mapping relationship between the branch identifier of the target conditional branch and the target address jump path can be determined.

Exemplarily, in the step S230, the first tracing criterion may include a first mapping relationship as a criterion for tracing back the routing process of the application request. Optionally, the first trace-back criterion may further include at least one first mapping relationship corresponding to at least one conditional branch of the target routing rule. Therefore, the corresponding address jump path can be determined based on the identifier of the conditional branch by utilizing the first backtracking basis.

In the method, the first trace-back is used for determining that the application request passes through the target address jump path under the condition that the branch identifier of the target conditional branch is obtained based on the routing information analysis of the application request. Wherein, the routing information of the application request is obtained based on the branch identification of the N conditional branches hit by the application request. That is to say, the routing information of the application request may be obtained based on the identifier of the N conditional branches hit by the application request, accordingly, the branch identifiers of the N conditional branches hit by the application request may be analyzed based on the routing information, if the branch identifiers include the branch identifier of the target conditional branch, it is indicated that the N conditional branches hit by the application request include the target conditional branch, and the branch identifier may be determined to correspond to the target address jump path according to the first mapping relationship in the first trace-back basis, so as to determine that the application request passes through the target address jump path. In specific implementation, during application running, in the process of processing the application request by using each routing rule, the identifier of each conditional branch hit by the application request may be recorded. In the above description, hitting a conditional branch may be understood as conforming to the condition corresponding to the branch.

Optionally, the application requests to jump to the path via the target address, which may include multiple information. Specifically, determining that the application request passes through the target address jump path may include: and determining that the target routing rule indicates that the application request hits the target conditional branch when the application runs, and triggering the application request to be distributed to the target address jump path. Therefore, whether the target routing rule carries out accurate conditional branch judgment or not can be judged, and whether the conditional branch corresponds to an accurate address jump path or not can be diagnosed.

It can be seen that the method allocates branch identifiers for conditional branches of the routing rule, associates address jump paths corresponding to the conditional branches with the branch identifiers, and obtains a backtracking basis by using a mapping relationship between the two branch identifiers. Based on the method, the routing process of the backtracking according to the backtracking application request can be called by dynamically recording the hit conditional branch of the application request, so that the problem that the routing process is repeated by reconstructing the application request is solved, and the cost and the difficulty of routing diagnosis are reduced. Moreover, since the branch identifiers are distributed to the conditional branches of the routing rule in advance, the backtracking basis is constructed based on the mapping relation between the branch identifiers and the address jump paths, the address jump paths of the application requests in the routing process can be backtracked only by recording the branch identifiers of the conditional branches actually hit by the application requests, the data volume of collection and storage is compressed, the collection of the routing information of the whole amount of application requests becomes possible, and the performance and efficiency of routing backtracking and diagnosis are improved.

A specific example is provided below to illustrate how branch identifications are determined for conditional branches under routing rules. Fig. 3 is a schematic diagram showing an application example one of the processing method of the routing information. As shown in fig. 3, the target routing rule is a nearby routing rule. The nearby routing rule is used for judging an address jump path of the application request based on the source of the application request. On the basis, the target service node (such as a server cluster) is allowed to be statically or dynamically specified during the running of the application, namely the global traffic diversion target is allowed to be set, and a plurality of application requests of the application are distributed to one or more specified service nodes; it also allows for the setting of a single-request diversion target that distributes the currently invoked application request to another specified service node or nodes. Then, the near routing rule judges the node according to the three branches, i.e. the global traffic diversion target, the single request diversion target, and the traffic source (i.e. the source of the application request), so that the application request can be distributed to multiple address jump paths. As shown in fig. 3, 12 links between nodes are derived based on three branch judgment nodes, and are respectively identified by numbers 1 to 12. Based on the connections between these 12 links, 9 conditional branches under the nearby routing rule can be derived, as an example:

(1) Setting a global flow diversion target, wherein the global flow diversion target is a branch of the first server cluster;

(2) Setting a global flow diversion target, wherein the global flow diversion target is a branch of the second server cluster;

(3) Setting a global flow guide target, wherein the global flow guide target is a branch of a third server cluster;

(4) Setting a single request flow guide target which is a branch of the first server cluster, wherein the global flow guide target is not set;

(5) Setting a single request flow guide target which is a branch of the second server cluster, wherein the global flow guide target is not set;

(6) Setting a single request flow guide target which is a branch of a third server cluster, wherein the global flow guide target is not set;

(7) A global flow diversion target is not set, a single request diversion target is not set, and a flow source is a branch of the first server cluster;

(8) A global flow diversion target is not set, a single request diversion target is not set, and a flow source is a branch of the second server cluster;

(9) And a global flow diversion target is not set, a single request diversion target is not set, and a flow source is a branch of the third server cluster.

The above 9 branches correspond to 9 address jump paths, for example, the address jump path corresponding to branch (1) is: jumping from a first branch judgment node (global traffic diversion target) to a first server cluster; the address jump path corresponding to the branch (7) is as follows: and jumping from the first branch judgment node to a second branch judgment node (a single-request diversion target), jumping from the second branch judgment node to a third branch judgment node (a flow source), and jumping from the third branch judgment node to the first server cluster. The conditional branches are respectively assigned with identifiers, as shown in fig. 3, letters a to I may be respectively used as branch identifiers, and the corresponding branches and address jump paths may be determined based on the branch identifiers. For example, the label G corresponds to the branch (7), and the branch (7) corresponds to the address jump path of the link 1-the link 5-the link 9-the link 10.

It is understood that the above application examples are identified by decimal numbers and letters to make the expression clear. In practical application, other mathematical representation forms can also be adopted as the identifier, for example, binary information bits are adopted as the identifier.

Optionally, on the basis that the branch identifier is determined for each conditional branch by the method, a conditional branch sequence obtained based on a plurality of routing rules may also be determined, and a sequence identifier is determined for the conditional branch sequence, so that the branch identifiers of N conditional branches hit by the application request may be converted into sequence identifiers for storage, and the data size is further compressed. Specifically, the method may further include:

determining a first branch sequence based on conditional branches under each routing rule in the routing rule set; the first branch sequence comprises branch identifications of M conditional branches, and M is an integer greater than or equal to 1;

determining sequence identification for the first branch sequence to obtain a second mapping relation between the sequence identification of the first branch sequence and the branch identifications of the M conditional branches;

obtaining a second backtracking basis based on the second mapping relation; and the second backtracking is based on the sequence identifier in the routing information for analyzing the application request.

Illustratively, the set of routing rules may include a plurality of routing rules associated with the application. Based on the conditional branches under each routing rule, a plurality of conditional branch sequences can be obtained, for example, different conditional branches under each routing rule are combined to obtain different conditional branch sequences. The plurality of conditional branch sequences includes the first branch sequence. Alternatively, the first branch sequence may be any one of the plurality of conditional branch sequences.

Illustratively, the set of routing rules may include L routing rules, where L is an integer greater than or equal to M. The M conditional branches corresponding to the first branch sequence may correspond to first M routing rules, respectively, of the L routing rules. The enumeration of the branch sequences is realized by changing the numerical value of M and enumerating the conditional branch of each routing rule in the M routing rules, so that the branch sequences are selected one by one from the enumerated branch sequences as first branch sequences to perform the processing of determining the sequence identifiers.

For example, if a branch sequence includes a plurality of conditional branches, each of which has a branch id of A, B, E, if ABE is used to characterize the branch sequence, three-letter data size needs to be handled during recording and storage. If the branch sequence is assigned a sequence identifier, for example Z, i.e. Z is used to characterize the branch sequence, the amount of data of one letter needs to be processed during recording and storage. It can be seen that by assigning sequence identifiers to branch sequences, the amount of data processed in each flow associated with route diagnosis can be greatly reduced.

Exemplarily, in the embodiment of the present application, the second mapping relationship may refer to a mapping relationship between a sequence identifier and a branch identifier of at least one conditional branch in the sequence, for example, a mapping relationship between Z and ABE described above. And obtaining a second backtracking basis based on the mapping relationship, and under the condition that the routing information is the sequence identifier, analyzing the routing information into at least one branch identifier so as to interpret at least one conditional branch passed by the application request.

For example, the second trace-back criterion may include a second mapping relationship between the sequence identifier of each branch sequence in the enumerated multiple branch sequences and the branch identifier of the corresponding conditional branch.

The embodiment of the application also provides another routing information processing method. The method may be performed by a processing device of routing information, such as the above-mentioned acquisition device, and fig. 4 shows a flowchart of a processing method of routing information according to another embodiment of the present application. As shown in fig. 4, the method includes the following steps.

Step S410: responding to the target routing rule to determine that the application request hits the target conditional branch, and distributing the application request to a target address jump path corresponding to the target conditional branch;

step S420: obtaining the routing information of the application request based on the branch identification of the target conditional branch, and storing the routing information; the routing information is used for determining that the application request passes through a target address jump path by combining with a first backtracking basis, and the first backtracking basis comprises a first mapping relation between a branch identifier of a target conditional branch and the target address jump path.

For the technical details of each information in the above method, reference may be made to the foregoing embodiments, which are not described in detail herein. It can be seen that the method is mainly used for processing the application request when the application runs. In the method, if an application request hits a target conditional branch of a target routing rule, the application request is distributed to a target address jump path corresponding to the branch, and a branch identifier of the target conditional branch is recorded to obtain routing information of the application request, and the routing information is stored. Alternatively, the branch identification may be recorded in binary information bits in the context of the application request.

Optionally, the routing information may include branch identifications of N conditional branches hit by the application request, where N is an integer greater than or equal to 1. Then, obtaining the routing information requested by the application based on the branch identifier of the target conditional branch may include: when an application request hits a target conditional branch, adding a branch identifier of the target conditional branch to a binary information bit in the context; when the application request call is completed, the routing information is obtained based on the binary information bit, for example, the binary information bit is used as the routing information, or the binary information bit is converted into a data format to obtain the routing information.

Optionally, the routing information may include a sequence identification of a branch sequence consisting of N conditional branches hit by the application request. Then, obtaining the routing information of the application request based on the branch identifier of the target conditional branch includes: determining a second branch sequence corresponding to the application request based on the branch identification of the target conditional branch; wherein the second branch sequence comprises branch identifications of N conditional branches hit by the application request; and obtaining the routing information of the application request based on the sequence identification of the second branch sequence.

That is, the second branch sequence is a branch sequence consisting of N conditional branches hit by the application request. By enumerating branch sequences and allocating sequence identifiers in the branch prediction device, N conditional branches can be recorded as sequence identifiers of the second branch sequence, and routing information is obtained based on the sequence identifiers when the application request call is completed. Therefore, the data volume of the routing information is greatly reduced, the data storage volume is reduced, and the data processing efficiency is improved.

It can be seen that, according to the technical solution of the embodiment of the present application, when routing an application request, routing information is obtained based on a branch identifier of a conditional branch hit by the application request. When the routing process of the application request needs to be traced back, the branch identifier of the conditional branch hit by the application request can be obtained by analyzing the routing information, and the tracing back is utilized to determine the address jump path passed by the application request, so that the routing tracing back is realized. The problem that the routing process needs to be repeated by reconstructing the application request is solved, and the cost and the difficulty of routing diagnosis are reduced. In addition, the data volume of collection and storage is compressed, so that the collection of the routing information of the whole application request becomes possible, and the performance and efficiency of routing backtracking and diagnosis are improved.

Optionally, in order to improve the route diagnosis efficiency, the above collection processing may be performed for an application request meeting an abnormal condition. Specifically, in the above method, based on the branch identifier of the target conditional branch, the routing information of the application request is obtained, including; and obtaining the routing information of the application request based on the branch identification of the target conditional branch under the condition that the application request meets the preset abnormal condition.

The exception condition is, for example, that the application request does not find the destination address after being routed multiple times. The routing information is collected and backtracked according to the application requests meeting abnormal conditions, and the resource utilization rate of routing diagnosis can be improved.

The embodiment of the application also provides another routing information processing method. The method may be performed by a processing apparatus of routing information, such as the above-described troubleshooting apparatus, and fig. 5 shows a flowchart of a processing method of routing information according to another embodiment of the present application. As shown in fig. 5, the method includes:

step S510: acquiring routing information of an application request;

step S520: analyzing the routing information of the application request to obtain N branch identifiers, wherein N is an integer greater than or equal to 1;

step S530: responding to the branch identifications of the target conditional branch including the target routing rule in the N branch identifications, and determining that the application request passes through a target address jump path according to a first backtracking basis; the first backtracking is based on a first mapping relation between a branch identifier including a target conditional branch and a target address jump path.

For the technical details of each information in the above method, reference may be made to the foregoing embodiments, which are not described in detail herein. It can be seen that the method is mainly used for determining the path that an application request passes through based on the routing information and the backtracking basis during the route backtracking. In the method, N branch identifications are obtained by analyzing routing information, and then according to each branch identification, an address jump path through which an application request passes is determined. For example, since N branch identities correspond to N conditional branches, and the conditional branches belong to the routing rule, based on the branch identities, a processing manner for the application request in the routing rule to which the corresponding conditional branch belongs may be determined, so that the accuracy of the routing rule may be diagnosed.

Optionally, the routing information may include the above-mentioned N branch identifiers, and then the N branch identifiers may be extracted directly from the routing information.

Optionally, the routing information may include a sequence identifier, and the N branch identifiers are obtained by parsing the sequence identifier. Specifically, analyzing the routing information of the application request to obtain N branch identifiers includes: analyzing the sequence identification in the routing information based on the second backtracking basis to obtain N branch identifications; the second backtracking criterion includes a second mapping relationship between the sequence identifier and the N branch identifiers.

The second trace-back criterion may include a second mapping relationship between each sequence identifier of the plurality of sequence identifiers and the plurality of branch identifiers corresponding to the sequence identifier.

It can be seen that, according to the above method, when the routing process of the application request needs to be traced back, the branch identifier of the conditional branch hit by the application request can be obtained by analyzing the routing information, so that the address jump path passed by the application request is determined by using the tracing back basis, and the routing tracing back is realized. The problem that the routing process needs to be repeated by reconstructing the application request is solved, and the cost and the difficulty of routing diagnosis are reduced. In addition, the data volume of collection and storage is compressed, so that the collection of the routing information of the whole application request becomes possible, and the performance and efficiency of routing backtracking and diagnosis are improved.

In order to more clearly present the technical idea of the present application, a specific application example is provided below to illustrate the processing procedure of the above-mentioned acquisition device and the examination device. Fig. 6 is a diagram showing an application example two of the processing method of the routing information.

As shown in fig. 6, in the application system, 3 routing rules, which are respectively denoted as routing rule 1, routing rule 2, and routing rule 3, are set, thereby deriving a plurality of conditional branches. The routing rule 1 includes five conditional branches a to E, which correspond to address combinations 1 to 5, i.e., correspond to 5 different address jump paths. The routing rule 2 includes conditional branches a to E, which correspond to address combinations 1 to 5, respectively, that is, to 5 different address jump paths. The routing rule 3 includes conditional branches a to E, which correspond to address combinations 1 to 5, respectively, that is, to 5 different address jump paths. The application request sequentially enters each routing rule for independent judgment according to the sequence of the routing rule, wherein the application request is supposed to hit a conditional branch A of the routing rule 1, and data A can be recorded under the state bit corresponding to the routing rule 1 by using context; routing rule 2 and routing rule 3 record data B and E in the same way. After routing and address selection, ABE is recorded in the context, and at the moment, the routing information of the request can be recorded as ABE by a third party full-link log collecting tool. If a sequence identifier, such as Z, is previously assigned to the branch sequence ABE, the route information of the request may also be recorded as Z by the third-party full-link log collecting tool.

When the routing state backtracking is needed, the routing information ABE or Z of the request needing backtracking is obtained through a third-party full-link log collecting tool. And then, by reading the backtracking basis determined in the branch prediction process (the program outputs detailed information to the persistent medium after determining the backtracking basis every time), the whole routing process can be clearly analyzed.

Corresponding to the application scenario and the method of the method provided by the embodiment of the present application, the embodiment of the present application further provides a processing apparatus of routing information. The apparatus may be the branch prediction apparatus described above. Referring to fig. 7, the apparatus 700 may include:

a branch prediction module 710, configured to determine a target conditional branch of the target routing rule and a target address jump path corresponding to the target conditional branch;

a branch marking module 720, configured to determine a branch identifier for the target conditional branch, so as to obtain a first mapping relationship between the branch identifier of the target conditional branch and the target address jump path;

the relationship recording module 730 is configured to obtain a first backtracking basis based on the first mapping relationship, and store the first backtracking basis; the first backtracking is used for determining that the application request passes through a target address jump path under the condition that the branch identifier of the target conditional branch is obtained through analysis of routing information based on the application request; the routing information of the application request is obtained based on branch identifications of N conditional branches hit by the application request, wherein N is an integer greater than or equal to 1.

Optionally, the apparatus 700 may further include:

a sequence prediction module 740, configured to determine a first branch sequence based on conditional branches under each routing rule in the routing rule set; the first branch sequence comprises branch identifications of M conditional branches, and M is an integer greater than or equal to 1;

a sequence marking module 750, configured to determine a sequence identifier for the first branch sequence, and obtain a second mapping relationship between the sequence identifier of the first branch sequence and the branch identifiers of the M conditional branches;

the second relationship recording module 760 is configured to obtain a second backtracking basis based on the second mapping relationship; and the second backtracking is based on the sequence identifier in the routing information for analyzing the application request.

The embodiment of the application also provides a processing device of the routing information. The device may be the aforementioned acquisition device. Referring to fig. 8, the apparatus 800 may include:

the rule judging module 810 is configured to, in response to determining that the application request hits the target conditional branch based on the target routing rule, distribute the application request to a target address jump path corresponding to the target conditional branch;

a route recording module 820, configured to obtain route information of the application request based on the branch identifier of the target conditional branch; the routing information is used for determining that the application request passes through the target address jump path in combination with a first backtracking basis, and the first backtracking basis comprises a first mapping relation between a branch identifier of a target conditional branch and the target address jump path.

Optionally, the routing information includes branch identifications of N conditional branches hit by the application request, where N is an integer greater than or equal to 1.

Optionally, the route recording module 820 may include:

the sequence determining unit is used for determining a second branch sequence corresponding to the application request based on the branch identification of the target conditional branch; the second branch sequence comprises branch identifications of N conditional branches hit by the application request, and N is an integer greater than or equal to 1;

and the route determining unit is used for obtaining the route information of the application request based on the sequence identification of the second branch sequence.

Optionally, the branch identification of the target conditional branch is recorded with a binary information bit in the context of the application request.

Optionally, the route recording module 820 is specifically configured to:

and obtaining the routing information of the application request based on the branch identification of the target conditional branch under the condition that the application request meets the preset abnormal condition.

The embodiment of the application also provides a processing device of the routing information. The device may be the aforementioned troubleshooting device. Referring to fig. 9, the apparatus 900 may include:

a route analyzing module 910, configured to analyze the route information of the application request to obtain N branch identifiers, where N is an integer greater than or equal to 1;

a path determining module 920, configured to determine, according to a first trace-back basis, that the application request jumps through the target address in response to the branch identifier of the target conditional branch including the target routing rule among the N branch identifiers; the first backtracking is based on a first mapping relation between a branch identifier including a target conditional branch and a target address jump path.

Optionally, the route parsing module 910 is specifically configured to: analyzing the sequence identification in the routing information based on the second backtracking basis to obtain N branch identifications; the second backtracking criterion includes a second mapping relationship between the sequence identifier and the N branch identifiers.

The functions of each module in each device in the embodiment of the present application can be referred to the corresponding description in the above method, and have corresponding beneficial effects, which are not described herein again.

The embodiment of the application also provides a system for realizing the method. Fig. 10 is a block diagram showing a configuration of a system for processing routing information according to an embodiment of the present application. As shown in fig. 10, the system 1000 may include:

the branch prediction device 1010 is configured to determine a target conditional branch of the target routing rule and a target address jump path corresponding to the target conditional branch, determine a branch identifier for the target conditional branch, obtain a first mapping relationship between the branch identifier of the target conditional branch and the target address jump path, obtain a first trace-back basis based on the first mapping relationship, and store the first trace-back basis;

the acquisition device 1020 is used for responding to the target routing rule to determine that the application request hits the target conditional branch, distributing the application request to a target address jump path, obtaining routing information of the application request based on a branch identifier of the target conditional branch, and storing the routing information;

and the checking device 1030 is configured to obtain the routing information of the application request, analyze the routing information of the application request, obtain a branch identifier of the target conditional branch, and determine, according to the first backtracking basis, that the application request jumps through the target address.

The branch prediction apparatus 1010 may be implemented by referring to the branch prediction apparatus in the foregoing description, the acquisition apparatus 1020 may be implemented by referring to the acquisition apparatus in the foregoing description, and the troubleshooting apparatus 1030 may also be implemented by referring to the troubleshooting apparatus in the foregoing description. Accordingly, the system 1000 and each device therein may be configured to implement the method provided in any embodiment of the present application, and specific implementation details may refer to corresponding descriptions in the above method, which are not described herein again.

The embodiment of the application also provides electronic equipment for realizing the method. Fig. 11 shows a block diagram of an electronic device according to an embodiment of the present application. As shown in fig. 11, the electronic apparatus includes: a memory 1110 and a processor 1120, the memory 1110 having stored therein computer programs that may be executed on the processor 1120. The processor 1120 implements the processing method of the routing information in the above-described embodiments when executing the computer program. The number of the memory 1110 and the processor 1120 may be one or more.

The electronic device further includes:

the communication interface 1130 is configured to communicate with an external device to perform data interactive transmission.

If the memory 1110, the processor 1120, and the communication interface 1130 are implemented independently, the memory 1110, the processor 1120, and the communication interface 1130 may be connected to each other through a bus and perform communication with each other. The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended ISA (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 11, but this is not intended to represent only one bus or type of bus.

Optionally, in an implementation, if the memory 1110, the processor 1120, and the communication interface 1130 are integrated on a chip, the memory 1110, the processor 1120, and the communication interface 1130 may complete communication with each other through an internal interface.

Embodiments of the present application further provide a computer-readable storage medium, which stores a computer program, and when the program is executed by a processor, the computer program implements the method provided in any of the embodiments of the present application.

Embodiments of the present application also provide a computer program product comprising a computer program, which when executed by a processor implements the method provided in any of the embodiments of the present application.

The embodiment of the present application further provides a chip, where the chip includes a processor, and is configured to call and execute the instruction stored in the memory from the memory, so that the communication device in which the chip is installed executes the method provided in the embodiment of the present application.

An embodiment of the present application further provides a chip, including: the system comprises an input interface, an output interface, a processor and a memory, wherein the input interface, the output interface, the processor and the memory are connected through an internal connection path, the processor is used for executing codes in the memory, and when the codes are executed, the processor is used for executing the method provided by the embodiment of the application.

It should be understood that the processor may be a Central Processing Unit (CPU), other general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. A general purpose processor may be a microprocessor or any conventional processor or the like. It is noted that the processor may be a processor supporting an Advanced reduced instruction set machine (ARM) architecture.

Further, optionally, the memory may include a read-only memory and a random access memory, and may further include a nonvolatile random access memory. The memory may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The non-volatile Memory may include a Read-only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash Memory. Volatile Memory can include Random Access Memory (RAM), which acts as external cache Memory. By way of example, and not limitation, many forms of RAM are available. For example, static Random Access Memory (Static RAM, SRAM), dynamic Random Access Memory (DRAM), synchronous Dynamic Random Access Memory (SDRAM), double Data Rate Synchronous Dynamic Random Access Memory (DDR SDRAM), enhanced SDRAM (ESDRAM), SLDRAM (synclink DRAM), and Direct Memory bus RAM (DR RAM).

In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. The procedures or functions according to the present application are all or partially generated when the computer program instructions are loaded and executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium.

In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the application. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.

Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or to implicitly indicate the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In the description of the present application, "a plurality" means two or more unless specifically limited otherwise.

Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process. And the scope of the preferred embodiments of the present application includes other implementations in which functions may be performed out of the order shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved.

The logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions.

It should be understood that portions of the present application may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, various steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. All or a portion of the steps of the method of the above embodiments may be performed by associated hardware that is instructed by a program, which may be stored in a computer-readable storage medium, that when executed, includes one or a combination of the steps of the method embodiments.

In addition, functional units in the embodiments of the present application may be integrated into one processing module, or each unit may exist alone physically, or two or more units are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. The above-described integrated module, if implemented in the form of a software functional module and sold or used as a separate product, may also be stored in a computer-readable storage medium. The storage medium may be a read-only memory, a magnetic or optical disk, or the like.

While the present invention has been described with reference to the preferred embodiments, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined by the appended claims. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A processing method of routing information comprises the following steps:

determining a branch identifier for the target conditional branch to obtain a first mapping relation between the branch identifier of the target conditional branch and the target address jump path;

obtaining a first backtracking basis based on the first mapping relation, and storing the first backtracking basis; the first backtracking is used for determining that the application request passes through the target address jump path under the condition that the branch identifier of the target conditional branch is obtained through analysis based on the routing information of the application request; the routing information of the application request is obtained based on branch identifications of N conditional branches hit by the application request, wherein N is an integer greater than or equal to 1.

2. The method of claim 1, wherein the method further comprises:

determining a first branch sequence based on conditional branches under each routing rule in the routing rule set; wherein the first branch sequence comprises branch identifications of M conditional branches, and M is an integer greater than or equal to 1;

determining sequence identifiers for the first branch sequences to obtain second mapping relations between the sequence identifiers of the first branch sequences and the branch identifiers of the M conditional branches;

obtaining a second backtracking basis based on the second mapping relation; and the second backtracking is according to a sequence identifier in the routing information used for analyzing the application request.

3. A processing method of routing information comprises the following steps:

in response to determining that an application request hits a target conditional branch based on a target routing rule, distributing the application request to a target address jump path corresponding to the target conditional branch;

based on the branch identification of the target conditional branch, obtaining the routing information of the application request, and storing the routing information; the routing information is used for determining that the application request passes through the target address jump path in combination with a first backtracking basis, and the first backtracking basis comprises a first mapping relation between a branch identifier of the target conditional branch and the target address jump path.

4. The method of claim 3, wherein the obtaining routing information of the application request based on the branch identification of the target conditional branch comprises:

determining a second branch sequence corresponding to the application request based on the branch identification of the target conditional branch; wherein the second branch sequence comprises branch identifications of N conditional branches hit by the application request, and N is an integer greater than or equal to 1;

and obtaining the routing information of the application request based on the sequence identification of the second branch sequence.

5. The method of claim 3 or 4, wherein the branch identification of the target conditional branch is recorded with a binary information bit in the context of the application request.

6. The method according to claim 3 or 4, wherein the deriving routing information of the application request based on the branch identification of the target conditional branch comprises;

7. A method for processing routing information comprises the following steps:

acquiring routing information of an application request;

responding to the branch identifications of the target conditional branch including the target routing rule in the N branch identifications, and determining that the application request passes through a target address jump path according to a first backtracking basis; the first backtracking is based on a first mapping relation between the branch identifier including the target conditional branch and the target address jump path.

8. The method of claim 7, wherein the parsing the routing information of the application request to obtain N branch identities comprises:

analyzing the sequence identification in the routing information based on a second backtracking basis to obtain the N branch identifications; wherein the second backtracking criterion includes a second mapping relationship between the sequence identifier and the N branch identifiers.

9. A processing apparatus of routing information, comprising:

a branch marking module, configured to determine a branch identifier for the target conditional branch, to obtain a first mapping relationship between the branch identifier of the target conditional branch and the target address jump path;

the first relation recording module is used for obtaining a first backtracking basis based on the first mapping relation and storing the first backtracking basis; the first backtracking is used for determining that the application request passes through the target address jump path under the condition that the branch identifier of the target conditional branch is obtained through analysis based on the routing information of the application request; the routing information of the application request is obtained based on branch identifications of N conditional branches hit by the application request, wherein N is an integer greater than or equal to 1.

10. A processing apparatus of routing information, comprising:

the rule judging module is used for responding to the condition branch of the target which is hit by the application request and is determined based on the target routing rule, and distributing the application request to a target address jump path corresponding to the condition branch of the target;

a route recording module, configured to obtain route information of the application request based on the branch identifier of the target conditional branch and store the route information; the routing information is used for determining that the application request passes through the target address jump path in combination with a first backtracking basis, and the first backtracking basis comprises a first mapping relation between a branch identifier of the target conditional branch and the target address jump path.

11. A processing apparatus of routing information, comprising:

a path determining module, configured to determine, according to a first trace-back basis, that the application request jumps through a target address in response to a branch identifier of a target conditional branch including a target routing rule among the N branch identifiers; the first trace-back is based on a first mapping relation between a branch identifier including the target conditional branch and the target address jump path.

12. A system for processing routing information, comprising:

the branch prediction device is used for determining a target conditional branch of a target routing rule and a target address jump path corresponding to the target conditional branch, determining a branch identifier for the target conditional branch, obtaining a first mapping relation between the branch identifier of the target conditional branch and the target address jump path, obtaining a first backtracking basis based on the first mapping relation, and storing the first backtracking basis;

the acquisition device is used for responding to the situation that an application request hits the target conditional branch based on a target routing rule, distributing the application request to the target address jump path, obtaining the routing information of the application request based on the branch identification of the target conditional branch, and storing the routing information;

and the checking device is used for acquiring the routing information of the application request, analyzing the routing information of the application request, obtaining the branch identifier of the target conditional branch, and determining the jump path of the application request passing through the target address according to the first backtracking basis.

13. An electronic device comprising a memory, a processor and a computer program stored on the memory, the processor implementing the method of any one of claims 1-8 when executing the computer program.

14. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the method of any one of claims 1-8.