CN115225572B - Processing method and device of routing information, electronic equipment and storage medium - Google Patents

Processing method and device of routing information, electronic equipment and storage medium Download PDF

Info

Publication number
CN115225572B
CN115225572B CN202210827258.3A CN202210827258A CN115225572B CN 115225572 B CN115225572 B CN 115225572B CN 202210827258 A CN202210827258 A CN 202210827258A CN 115225572 B CN115225572 B CN 115225572B
Authority
CN
China
Prior art keywords
branch
target
application request
backtracking
conditional
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202210827258.3A
Other languages
Chinese (zh)
Other versions
CN115225572A (en
Inventor
江河清
罗毅
郭浩
刘军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Alibaba China Co Ltd
Original Assignee
Alibaba China Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Alibaba China Co Ltd filed Critical Alibaba China Co Ltd
Priority to CN202210827258.3A priority Critical patent/CN115225572B/en
Publication of CN115225572A publication Critical patent/CN115225572A/en
Application granted granted Critical
Publication of CN115225572B publication Critical patent/CN115225572B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/74Address processing for routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/14Routing performance; Theoretical aspects
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/30Routing of multiclass traffic
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The embodiment of the application provides a processing method, a device, electronic equipment and a storage medium of routing information. The method comprises the following steps: determining a target condition branch of a target routing rule and a target address jump path corresponding to the target condition branch; determining a branch identifier for a target conditional branch to obtain a first mapping relationship 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 a jump path of the application request passing through the target address under the condition that the route information based on the application request is analyzed to obtain the branch identification of the target conditional branch; 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. According to the embodiment of the application, the cost and difficulty of route diagnosis can be reduced, and the performance and efficiency of route diagnosis are improved.

Description

Processing method and device of routing information, electronic equipment and storage medium
Technical Field
The present disclosure 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-grown era, the complexity of applications and the number of users reached are also continually increasing. Accordingly, the machine size of the application deployment is also more massive. In some scenarios, the number of service nodes applied may even be on the order of hundreds of thousands. Meanwhile, the function diversification of the service nodes of the application is also more and more obvious. Within the same application, different responsibilities are assigned to different groups of machines deployed in different machine rooms, different capabilities.
Based on this, various routing rules (e.g., specific area traffic closure, near access, etc.) have developed, and routing of service frameworks has become more and more complex. Since the routing process of the application request is often determined based on the condition at the time of actual call, it is difficult to construct a request reaching the same condition at the time of post-diagnosis to reproduce the routing process, which causes great difficulty in route diagnosis.
Disclosure of Invention
The embodiment of the application provides a processing method, a device, electronic equipment and a storage medium of routing information, so as to solve the problems of the related technology, 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 condition branch of a target routing rule and a target address jump path corresponding to the target condition branch;
determining a branch identifier for a target conditional branch to obtain a first mapping relationship between the branch identifier of the target conditional branch and a target address jump path;
obtaining a first backtracking basis based on a first mapping relation, and storing the first backtracking basis; the first backtracking is used for determining a jump path of the application request passing through the target address under the condition that the route information based on the application request is analyzed to obtain the branch identification of the target conditional branch; 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 route 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;
based on the branch identification of the target conditional branch, obtaining the route information of the application request and storing the route information; the routing information is used for determining that the application request passes through the target address jump path according to a first backtracking basis, and the first backtracking basis comprises a first mapping relation between the branch identification of the 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 target conditional branches comprising target routing rules in the N branch identifications, and determining a jump path of an application request passing through a target address according to a first backtracking basis; the first backtracking is based on a first mapping relationship between a branch identifier comprising a target conditional branch and a target address jump path.
In a fourth aspect, an embodiment of the present application provides a processing apparatus for routing information, including:
the branch prediction module is used for determining a target conditional branch of the 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 the 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 a jump path of the application request passing through the target address under the condition that the route information based on the application request is analyzed to obtain the branch identification of the target conditional branch; 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 processing apparatus for routing information, including:
the rule judging module is used for responding to the target route rule to determine that the application request hits the target conditional branch and distributing the application request to the target address jump path corresponding to the target conditional branch;
the route recording module is used for obtaining the route information of the application request based on the branch identification of the target conditional branch and storing the route information; the routing information is used for determining that the application request passes through the target address jump path according to a first backtracking basis, and the first backtracking basis comprises a first mapping relation between the branch identification of the target conditional branch and the target address jump path.
In a sixth aspect, an embodiment of the present application provides a processing apparatus for routing information, including:
the information acquisition module is used for acquiring the routing information of the application request;
the route analysis module is used for analyzing the route 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 comprising the target routing rule in the N branch identifiers and determining a jump path of the application request passing through the target address according to the first backtracking basis; the first backtracking is based on a first mapping relationship between a branch identifier comprising a target conditional branch and a target address jump path.
In a seventh aspect, embodiments of the present application provide an electronic device, including a memory, a processor, and a computer program stored on the memory, the processor implementing the method provided by any of the embodiments of the present application when the computer program is executed.
In an eighth aspect, embodiments of the present application provide a computer readable storage medium having a computer program stored therein, which when executed by a processor, implements a method provided by any of the embodiments of the present application.
According to the technical scheme of the embodiment of the application, the branch identification can be allocated in advance for the conditional branch of the routing rule, 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 an application request is routed, routing information is obtained based on the branch identification of the conditional branch hit by the application request. When the route process of the application request needs to be traced, the branch identification of the conditional branch hit by the application request can be obtained by analyzing the route information, so that the trace is realized by determining the address jump path passed by the application request according to the tracing. It can be seen that the technical solution of the embodiment of the present application dynamically records the conditional branches hit by the application request, backtracks the routing process of the application request based on the recorded information, avoids the problem of reproduction of the routing process by the application request, and reduces the cost and difficulty of route diagnosis. And because branch identifiers are allocated for conditional branches of the routing rule in advance, a backtracking basis is constructed based on the mapping relation between the branch identifiers and the address jump paths, and only the branch identifiers of the conditional branches actually hit by the application request are required to be recorded, the address jump paths of the application request in the routing process can be backtracked, the acquired and stored data quantity is compressed, the acquisition of the routing information of the whole application request is possible, and the performance and the efficiency of route backtracking and diagnosis are improved.
The foregoing summary is for the purpose of the specification 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 become apparent by reference to the drawings and the following detailed description.
Drawings
In the drawings, the same reference numerals refer to the same or similar parts or elements throughout the several views unless otherwise specified. The figures are not necessarily drawn to scale. It is appreciated that these drawings depict only some embodiments according to the disclosure and are not therefore 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 processing method of the routing information.
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 of processing routing information according to yet another embodiment of the present application.
Fig. 6 is a schematic diagram of an application example two of the processing method of the routing information.
Fig. 7 is a block diagram of a routing information processing apparatus according to an embodiment of the present application.
Fig. 8 is a block diagram of a routing information processing apparatus according to another embodiment of the present application.
Fig. 9 is a block diagram of a processing apparatus of routing information according to still another embodiment of the present application.
Fig. 10 is a block diagram of a routing information processing system 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
Hereinafter, only certain exemplary embodiments are briefly described. As will be recognized by those of skill in the pertinent art, the described embodiments may be modified in various different ways 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.
In order to facilitate understanding of the technical solutions of the embodiments of the present application, the following description is given of related technologies of the embodiments of the present application, and the following related technologies may be optionally combined with the technical solutions of the embodiments of the present application as an alternative, which all 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. Route diagnosis is mainly to diagnose whether a route result meets expectations, for example, whether an application request initiated by a user arrives at a target service node, whether a 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 may be traced back by:
Mode one: and constructing similar application requests through the processing results of the application requests, parameters during the application log back-pushing requests and other information so as to simulate the routing scene of the application requests. And judging the specific execution process of each routing rule in a code diagnosis mode and the like to acquire the routing information. The difficulty of data construction in this manner is great, and an intuitive judgment is required. In addition, the auxiliary judgment is needed to be intervened by a developer of the routing rule, and the diagnosis cost is high.
Mode two: and carrying out static embedding on all code branches passed by the application request, carrying out full-flow recording and outputting in a log mode when the application request is requested, and finally judging a calling process according to the log. This approach requires a significant amount of data to temporarily store, and consumes a significant amount of memory space. In addition, in a scenario where the concurrency number is high, the log-drop can greatly increase the pressure of the disk IO (Input/Output). Because of the large output, it is not suitable to collect all application requests, and often problematic requests cannot be collected correctly.
Mode three: based on the second mode, the application request routing process of a specific abnormal scene (for example, no address is found after multiple routes) is collected. Since the processing result cannot be foreseen when the application request is routed for the first time, the secondary routing is required. Many context data are lost during secondary routing, and the performance is seriously affected by secondary routing in extreme scenes. Moreover, since only part of application requests are collected, the problem of routing decision errors which are not easy to find but have huge influence cannot be covered.
The processing method of the routing information provided by the embodiment of the application is mainly used for solving the technical problems. In order to more clearly show the processing method of the routing information provided in the embodiment of the present application, first, an application scenario that can be used to implement the method is described.
Fig. 1 shows a schematic diagram of an exemplary application scenario. As shown in fig. 1, the processing method of routing information provided in the embodiment of the present application may implement routing diagnosis on an application based on a branch prediction device, an acquisition device and an investigation device, for example, determine whether each routing rule is accurate in the routing process of an application request.
It should be noted that, the application in the embodiments of the present application specifically refers to a computer application for providing a user service. The application may include, for example, a cloud application, i.e., an application that operates with computer resources cooperatively provided by one or more server clusters in the cloud. Service nodes, such as servers, server clusters, etc., for running applications may be deployed in different areas, and therefore, when the application runs, the application requests need to be distributed according to a series of rules, so that the application requests can accurately reach the target service node. Illustratively, the routing rules in the embodiments of the present application may include rules 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 the address jump path corresponding to the condition. Here, the condition related to the parameter of the application request belongs to a branch of the routing rule, and thus may also be referred to as a conditional branch.
As shown in fig. 1, the branch prediction apparatus acquires a routing rule related to application, enumerates each conditional branch of each routing rule that may occur 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 identification of the conditional branch hit by the application request in the specific execution process of each routing rule, and the routing information is obtained. When the checking device triggers the route state backtracking, for example, when the problem of route decision errors exists in the application is found, the processing of application requests of each route rule is backtracked based on the route information collected by the collecting device and the mapping relation determined by the branch prediction device.
For a more complete understanding of the features and technical content of the embodiments of the present application, reference should be made to the following detailed description of the embodiments of the present application, taken in conjunction with the accompanying drawings, which are for purposes of illustration only and not intended to limit the embodiments of the present application.
Fig. 2 shows a flowchart of a method for processing routing information according to an embodiment of the present application. The method may be performed by a processing device of the routing information, such as the branch prediction device described above. As shown in fig. 2, the method may include the following steps.
Step S210: determining a target condition branch of a target routing rule and a target address jump path corresponding to the target condition branch;
step S220: determining a branch identifier for a target conditional branch to obtain a first mapping relationship 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 a jump path of the application request passing through the target address under the condition that the route information based on the application request is analyzed to obtain the branch identification of the target conditional branch; 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.
Illustratively, in step S210 described above, the target routing rule may include applying any of the relevant routing rules. For example, multiple routing rules associated with an application may be traversed, with each traversal to one routing rule being determined to be the target routing rule. As described above, conditions associated with parameters of an application request, which may be referred to as conditional branches, may be configured in the target routing rule. Wherein, the application request may refer to a service request initiated by a user for the application.
Illustratively, in step S210 described above, the target conditional branch may include any one of the conditional branches of the target routing rule. Illustratively, 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-described processing is performed. The manner of enumeration is, for example: for the parameters of the application request, predicting the possible situations of each parameter, and taking each situation as one conditional branch, namely, realizing enumeration of the conditional branches.
When an application is running, the application request may be routed to different paths for different conditional branches, each of which may be directed to a different node. For example, different paths may point to different clusters of servers. For another example, the target routing rule may correspond to a plurality of condition judgment nodes, and the application request may flow to the server cluster through a different number of condition judgment nodes, so different paths may also point to different condition judgment nodes and server clusters. These condition determining nodes and address information of the server cluster, e.g. IP addresses, may be used to characterize the path, which may thus be referred to as address hop path.
Illustratively, in step S220 described above, the branch identification is used to identify conditional branches, e.g., the branch identification may be the number of the conditional branch. Illustratively, the branch identification may be purely digital data, such as binary data. Because different conditional branches correspond to different address jump paths, the branch identifier and the address jump path have a mapping relationship, and in the embodiment of the application, the mapping relationship between the branch identifier and the address jump path is called a first mapping relationship. Since the target conditional branch corresponds to the target address jump path, a first mapping relationship between the branch identification of the target conditional branch and the target address jump path may be determined when the branch identification is allocated for the target conditional branch.
Illustratively, in the above step S230, the first traceback basis is used as a basis for traceback of the routing procedure of the application request, and may include a first mapping relationship. Optionally, the first traceback criterion may further include at least one first mapping relationship corresponding to at least one conditional branch of the target routing rule, respectively. Thus, the first traceback basis can be utilized to determine the corresponding address jump path based on the identification of the conditional branch.
In the method, the first backtracking is used for determining that the application request passes through the target address jump path under the condition that the route information based on the application request is analyzed to obtain the branch identification of the target conditional branch. The routing information of the application request is obtained based on branch identifiers of N conditional branches hit by the application request. That is, the route information of the application request may be obtained based on the identifiers of the N conditional branches hit by the application request, and accordingly, the branch identifiers of the N conditional branches hit by the application request may be resolved based on the route information, if the branch identifiers include the branch identifiers of the target conditional branches, the N conditional branches hit by the application request may be indicated to include the target conditional branches, and the branch identifiers may be determined to correspond to the target address jump path according to the first mapping relationship in the first traceback basis, thereby determining that the application request passes through the target address jump path. In particular, when the application runs, the identification of each conditional branch hit by the application request can be recorded in the process of processing the application request by using each routing rule. In the above description, a conditional branch is hit, which can be understood as meeting the condition corresponding to the branch.
Alternatively, the application request may include multiple information via the destination address jump path. Specifically, determining that the application request passes through the destination address jump path may include: the method includes determining that a target routing rule indicates that an application request hits a target conditional branch at application runtime and triggering distribution of the application request to a target address jump path. Therefore, whether the target routing rule carries out accurate conditional branching judgment or not can be diagnosed, and whether the conditional branching corresponds to an accurate address jump path or not.
It can be seen that the method allocates the branch identifier for the conditional branch of the routing rule, associates the address jump path corresponding to the conditional branch with the branch identifier, and obtains the backtracking basis by using the mapping relation between the address jump path and the branch identifier. Based on the method, the routing process of the backtracking application request can be called through dynamically recording the hit conditional branch of the application request, so that the problem that the routing process needs to be reproduced by the reconfiguration application request is avoided, and the cost and difficulty of route diagnosis are reduced. And because branch identifiers are allocated for conditional branches of the routing rule in advance, a backtracking basis is constructed based on the mapping relation between the branch identifiers and the address jump paths, and only the branch identifiers of the conditional branches actually hit by the application request are required to be recorded, the address jump paths of the application request in the routing process can be backtracked, the acquired and stored data quantity is compressed, the acquisition of the routing information of the whole application request is possible, and the performance and the efficiency of route backtracking and diagnosis are improved.
A specific example is provided below that illustrates how the branch identity is determined for conditional branches under routing rules. Fig. 3 shows a schematic diagram of 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 proximity routing rule is used to determine an address hop path for an application request based on the source of the application request. On this basis, the application runtime is allowed to statically or dynamically designate target service nodes (such as server clusters), 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 designated service nodes; it also allows setting single request diversion targets to distribute the currently invoked application request to another designated service node or nodes. The nearby routing rule determines a node according to three branches, namely, a global traffic diversion target, a single request diversion target and a traffic source (i.e., a source of an application request), and can distribute the application request to a plurality of address jump paths. As shown in fig. 3, based on the three branch judgment nodes, 12 links between the nodes are derived in total, and numerals 1 to 12 are respectively used as identifiers. Based on the connections between these 12 links, 9 conditional branches under the nearby routing rules can be derived, examples are as follows:
(1) Setting a global flow diversion target which is a branch of the first server cluster;
(2) Setting a global flow diversion target which is a branch of the second server cluster;
(3) Setting a global flow diversion target which is a branch of the third server cluster;
(4) The method comprises the steps that a global flow diversion target is not set, but a single-request diversion target is set, wherein the single-request diversion target is a branch of a first server cluster;
(5) The method comprises the steps that a global flow diversion target is not set, but a single-request diversion target is set, wherein the single-request diversion target is a branch of a second server cluster;
(6) The method comprises the steps that a global flow diversion target is not set, but a single-request diversion target is set, wherein the single-request diversion target is a branch of a third server cluster;
(7) The method comprises the steps that a global flow diversion target is not set, a single request diversion target is not set, and a flow source is a branch of a first server cluster;
(8) The method comprises the steps that no global flow diversion target is set, no single request diversion target is set, and the flow source is a branch of a second server cluster;
(9) The global traffic diversion target is not set, the single request diversion target is not set, and the traffic 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 the branch (1) is: jumping from the first branch judgment node (global traffic diversion target) to the first server cluster; the address jump path corresponding to the branch (7) is as follows: the method comprises the steps of jumping from a first branch judgment node to a second branch judgment node (single request diversion target), jumping from the second branch judgment node to a third branch judgment node (traffic source), and jumping from the third branch judgment node to the first server cluster. The conditional branches are respectively assigned with identifiers, and letters a to I can be respectively used as branch identifiers as shown in fig. 3, and corresponding branches and address jump paths can be determined based on the branch identifiers. For example, the label G corresponds to the above-mentioned branch (7), and the branch (7) corresponds to the address jump path of the link 1-link 5-link 9-link 10.
It will be appreciated that in the above application examples, decimal numbers and letters are used as identifiers, so as to make the scheme clearly expressed. In practical applications, other mathematical representation forms can be used as the identification, for example, binary information bits are used as the identification.
Optionally, on the basis of determining the branch identifiers for each conditional branch by the method, a conditional branch sequence obtained based on a plurality of routing rules can be determined, and the sequence identifiers are determined for the conditional branch sequence, so that the branch identifiers of N conditional branches hit by the application request can be converted into the sequence identifiers to be stored, 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 set of routing rules; the first branch sequence comprises branch identifiers of M conditional branches, wherein M is an integer greater than or equal to 1;
determining a sequence identifier for the first branch sequence to obtain a second mapping relation between the sequence identifier of the first branch sequence and branch identifiers of M conditional branches;
obtaining a second backtracking basis based on the second mapping relation; the second backtracking is based on sequence identification in the routing information for analyzing the application request.
The set of routing rules may include, for example, a plurality of routing rules associated with an application. Based on conditional branches under each routing rule, a plurality of conditional branch sequences may be obtained, e.g., different conditional branches under each routing rule may be combined, and different conditional branch sequences may be obtained. The plurality of conditional branch sequences includes the first branch sequence. Alternatively, the first branch sequence may be any one of the conditional branch sequences.
Illustratively, L routing rules may be included in the routing rule set, L being an integer greater than or equal to M. The M conditional branches corresponding to the first branch sequence may correspond to the first M routing rules of the L routing rules, respectively. Enumeration of branch sequences is achieved by changing the value of M and enumerating conditional branches of each routing rule in the M routing rules, so that the branch sequences are selected from the enumerated branch sequences one by one to serve as first branch sequences, and the sequence identification determining process is conducted.
For example, if a branching sequence includes a plurality of conditional branches, each conditional branch having a branch identifier of A, B, E, if the branching sequence is characterized by ABE, the data amount of three letters needs to be processed at the time of recording and storing. If the branch sequence is assigned a sequence identification, for example Z, i.e. the branch sequence is characterized by Z, then the data amount of one letter needs to be processed at the time of recording and storing. It can be seen that by assigning sequence identifications to branch sequences, the amount of data processed in each flow associated with route diagnosis can be greatly reduced.
Illustratively, 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 as described above. And obtaining a second backtracking basis based on the mapping relation, and analyzing the routing information into at least one branch identifier under the condition that the routing information is the sequence identifier, so as to read at least one conditional branch through which the application request passes.
Illustratively, the second trace-back basis may include a second mapping relationship between a sequence identifier of each of the enumerated plurality of branch sequences and a branch identifier of its corresponding respective conditional branch.
The embodiment of the application also provides another processing method of the routing information. The method may be performed by a processing device for routing information, such as the acquisition device described above, and fig. 4 shows a flowchart of a method for processing 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 route 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: based on the branch identification of the target conditional branch, obtaining the route information of the application request, and storing the route information; the routing information is used for determining that the application request passes through the target address jump path according to a first backtracking basis, and the first backtracking basis comprises a first mapping relation between the branch identification of the target conditional branch and the target address jump path.
The technical details of each information in the above method may refer to the foregoing embodiments, and are not described herein. It can be seen that the method is mainly used for processing application requests 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 identification 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 with binary information bits in the context of the application request.
Alternatively, the routing information may include branch identifications of N conditional branches hit by the application request, N being an integer greater than or equal to 1. The obtaining the route information of the application request based on the branch identifier of the target conditional branch may include: when the application request hits the target conditional branch, adding a branch identification 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 data format of the binary information bit is converted to obtain the routing information.
Alternatively, the routing information may include a sequence identification of a branching sequence of N conditional branches hit by the application request. The branch identification based on the target conditional branch obtains the routing information of the application request, including: 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 includes 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 of N conditional branches hit by the application request. By enumerating the branch sequences and assigning sequence identifications in the branch prediction device, N conditional branches can be recorded as sequence identifications of the second branch sequences, based on which routing information is obtained when the application request call is completed. Thereby greatly reducing the data volume of the routing information, reducing the data storage volume and improving the data processing efficiency.
It can be seen that, in the technical solution of the embodiment of the present application, when an application request is routed, routing information is obtained based on the branch identifier of the conditional branch hit by the application request. When the route process of the application request needs to be traced back, the route tracing can be realized by analyzing the route information to obtain the branch identification of the conditional branch hit by the application request and determining the address jump path passed by the application request according to the tracing. The problem that the routing process is repeated by the application request needs to be reconstructed is avoided, and the cost and difficulty of route diagnosis are reduced. And the data volume of collection and storage is compressed, so that the collection of the routing information of the whole application request is possible, and the performance and efficiency of route backtracking and diagnosis are improved.
Optionally, in order to improve the route diagnosis efficiency, the above-mentioned acquisition process may also be performed for an application request that meets an abnormal condition. Specifically, in the above method, route information of an application request is obtained based on a branch identifier of a target conditional branch, including; and under the condition that the application request accords with a preset abnormal condition, obtaining the routing information of the application request based on the branch identification of the target conditional branch.
The exception condition is, for example, that the destination address is not found after the application request is routed multiple times. The resource utilization rate of route diagnosis can be improved by carrying out route information acquisition and backtracking on the application request meeting the abnormal condition.
The embodiment of the application also provides another processing method of the routing information. The method may be performed by a processing device for routing information, such as the above-described investigation device, and fig. 5 shows a flowchart of a processing method for 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 target conditional branches comprising target routing rules in the N branch identifications, and determining a jump path of an application request passing through a target address according to a first backtracking basis; the first backtracking is based on a first mapping relationship between a branch identifier comprising a target conditional branch and a target address jump path.
The technical details of each information in the above method may refer to the foregoing embodiments, and are not described herein. It can be seen that the method is mainly used for determining the path of the application request based on the route information and the backtracking basis during route backtracking. In the method, N branch identifications are obtained by analyzing the route information, and then an address jump path passed by an application request is determined according to each branch identification. Illustratively, since the N branch identifiers correspond to the N conditional branches and the conditional branches are attributed to the routing rules, based on the branch identifiers, the processing manner of the application request in the routing rules to which the corresponding conditional branches belong can be determined, so that the accuracy of the routing rules can be diagnosed.
Alternatively, the routing information may include the N branch identifiers, and then the N branch identifiers may be directly extracted from the routing information.
Alternatively, 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, including: based on the second backtracking basis, analyzing the sequence identifications in the route information to obtain N branch identifications; the second backtracking is based on a second mapping relation between the sequence identifier and the N branch identifiers.
The second backtracking basis may include a second mapping relationship between each sequence identifier of the plurality of sequence identifiers and a plurality of branch identifiers corresponding to the sequence identifiers.
According to the method, when the routing process of the application request needs to be traced back, the branch identification of the conditional branch hit by the application request can be obtained by analyzing the routing information, so that the trace back is realized by determining the address jump path passed by the application request according to the tracing back. The problem that the routing process is repeated by the application request needs to be reconstructed is avoided, and the cost and difficulty of route diagnosis are reduced. And the data volume of collection and storage is compressed, so that the collection of the routing information of the whole application request is possible, and the performance and efficiency of route backtracking and diagnosis are improved.
In order to more clearly present the technical ideas of the present application, a specific application example is provided below to illustrate the processing procedure of the above-mentioned acquisition device and investigation device. Fig. 6 shows a schematic diagram of an application example two of the processing method of the routing information.
As shown in fig. 6, in the application system, 3 routing rules are set, denoted as routing rule 1, routing rule 2, and routing rule 3, respectively, whereby a plurality of conditional branches are derived. The routing rule 1 includes five conditional branches a to E, corresponding to address combinations 1 to 5, respectively, that is, corresponding to 5 different address jump paths. The routing rule 2 includes conditional branches a to E corresponding to address combinations 1 to 5, respectively, i.e. corresponding to 5 different address hopping paths. The routing rule 3 includes conditional branches a to E corresponding to address combinations 1 to 5, respectively, i.e. corresponding to 5 different address hopping paths. The application request sequentially enters each routing rule according to the sequence of the routing rules to carry out independent judgment, wherein the application request is assumed to hit the conditional branch A of the routing rule 1, and the context can be used for recording the data A in the state bit corresponding to the routing rule 1; the routing rule 2 and the routing rule 3 record data B and E in the same way. After route addressing, the context records the ABE, and the route information of the request can be recorded as the ABE through a third-party full-link log acquisition tool. If a sequence identifier, for example, Z, is allocated to the branch sequence ABE in advance, the route information of the current request can be recorded as Z by a third-party full-link log acquisition tool.
When the route state backtracking is needed, the route information ABE or Z of the request for the backtracking is obtained through a third-party full-link log acquisition tool. And then the whole routing process can be clearly analyzed 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 each time).
Corresponding to the application scene and the method of the method provided by the embodiment of the application, the embodiment of the application also provides a device for processing the 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;
the branch marking module 720 is configured to determine a branch identifier for the target conditional branch, and 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 a jump path of the application request passing through the target address under the condition that the route information based on the application request is analyzed to obtain the branch identification of the target conditional branch; 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 set of routing rules; the first branch sequence comprises branch identifiers of M conditional branches, wherein 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 branch identifiers of the M conditional branches;
a second relationship recording module 760, configured to obtain a second backtracking basis based on the second mapping relationship; the second backtracking is based on sequence identification 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:
a rule judging module 810, 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 according to a first backtracking basis, and the first backtracking basis comprises a first mapping relation between the branch identification of the 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, N being 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 identifiers of N conditional branches hit by the application request, wherein 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 binary information bits in the context of the application request.
Optionally, the route recording module 820 is specifically configured to:
and under the condition that the application request accords with a preset abnormal condition, obtaining the routing information of the application request based on the branch identification of the target conditional branch.
The embodiment of the application also provides a processing device of the routing information. The device may be the investigation device described above. Referring to fig. 9, the apparatus 900 may include:
the route parsing module 910 is configured to parse the route information of the application request to obtain N branch identifiers, where N is an integer greater than or equal to 1;
The path determining module 920 is configured to determine, according to the first trace-back basis, a path of the application request to jump through the target address according to a branch identifier of a target conditional branch including the target routing rule in the N branch identifiers; the first backtracking is based on a first mapping relationship between a branch identifier comprising a target conditional branch and a target address jump path.
Optionally, the route parsing module 910 is specifically configured to: based on the second backtracking basis, analyzing the sequence identifications in the route information to obtain N branch identifications; the second backtracking is based on a second mapping relation between the sequence identifier and the N branch identifiers.
The functions of each module in each device of the embodiments of the present application may be referred to the corresponding descriptions in the above methods, and have corresponding beneficial effects, which are not described herein.
The embodiment of the application also provides a system for realizing the method. Fig. 10 shows a block diagram of a processing system of 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 traceback basis based on the first mapping relationship, and store the first traceback basis;
The collecting device 1020 is configured to respond to determining that the application request hits the target conditional branch based on the target routing rule, distribute the application request to the target address jump path, obtain routing information of the application request based on the branch identifier of the target conditional branch, and store the routing information;
the checking device 1030 is configured to obtain 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 trace back basis, a path of the application request through the target address jump.
The branch prediction apparatus 1010 may be implemented with reference to the branch prediction apparatus in the foregoing description, the acquisition apparatus 1020 may be implemented with reference to the acquisition apparatus in the foregoing description, and the investigation apparatus 1030 may be implemented with reference to the investigation apparatus in the foregoing description. Accordingly, the system 1000 and each device thereof may be used 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 repeated herein.
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 device includes: a memory 1110 and a processor 1120, the memory 1110 having stored thereon a computer program executable on the processor 1120. The processor 1120, when executing the computer program, implements the method for processing routing information in the above embodiment. The number of memories 1110 and processors 1120 may be one or more.
The electronic device further includes:
and the communication interface 1130 is used for communicating with external equipment and carrying out data interaction 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 and perform communication with each other through buses. The bus may be an industry standard architecture (Industry Standard Architecture, ISA) bus, an external device interconnect (Peripheral Component Interconnect, PCI) bus, or an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus, among others. The bus may be classified as an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 11, but not only one bus or one type of bus.
Alternatively, in a specific implementation, if the memory 1110, the processor 1120, and the communication interface 1130 are integrated on a single chip, the memory 1110, the processor 1120, and the communication interface 1130 may communicate with each other through internal interfaces.
The present application also provides a computer-readable storage medium storing a computer program which, when executed by a processor, 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 application also provides a chip, which comprises a processor and is used for calling the instructions stored in the memory from the memory and running the instructions stored in the memory, so that the communication device provided with the chip executes the method provided by the embodiment of the application.
The embodiment of the application also provides a chip, which comprises: 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 application embodiment.
It should be appreciated that the processor may be a central processing unit (Central Processing Unit, CPU), but may also be other general purpose processors, digital signal processors (Digital Signal Processing, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field programmable gate arrays (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. 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 (Advanced RISC Machines, 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 volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The nonvolatile Memory may include Read-only Memory (ROM), programmable ROM (PROM), erasable Programmable ROM (EPROM), electrically Erasable EPROM (EEPROM), or flash Memory, among others. Volatile memory can include random access memory (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 RAM (SRAM), dynamic RAM (Dynamic Random Access Memory, DRAM), synchronous DRAM (SDRAM), double Data Rate Synchronous DRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), and Direct RAM (DR RAM).
In the above embodiments, it may be implemented in whole or in part 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. When the computer program instructions are loaded and executed on a computer, the processes or functions in accordance with the present application are produced in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. Computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another.
In the description of the present specification, a description referring to terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means 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 present 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, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature. In the description of the present application, the meaning of "a plurality" is two or more, unless explicitly defined otherwise.
Any process or method description in a flowchart 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 additional implementations in which functions may be performed in a substantially simultaneous manner or in an opposite order from that shown or discussed, including in accordance with the functions that are involved.
Logic and/or steps represented in the flowcharts or otherwise described herein, e.g., a ordered listing of executable instructions for implementing 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 is to be understood that portions of the present application may be implemented in hardware, software, firmware, or a combination thereof. In the above-described embodiments, the 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 part of the steps of the methods of the embodiments described above may be performed by a program that, when executed, comprises one or a combination of the steps of the method embodiments, instructs the associated hardware to perform the method.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing module, or each unit may exist alone physically, or two or more units may be integrated in one module. The integrated modules may be implemented in hardware or in software functional modules. The integrated modules described above, if implemented in the form of software functional modules and sold or used as a stand-alone 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.
The foregoing is merely a specific embodiment of the present application, but the protection scope of the present application is not limited thereto, and any person skilled in the art can easily think of various changes or substitutions within the technical scope of the present application, and these should be covered in the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (14)

1. A method of processing routing information, comprising:
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 relationship 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 route information based on the application request is analyzed to obtain the branch identification of the target conditional branch; the routing information of the application request is obtained based on branch identifiers of N conditional branches hit by the application request, and 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 set of routing rules; the first branch sequence comprises branch identifiers of M conditional branches, wherein M is an integer greater than or equal to 1;
determining a sequence identifier for the first branch sequence to obtain a second mapping relation between the sequence identifier of the first branch sequence and the branch identifiers of the M conditional branches;
obtaining a second backtracking basis based on the second mapping relation; the second backtracking is used for analyzing the sequence identification in the routing information of the application request.
3. A method of processing routing information, comprising:
responding to the target condition branch hit of an application request based on a target routing rule, and distributing the application request to a target address jump path corresponding to the target condition branch;
based on the branch identification of the target conditional branch, obtaining the route information of the application request, and storing the route information; the routing information is used for determining that the application request passes through the target address jump path according to 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. A method according to claim 3, wherein said deriving routing information for said application request based on a branch identification of said target conditional branch comprises:
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 identifiers of N conditional branches hit by the application request, wherein 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 identity of the target conditional branch is recorded with binary information bits in the context of the application request.
6. The method according to claim 3 or 4, wherein the obtaining routing information of the application request based on the branch identification of the target conditional branch includes;
and under the condition that the application request accords with a preset abnormal condition, obtaining the routing information of the application request based on the branch identification of the target conditional branch.
7. A method of processing routing information, comprising:
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 target conditional branches comprising target routing rules in the N branch identifications, and determining a jump path of the application request passing through a target address according to a first backtracking basis; the first backtracking is based on a first mapping relation between a branch identifier comprising 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 identifications comprises:
analyzing the sequence identifications in the routing information based on a second backtracking basis to obtain the N branch identifications; the second backtracking basis comprises a second mapping relation between the sequence identifier and the N branch identifiers.
9. A processing apparatus of routing information, comprising:
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 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 route information based on the application request is analyzed to obtain the branch identification of the target conditional branch; the routing information of the application request is obtained based on branch identifiers of N conditional branches hit by the application request, and 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 target condition branch hit of 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 route recording module is used for obtaining the route information of the application request based on the branch identification of the target conditional branch and storing the route information; the routing information is used for determining that the application request passes through the target address jump path according to 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:
the information acquisition module is used for acquiring the routing information of the application request;
the route analysis module is used for analyzing the route 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 a jump path of the application request passing through the target address according to a first backtracking basis; the first backtracking is based on a first mapping relation between a branch identifier comprising 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 target condition branch hit of the application request based on the 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 condition 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 identification 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 the computer program is executed.
14. A computer readable storage medium having stored therein a computer program which, when executed by a processor, implements the method of any of claims 1-8.
CN202210827258.3A 2022-07-13 2022-07-13 Processing method and device of routing information, electronic equipment and storage medium Active CN115225572B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210827258.3A CN115225572B (en) 2022-07-13 2022-07-13 Processing method and device of routing information, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210827258.3A CN115225572B (en) 2022-07-13 2022-07-13 Processing method and device of routing information, electronic equipment and storage medium

Publications (2)

Publication Number Publication Date
CN115225572A CN115225572A (en) 2022-10-21
CN115225572B true CN115225572B (en) 2023-05-26

Family

ID=83612610

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210827258.3A Active CN115225572B (en) 2022-07-13 2022-07-13 Processing method and device of routing information, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN115225572B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115499338B (en) * 2022-11-15 2023-09-29 阿里云计算有限公司 Data processing method, device, medium and cloud network observation system

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102238079A (en) * 2011-01-18 2011-11-09 北京中京创原通信技术有限公司 Method for implementing route backtracking in IP (Internet Protocol) telecommunication network
CN105591915A (en) * 2014-10-22 2016-05-18 中兴通讯股份有限公司 Maintenance method and apparatus of routing table
CN109583746A (en) * 2018-11-26 2019-04-05 东软集团股份有限公司 The method and device of the routing rule of setting procedure, readable storage medium storing program for executing
CN110879819A (en) * 2019-11-20 2020-03-13 北京明略软件系统有限公司 Method, device, server and storage medium for quickly and accurately identifying routing information
WO2020199058A1 (en) * 2019-03-30 2020-10-08 华为技术有限公司 Branch instruction processing method, branch predictor, and processor
CN113760366A (en) * 2021-07-30 2021-12-07 浪潮电子信息产业股份有限公司 Method, system and related device for processing conditional jump instruction
CN114422421A (en) * 2022-01-18 2022-04-29 北京字节跳动网络技术有限公司 Route matching method and device, computer equipment and storage medium
CN114513449A (en) * 2022-02-23 2022-05-17 北京慧橙信息科技有限公司 Method and system for optimizing routing in domain

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7711935B2 (en) * 2007-04-30 2010-05-04 Netlogic Microsystems, Inc. Universal branch identifier for invalidation of speculative instructions
US8725896B2 (en) * 2010-12-16 2014-05-13 Openet Telecom Ltd. Methods, systems and devices for forked routing
EP3451610A1 (en) * 2017-09-04 2019-03-06 Thomson Licensing Conditional routing device and method
CN110380965B (en) * 2018-04-13 2021-05-18 成都华为技术有限公司 Method and device for service transmission
US11025545B2 (en) * 2019-06-06 2021-06-01 Cisco Technology, Inc. Conditional composition of serverless network functions using segment routing
CN112559049A (en) * 2019-09-25 2021-03-26 阿里巴巴集团控股有限公司 Way prediction method for instruction cache, access control unit and instruction processing device

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102238079A (en) * 2011-01-18 2011-11-09 北京中京创原通信技术有限公司 Method for implementing route backtracking in IP (Internet Protocol) telecommunication network
CN105591915A (en) * 2014-10-22 2016-05-18 中兴通讯股份有限公司 Maintenance method and apparatus of routing table
CN109583746A (en) * 2018-11-26 2019-04-05 东软集团股份有限公司 The method and device of the routing rule of setting procedure, readable storage medium storing program for executing
WO2020199058A1 (en) * 2019-03-30 2020-10-08 华为技术有限公司 Branch instruction processing method, branch predictor, and processor
CN110879819A (en) * 2019-11-20 2020-03-13 北京明略软件系统有限公司 Method, device, server and storage medium for quickly and accurately identifying routing information
CN113760366A (en) * 2021-07-30 2021-12-07 浪潮电子信息产业股份有限公司 Method, system and related device for processing conditional jump instruction
CN114422421A (en) * 2022-01-18 2022-04-29 北京字节跳动网络技术有限公司 Route matching method and device, computer equipment and storage medium
CN114513449A (en) * 2022-02-23 2022-05-17 北京慧橙信息科技有限公司 Method and system for optimizing routing in domain

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
一种基于路由器矢量边采样的IP追踪技术;魏军;连一峰;戴英侠;李闻;鲍旭华;;软件学报(11);全文 *

Also Published As

Publication number Publication date
CN115225572A (en) 2022-10-21

Similar Documents

Publication Publication Date Title
CN108427613B (en) Abnormal interface positioning method and device, computer equipment and storage medium
CN110221982B (en) Performance test method, device and equipment of business system and readable storage medium
CN110554958B (en) Graph database testing method, system, device and storage medium
US10354031B2 (en) Information processing by interpenetrating signal transmission channel in design for testability of chip
CN110287696B (en) Detection method, device and equipment for rebound shell process
CN111241073B (en) Data quality inspection method and device
CN107733710A (en) Construction method, device, computer equipment and the storage medium of link call relation
CN115225572B (en) Processing method and device of routing information, electronic equipment and storage medium
CN111475376A (en) Method and device for processing test data, computer equipment and storage medium
CN111290941A (en) Method and device for testing multiple interfaces, computing equipment and medium
CN107203464B (en) Method and device for positioning service problem
CN114490394A (en) Test range determining method, device, equipment and medium
CN109933515B (en) Regression test case set optimization method and automatic optimization device
KR101794016B1 (en) Method of analyzing application objects based on distributed computing, method of providing item executable by computer, server performing the same and storage media storing the same
CN116955148A (en) Service system testing method, device, equipment, storage medium and product
CN114389978B (en) Network protocol side channel detection method and system based on static stain analysis
CN115617668A (en) Compatibility testing method, device and equipment
CN115297024A (en) Performance test method and device of network security equipment and electronic equipment
CN109491699B (en) Resource checking method, device, equipment and storage medium of application program
CN111401020A (en) Interface loading method and system and computing equipment
CN113342664B (en) Dial testing method, device, storage medium and computer equipment
CN113055243B (en) DPI interface data processing method and device
CN116775313B (en) Resource allocation method, device, equipment and medium
CN112445692B (en) Case testing method and terminal
CN116932368A (en) Test requirement determining method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant