CN115567607A

CN115567607A - Processing method, device and system for calling link, electronic equipment and storage medium

Info

Publication number: CN115567607A
Application number: CN202211193485.1A
Authority: CN
Inventors: 马闯; 孟海峰; 李云天; 米书杰
Original assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Current assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Priority date: 2022-08-19
Filing date: 2022-09-28
Publication date: 2023-01-03

Abstract

The disclosure provides a processing method, a device, a system, an electronic device and a storage medium for a call link, and relates to the technical field of data processing, in particular to the field of analysis of a service call link. The specific implementation scheme is as follows: acquiring an access request to be processed; generating a target link identification of a calling link of the access request to be processed; the target link identification comprises a first node identification and a tracking identification; the calling link comprises a plurality of service nodes, and the first node identifier is used for marking the initial service node of the calling link; the tracing identifier is used for being transmitted from any service node to the called service node, and the tracing identifier is used for resolving calling relations among the service nodes in the calling link. An originating service node capable of quickly locating a calling link based on the first node identification. The calling relation of the whole calling link can be analyzed through the tracking identifier. Therefore, the method can quickly and accurately track, analyze and call the link.

Description

Processing method, device and system for calling link, electronic equipment and storage medium

Technical Field

The present disclosure relates to the field of data processing technologies, and in particular, to the field of service invocation link analysis.

Background

Today, the development of micro services is rapid, and the design of loose coupling is infinite, which brings great convenience for simplifying services. Developers only need to care about the version iteration of the modules to be online, and the division of the business direction is clear. But as the overall business architecture expands, the number of services has seen explosive growth in the last two years.

A request often involves multiple inter-service calls, which may be developed by different teams, written in different languages, or involve different servers. For the above reasons, the call relationship between the services is complicated. If the calling relation among the services can be cleared up quickly, the speed and the accuracy of positioning the problems can be improved.

Disclosure of Invention

The disclosure provides a processing method, a device, a system, equipment and a storage medium for calling a link.

According to an aspect of the present disclosure, there is provided a processing method for invoking a link, including:

acquiring an access request to be processed;

generating a target link identification of a calling link of the access request to be processed;

the target link identification is used for analyzing the call link, and the target link identification comprises a first node identification and a tracking identification; the calling link comprises a plurality of service nodes, and the first node identification is used for marking an initial service node in the plurality of service nodes; and when any service node in the calling link calls the called service node, the tracking identifier is used for being transmitted from any service node to the called service node, and the tracking identifier is used for analyzing the calling relationship among the service nodes in the calling link.

According to another aspect of the present disclosure, there is provided a processing method for calling a link, including:

acquiring a target link identification;

analyzing a first node identifier and a tracking identifier from a target link identifier;

analyzing the calling relation among the service nodes in the calling link based on the tracking identification;

and generating a calling link which takes the service node corresponding to the first node identifier as an initial service node and contains the calling relationship among the service nodes.

According to another aspect of the present disclosure, there is provided a processing method for invoking a link, including:

acquiring an access request to be processed;

generating a target link identification of a calling link of the access request to be processed; the target link identification comprises a first node identification and a tracking identification; in the calling link, under the condition that any service node calls the called service node, the tracking identifier is used for being transmitted to the called service node from any service node;

acquiring a target link identification;

analyzing the calling relation among the service nodes in the calling link based on the tracking identifier;

According to another aspect of the present disclosure, there is provided a processing apparatus for invoking a link, including:

the first acquisition module is used for acquiring the access request to be processed;

the first generation module is used for generating a target link identification of a calling link of the access request to be processed;

the target link identification is used for analyzing the call link, and the target link identification comprises a first node identification and a tracking identification; the calling link comprises a plurality of service nodes, and the first node identification is used for marking an initial service node in the plurality of service nodes; and when any service node in the calling link calls the called service node, the tracking identifier is used for transmitting the calling link from any service node to the called service node, and the tracking identifier is used for tracking and analyzing the calling relationship among the service nodes in the calling link.

the second acquisition module is used for acquiring the target link identification;

the first analysis module is used for analyzing a first node identifier and a tracking identifier from the target link identifier;

the second analysis module is used for analyzing the calling relation among the service nodes in the calling link based on the tracking identification;

and the second generation module is used for generating a calling link which takes the service node corresponding to the first node identifier as an initial service node and contains the calling relationship among the service nodes.

the third acquisition module is used for acquiring the access request to be processed;

the third generation module is used for generating a target link identification of a calling link of the access request to be processed; the target link identification comprises a first node identification and a tracking identification; in the calling link, under the condition that any service node calls the called service node, the tracking identifier is used for being transmitted to the called service node from any service node;

a fourth obtaining module, configured to obtain a target link identifier;

the third analysis module is used for analyzing the first node identifier and the tracking identifier from the target link identifier;

the fourth analysis module is used for analyzing the calling relationship among the service nodes in the calling link based on the tracking identifier; and the fourth generation module is used for generating a calling link which takes the service node corresponding to the first node identifier as an initial service node and contains the calling relationship among the service nodes.

According to another aspect of the present disclosure, there is provided a processing system for invoking a link, including:

a gateway for performing the method of the first aspect of the present disclosure;

a link resolution server for performing the method of the second aspect of the present disclosure.

According to another aspect of the present disclosure, there is provided an electronic device including:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of the first and/or second aspects of the disclosure.

According to another aspect of the present disclosure, there is provided a non-transitory computer readable storage medium having stored thereon computer instructions for causing a computer to perform the method according to the above first and/or second aspect of the present disclosure.

According to another aspect of the present disclosure, a computer program product is provided, comprising a computer program which, when executed by a processor, implements a method according to the above first and/or second aspect of the present disclosure.

According to the scheme provided by the embodiment, a calling link can be quickly obtained through the target link identifier and the first node identifier contained in the target link identifier. An initial serving node that can quickly locate the invoking link based on the first node identification. The calling relation of the whole calling link can be analyzed through the tracking identifier. Therefore, the method can quickly and accurately obtain the calling link.

It should be understood that the statements in this section are not intended to identify key or critical features of the embodiments of the present disclosure, nor are they intended to limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.

Drawings

The drawings are included to provide a better understanding of the present solution and are not to be construed as limiting the present disclosure. Wherein:

FIG. 1 is a schematic diagram of an application scenario in which an embodiment of the present disclosure is applicable;

fig. 2 is a flowchart illustrating a processing method for invoking a link according to an embodiment of the present disclosure;

FIG. 3 is a schematic diagram of a possible application scenario provided by an embodiment of the present disclosure;

FIG. 4 is a call link topology diagram provided by an embodiment of the present disclosure;

fig. 5 is a flowchart illustrating a processing method for invoking a link according to another embodiment of the disclosure;

fig. 6 is a flowchart illustrating a processing method for invoking a link according to another embodiment of the present disclosure;

fig. 7 is a flowchart illustrating a processing method for invoking a link according to another embodiment of the present disclosure;

fig. 8 is a flowchart illustrating a processing method for invoking a link according to yet another embodiment of the disclosure;

FIG. 9 is a flowchart illustrating a method for invoking a link according to yet another embodiment of the disclosure;

FIG. 10 is a visualization interface diagram for filtering target link identifications provided by an embodiment of the present disclosure;

fig. 11 is a flowchart illustrating a processing method for invoking a link according to another embodiment of the disclosure;

FIG. 12 is a schematic diagram of an application scenario provided in accordance with another embodiment of the present disclosure;

fig. 13 is a schematic structural diagram of a component of a processing apparatus for invoking a link according to an embodiment of the present disclosure;

fig. 14 is a schematic diagram of another component structure of a processing device for invoking a link according to another embodiment of the present disclosure;

fig. 15 is a schematic structural diagram of a component of a processing apparatus for invoking a link according to an embodiment of the present disclosure;

FIG. 16 is a block diagram of an electronic device used to implement a method of invoking processing of a link of an embodiment of the present disclosure.

Detailed Description

Exemplary embodiments of the present disclosure are described below with reference to the accompanying drawings, in which various details of the embodiments of the disclosure are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present disclosure. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

The terms "first," "second," and the like in this disclosure are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. Furthermore, the terms "comprises" and "comprising," as well as any variations thereof, are intended to cover a non-exclusive inclusion, such as a list of steps or elements. A method, system, article, or apparatus is not necessarily limited to those steps or elements explicitly listed, but may include other steps or elements not explicitly listed or inherent to such process, system, article, or apparatus.

In order to be able to locate a problem quickly, the embodiments of the present disclosure provide a tracing method and a parsing method for a call link. Fig. 1 is a schematic view of an application scenario in which the parsing method and the tracking method are applicable. In fig. 1, this includes: a terminal 101, a gateway 102 and a content server 103. The user can access the content server 103 through the terminal 101, and acquire the network content from the content server 103. For example, a user accesses a web page provided by the content server 103 through the terminal 101, and the user may click on a link in the web page, whereby the terminal 101 generates a request to the gateway 102, and the gateway 102 invokes a corresponding microservice in the content server 103 to process the request. The microservice of the content server 103 may invoke another service when processing the request, may obtain a processing result of the request through a plurality of service invocations, and then returns the processing result to the terminal 101.

It should be noted that fig. 1 is only used for illustrating the embodiment of the present disclosure, and does not limit the applicable scenarios of the embodiment of the present disclosure.

Because a call link for a request is long, how to trace out a call link is a concern in the industry. Accordingly, an embodiment of a first aspect of the present disclosure provides a method for tracing a call link, as shown in fig. 2, which is a schematic flow chart of the method, and the method is applied to a gateway 102 shown in fig. 1, and includes:

s201, obtaining the access request to be processed.

In some embodiments, the network architecture shown in fig. 1 may be divided into an access layer, a run layer, and a call link layer. The gateway 102 is located at the access layer and the operation layer, and the content server 103 is located at the operation layer and the call link layer. The operational layers of gateway 102 and the operational layers of the servers are used to enable interaction between gateway 102 and the servers. Taking fig. 1 as an example, after the request of the user reaches the access stratum of the gateway 102, the access stratum generates a call request to the service node of the running stratum based on the request. The calling request is the access request to be processed in step S201. It should be noted that, for one request sent by the client, one invocation request may be generated or multiple invocation requests may be generated in the access layer of the gateway 102. In the case where a plurality of call requests are generated, for example, as shown in fig. 3, the terminal 101 displays a web page 1 including a plurality of connections and a plurality of recommended pictures. The link 1 is used for acquiring a document, and the document corresponding to the link 1 and the recommended content need to be displayed in the page 2 corresponding to the link. In the case where the user clicks the link 1, the terminal 101 generates a content acquisition request for the web page 2 to the gateway 102. The access layer of the gateway 102 needs to call the service node 1 in the running layer to obtain the document for the request, and also needs to call the service node 2 in the running layer to recommend the content. Gateway 102 generates invocation requests for serving node 1 and serving node 2, respectively.

When there are multiple call requests, each call request can be respectively used as a pending access request in step S201 and the call link tracing method provided by the embodiment of the present disclosure is performed on the pending access request. For convenience of understanding, an example will be described later for one pending access request, and the processing manner of other pending access requests is the same, which is not described in detail in this embodiment of the disclosure.

S202, generating a target link identification of a calling link of the access request to be processed; the target link identification comprises a first node identification and a tracking identification; the invocation link including a plurality of service nodes, the first node identifying an originating service node of the plurality of service nodes,

in the calling link, when any service node calls the called service node, the tracking identifier is used for being transmitted from any service node to the called service node, and the tracking identifier is used for analyzing the calling relation between the service nodes in the calling link.

In the embodiment of the disclosure, the initial service node in one calling link can be quickly positioned through the first node identifier, and the same calling link is tracked through the tracking identifier, so that the calling link can be quickly positioned, the calling relation among the service nodes is cleared, and further the problem positioning can be more quickly completed.

For example, as shown in FIG. 4, a schematic of an interface for a call link is shown. The service node a marked with the target link identifier T in the call link is an initial service node of the call link, and indicates that the service node a starts to process the request to be accessed in the call link.

For another example, still taking fig. 1 as an example, a target link identifier is generated in the access layer of the gateway 102, and when the service node of the running layer is called, the access layer of the gateway 102 passes through the tracking identifier in the target link identifier to the service node of the running layer. When the service node of the running layer needs to call other service nodes, the service node of the running layer transmits the tracking identification to the called service node. By analogy, the transmission of the same tracking identifier among different service nodes is realized. Thus, the same trace identity concatenates different service nodes.

In some possible implementations, when the trace identifier is transmitted to the called service node, the trace identifier may be carried in a request header and transmitted to the called service node. Still taking fig. 1 as an example, the access stratum sends a network request to the microservice (i.e., a service node) of the content server 103 of the run stratum. The access stratum of gateway 102 may carry the trace identification in a request header of the network request to pass the trace identification to the microservice of the runtime stratum.

In some possible embodiments, each calling link has a target link identifier uniquely identifying the calling link, so as to ensure global uniqueness of the target link identifier. As shown in fig. 5, the target link identification of the invocation link for the pending access request may be generated based on the following:

s501, dividing time information of the access request to be processed into first part information and second part information; wherein the time information comprises the generation time and/or the sending time of the access request to be processed.

And S502, generating a tracking identifier based on the first part of information.

In the embodiment of the disclosure, the total number of the tracking identifier digits is greater than 1, and the decimal representation can be adopted. An example of generating a tracking identity is as follows:

in some embodiments, the first part information may be minutes, seconds and milliseconds, and the first N bits of the tracking identifier may be the total milliseconds of the first part information. For example, the time information is 14/8/3/2022: 25:31.145, the first part of information is 25:31.145, the total number of milliseconds expressed as milliseconds is 1531145 milliseconds, 1531145 is the first 7 bits of the tracking identifier. And the back M bits of the tracking identifier are sequentially increased and assigned from the minimum value by an M-bit counter, and when the counter reaches the maximum value, the counter returns to the minimum value. When M =3, a cycle every 60 hours can be made. Each circulation is only one hundred thousand of the probability of repetition, and theoretically, the repetition can not be carried out for 100 years, so that the globally unique tracking identifier can be generated by adopting the method.

It should be noted that, the above manner is only used to illustrate an implementation manner of generating the tracking flag based on the time information in the example of the present disclosure, and the example of the present disclosure does not specifically limit a method of generating the tracking flag.

S503, based on the second part of information, the tracking identifier and the first node identifier generate a target link identifier.

Similarly, the target link identification of the disclosed embodiments includes multiple bits and may be in decimal notation.

In the embodiment of the disclosure, the time information has uniqueness, and the target link identifier is generated by using the time information, so that global uniqueness of the target link identifier can be ensured as much as possible. And generating a target link identifier based on the first node identifier, so that the target link identifier carries starting point information of the call link, and the first node identifier is analyzed from the target link identifier, thereby achieving the purpose of positioning the starting service node of the call link. In addition, the generation of the tracking identifier based on the first part of information also enables the tracking identifier to have global uniqueness, so that the calling link has a unique tracking identifier, and therefore unique relevance of the target link identifier and the calling link is guaranteed.

In some embodiments, in order to compress the data amount of the target link identifier as much as possible, in the embodiment of the present disclosure, the generating the target link identifier based on the second partial information, the tracking identifier and the first node identifier in step S503 may be implemented as shown in fig. 5, including:

s5031, in case that the first node identifier contains a character, converting the first node identifier into a numeric identifier.

Because a plurality of call links can share the same initial service node, the first node identifier for marking the initial service node does not need to be in one-to-one correspondence with the call links. In the embodiment of the present disclosure, however, the first node identifier may shorten the data amount by digitization. Taking the first node identifier as an IP address as an example, a process of digitizing the IP address is illustrated. For example, if the IP address is "a.b.c.d", the IP address after digitization is 256 ³ *a+256 ² *b+256 ¹ * c +2560 × d. Since abcd ranges from 1-255, multiplying 256 to different powers produces different orders of magnitude, thereby ensuring the uniqueness of the generated digital address.

On one hand, if the 'in the IP address is reserved', the data amount of the target link identifier is increased, thereby consuming more storage resources, and in the case of a large number of call links, compressing the data amount of the target link identifier will save a large amount of storage resources. On the other hand, if the ". Multidot.in the IP address is not reserved, ambiguity may occur, for example, the IP address 101.1.101.1 is the same as the IP address 10.11.10.11 minus the". Multidot.in the IP address, and it is not possible to determine which IP address is. Thus, the IP address with the character "." needs to be converted into a numeric address.

S5032, the second part of information, the tracking identifier and the digital identifier are compiled into a digital string to obtain a target link identifier.

For example, the time information is 14/8/3/2022: 25:31.145, the IP corresponding to the first node identification is 1.8.27.64. The trace generated by the method introduced at S502 is denoted by 1531145123 and the number generated by the method introduced at S5031 is denoted by 0017308480 in the case where the three-dimensional random number is 123. When the second part of information is 2022, 8, month, 3, and 14, because the default year may be the current year, the year in the second part of information may be removed, and the month and day in the second part of information is compiled to 080314 (hereinafter referred to as time value), then the target link identifier is obtained by arranging the tracking identifier, the first node identifier, and the time value:

15311451230017308480080314。

it should be noted that the above-mentioned manner is only used to illustrate an implementation manner in which the second part of information, the tracking identifier, and the digital identifier are compiled into a digital string to obtain the target link identifier in the example of the present disclosure, and the example of the present disclosure does not specifically limit the method for generating the target link identifier. For example, the target link identifier may be generated by replacing the order of the trace identifier, the first node identifier, and the time value.

In summary, the first node identifier is digitized, so that the target link identifier can be stored by using less storage resources, and the uniqueness of the target link identifier is ensured, thereby ensuring the unique association between the target link identifier and the call link.

In some embodiments, the target link identification and its corresponding invoking link may be centrally stored in one server. However, the data are stored in a centralized manner, on one hand, the data are huge in size, which will occupy a lot of server resources, and on the other hand, if the problem is to be resolved quickly, the data need to be searched and called in the server, which takes a relatively long processing time. Thus, to conserve storage resources and achieve a fast location problem, in some possible embodiments, the second node identification of the invoked service node may be saved in the local instance in the event the service node is invoked. For example, if serving node a invokes serving node B, the second node identification of serving node B is stored in the local instance of serving node a.

In the embodiment of the present disclosure, storing the second node identifier of the called service node in the local instance may learn about the calling relationship of different service nodes according to the second node identifier. And the second node identification is stored in the local instance, so that the calling relation of different service nodes can be prevented from being stored in a centralized storage mode, and the storage resource is saved.

The storage duration of the second node identifier may be set according to a requirement. For example, after a problem occurs, a time less than one day is needed to find that the problem exists, the storage duration can be set to one day, and the life cycle of the second node identifier in the local instance can be flexibly managed. Thus, the second node identification is temporarily stored in the instance, rather than persisted to the server, saving storage resources.

In some embodiments, the second node is identified as an IP address, and the calling relationship of different services can be known by using the IP address. When a plurality of service nodes exist in the equipment with the same IP address, different service nodes are distinguished conveniently and accurately. The second node identifier in the embodiment of the present disclosure includes an IP address and a port number of a called service node, that is, different service nodes in the same IP address correspond to different port numbers.

In some embodiments, the trace identification is passed to the runtime layer when the access layer of gateway 102 invokes the runtime layer. The running layer in the server can transmit the tracking identifier to the called service node when the service node is called, but when any service node calls the called service node based on the network request, the tracking identifier can be carried in the request header of the network request. In some embodiments, where the called service node is invoked based on a message queue, the trace identification is passed to the called service node in an explicitly transmitted way. For example, when a message is stored in a message queue, a trace identifier can be recorded in a form of tagging the message, and when the message is consumed at the downstream, the trace identifier recorded in the tag is transmitted to the downstream together, so that the transmission of the trace identifier is realized.

In some embodiments, when passing the trace identity, the trace identity is determined by priority:

checking whether a tracking identifier is defined in the target script; the trace identifier in the target script may be self-defined by the user so that the invoked service node inherits the trace identifier. For example, the trace identifier can be customized by a tester during testing, so as to complete the testing.

In the target script, under the condition that the tracking identifier is not defined, if the request head carries the tracking identifier, the tracking identifier in the request head is used as the tracking identifier transmitted to the next service node;

and under the condition that neither position carries the tracking identifier, generating a new tracking identifier as the tracking identifier transmitted to the next service node.

After the tracking of the calling link is completed and the problem is located, the target link identification is analyzed.

The foregoing describes a tracing method for a call link, and based on the same technical concept, according to the second aspect of the present disclosure, a parsing method for a call link is also provided. Fig. 6 is a schematic flow chart of the method, which includes:

s601, acquiring a target link identification.

S602, the first node identifier and the tracking identifier are analyzed from the target link identifier.

S603, tracking the calling relation among the service nodes in the calling link based on the tracking identifier.

In some embodiments, the call relationships between service nodes in the call link may be tracked using the following method: the logs of all service nodes on the calling link carry the same tracking identifier, and the service nodes on the calling link are all found out by searching the logs carrying the tracking identifier. Meanwhile, when the upper-level service node calls the lower-level service node, the upper-level service node will keep the second node identifier (such as an IP address) of the lower-level service node in the local instance of the upper-level service node. Thus, the calling relationship between the service nodes can be known by looking at the local instance. Based on this, determining the call relationship between the service nodes can be implemented as shown in fig. 7:

s701, acquiring a plurality of service nodes recorded with the tracking identifiers.

S702, aiming at each service node, respectively obtaining a second node identifier of a called service node called by the service node from a local instance of the service node.

S703, determining the calling relation among the service nodes in the calling link based on the service nodes and the second node identifiers of the called service nodes called by the service nodes.

And analyzing to obtain the calling relation of different service nodes of the calling link by using the second node identifier stored in the local instance, and compared with calling from a server, the method simplifies a plurality of steps and effectively reduces the time cost and the use of server resources. Meanwhile, the resources of the local instance are directly used, and the misoperation rate is also reduced.

S604, generating a calling link which takes the service node corresponding to the first node identification as an initial service node and comprises a calling relation among the service nodes.

In the embodiment of the disclosure, the target link identifier is analyzed to obtain the first node identifier and the tracking identifier, so as to obtain the call link between the service nodes. And the calling link is tracked based on the tracking identifier, so that the speed and the accuracy of determining the calling link are improved. The calling link takes the service node corresponding to the first node identification as the initial service node, so that the speed and the accuracy of positioning the initial position of the link are improved. By combining the two aspects, the speed and the accuracy of obtaining the target call link are improved to a certain extent.

In some possible embodiments, the first node identifier and the tracking identifier are parsed from the target link identifier, as shown in fig. 8, which may be implemented as follows:

and S6021, resolving the tracking identifier from the first target position of the target link identifier.

And S6022, resolving the digital identifier from the second target position of the target link identifier.

The target link identification in the disclosed embodiments comprises multiple bits and may be represented in decimal notation. Wherein the first target location and the second target location, respectively, may comprise a plurality of consecutive bits in the target link identification. For example, the first target location includes the first ten digits of the target link identification and the second target location includes the eleventh through twenty digits of the target link identification. The specific total number of bits of the target link identifier, and the total number of bits included in the first target location and the second target location are not particularly limited. And the position precedence relationship of the first target position and the second target position in the target link identifier is not limited. Even the first target location and the second target location may intersect, for example, the first bit of the first target location is the 1 st bit of the target link identifier, the first bit of the second target location is the 2 nd bit of the target link identifier, the 2 nd bit of the first target location is the 3 rd bit of the target link identifier, and so on.

And S6023, decompiling the digital identifier to obtain a first node identifier.

In the embodiment of the disclosure, the tracking identifier and the digital identifier can be analyzed based on different positions in the target link identifier, so that the first node identifier is restored. The digital identifier can identify the first node identifier with a small data volume, so that the storage resource for storing the target link identifier is saved.

The time stamp is a complete verifiable data that can indicate that a piece of data already exists at a particular point in time, and is important information for log analysis. The cross-platform conversion of the time information can be realized through the time stamp. In some possible embodiments, the time information may be parsed to generate the timestamp, as shown in fig. 9, which includes:

s901, analyzing first part information of time information from the tracking identifier; the time information is the generation time or the sending time of the access request to be processed.

And S902, analyzing second part information of the time information from a third target position of the target link identifier.

And S903, generating a time stamp of the time information based on the first part information and the second part information.

And generating time information by using the first part information and the second part information, and generating a time stamp by using the time information. The following introduces a way to generate timestamps based on the Java language: vartimestamp = new Date (). GetTime (); where Date and Time are preset dates and times, which are Time information in this embodiment. It should be noted that the timestamp may be generated by using the time information through other languages, which is not described herein.

Time information can be analyzed in the tracking identification and a timestamp can be obtained, on one hand, screening can be carried out according to time when the calling links are obtained, workload is reduced, on the other hand, the timestamp does not need to be specially generated and stored for each calling link, the target link identification can be reused to obtain the timestamp, and resources of a server are saved.

For ease of understanding, the following illustrates how the trace identifier, the first node identifier, and the timestamp are resolved. For example, the target link identifier is 15311451230017308480080314, the 1 st bit to the 10 th bit are used as the first target position, the tracking identifier is analyzed to be 1531145123, the tracking identifier is decompiled, the first 7 bits of the tracking identifier are extracted to be 1531141145, and the duration represented by the total number of milliseconds is obtained. Converting the duration into a format of minutes, seconds, milliseconds, therebyObtaining a first part of information, wherein the obtained first part of information is 25:31.145. and taking the 11 th to 20 th bits in the target link identification as a second target position, analyzing the digital identification as 0017308480, and performing decompiling on the digital identification to obtain the first node identification. The specific decompilation process is as follows: dividing the number mark 0017308480 by 256 ³ Quotient is 1; then divided by 256 using the remainder ² The quotient is 8, which is divided by 256 ² The resulting remainder is divided by 256 ¹ The quotient is 27 and the remainder is 64. Splicing the results in sequence to obtain a first node identifier of 1.8.27.64; the 21 st to 26 th bits are used as the third target position, and the default year is the current year, so that the time when the second part of information is 2022 years, 8 months, 3 days and 14 days can be analyzed. Combining the first partial information and the second partial information, the time information 14 of 8, 3 and 2022 can be obtained: 25:31.145, and a timestamp can be obtained.

In some embodiments, a way to retrieve the target link identification is also provided, which may be implemented as: screening out at least one target link identification based on the target link identification screening condition to obtain a target link identification set; and selecting the target link identification from the target link identification set.

The used target link identification screening condition comprises at least one of the following conditions: access stratum type, geographical range, status code, domain name, and IP address, etc. Page for filtering as shown in fig. 10, a user may select a filtering condition through a visual interface. The access stratum may include router and inrouter, among others. The target link identification in the disclosed embodiment is used to indicate whether the router or the inrouter of gateway 102 is enabled. The access layer type refers to whether the router or the inrouter is started; the geographic scope (i.e., the region in fig. 10) may be defined according to actual needs, for example, the geographic scope is used to define the geographic scope in which the gateway 102 is located; when the state code calls the service node, the server responds to the state-determined information. For example, 2xx indicates that the request was successfully received by the server, 3xx indicates that further action is required to complete the request, 4xx indicates that the request is in error, and 5xx indicates that the server is in error; the domain name is the domain name of the current webpage when the request is sent out, and the IP address is the IP address of the initial service node. In fig. 10, the time option is used to limit the time range of the filtering, for example, filtering the target link id generated in about 1 hour. In the embodiment of the present disclosure, the logs of each service node may be divided by hours, that is, one log is obtained every hour. Therefore, the target link identification can be screened out from the log conveniently according to the time range during screening.

The various screening conditions can accurately retrieve the required target link identification, and the efficiency of positioning problems is improved.

In some possible embodiments, at least one target link identifier may be screened from the designated location based on a target link identifier screening condition. The designated location includes at least one of: logs, reported error events, request headers recorded in the console of the browser, etc. Each service call records the call in a log, and an error event is generated once an error occurs in the service call process, because the target link identification can be screened from the error event. Screening in multiple positions can improve the possibility of screening out the target node identification and improve the efficiency of positioning problems.

In summary, the target link identifier obtained by conditional screening can ensure that the call link where the problem is located can be determined as far as possible after the problem occurs. And all call links of related services do not need to be checked, so that the efficiency of problem checking is greatly improved.

In summary, the generated call link can be displayed in the interface based on the embodiment of the present disclosure. Such as a call link shown in fig. 4. After any one of the service nodes is selected, the details of the service node are shown. The details include, for example: a service node name; a service node type; a server address; whether the serving node belongs to the operation layer or the access layer, etc. For example, in fig. 4, after the service node D is selected, the relevant details of the service node D are shown.

In addition, multiple call links can be displayed in the same interface in the embodiment of the disclosure. In order to facilitate viewing of the same call link, in the case of a selection of a target call link, other call links may be hidden in the interface. If there is a service node in the calling link that has a fatal error, or there is a node that generates a warning message, such critical service nodes can be marked in different colors. As shown in fig. 4, the service node C is a service node where a fatal error occurs, and the service node B is a service node where an alarm is generated.

Based on the same technical concept, according to a third aspect of the embodiments of the present disclosure, there is further provided a processing method for invoking a link, as shown in fig. 11, including:

s1101, obtaining the access request to be processed.

S1102, generating a target link identification of a calling link of the access request to be processed; the target link identification comprises a first node identification and a tracking identification; and in the calling link, under the condition that any service node calls the called service node, the tracking identifier is used for being transferred from any service node to the called service node.

S1103, acquiring a target link identifier.

And S1104, analyzing the first node identifier and the tracking identifier from the target link identifier.

S1105, analyzing the calling relation between the service nodes in the calling link based on the tracking identification.

S1106, generating a calling link which takes the service node corresponding to the first node identifier as an initial service node and comprises a calling relation among the service nodes.

In summary, in the embodiment of the present disclosure, a whole call link may be connected in series based on the target link identifier and the tracking identifier. And analyzing the target link identification to obtain a first node identification and a tracking identification so as to obtain a calling link between the service nodes. And the calling link is tracked based on the tracking identifier, so that the speed and the accuracy of determining the calling link are improved. The calling link takes the service node corresponding to the first node identification as the initial service node, so that the speed and the accuracy of positioning the initial position of the link are improved. By combining the two aspects, the speed and the accuracy of obtaining the target call link are improved to a certain extent.

In some embodiments, generating the target link identification for the invocation link of the pending access request comprises:

dividing the time information of the access request to be processed into first part information and second part information;

generating a tracking identifier based on the first part of information;

and generating a target link identification based on the second part of information, the tracking identification and the first node identification.

In some embodiments, generating the target link identifier based on the second partial information, the tracking identifier and the first node identifier comprises:

under the condition that the first node identification contains characters, compiling the first node identification into a digital identification;

and compiling the second part of information, the tracking identification and the digital identification into a digital string to obtain the target link identification.

In some embodiments, parsing the first node identifier and the trace identifier from the target link identifier includes:

analyzing a tracking identifier from a first target position of a target link identifier;

resolving a digital identifier from a second target position of the target link identifier;

and decompiling the digital identifier to obtain a first node identifier.

In some embodiments, the method further comprises:

analyzing a first part of information of the time information from the tracking identifier;

analyzing second part information of the time information from a third target position of the target link identifier;

a time stamp of the time information is generated based on the first partial information and the second partial information.

In some embodiments, resolving call relationships between service nodes in a call link based on the tracking identifier includes:

acquiring a plurality of service nodes recorded with tracking identifiers;

aiming at each service node, respectively acquiring a second node identifier of a called service node called by the service node from a local instance of the service node;

and determining the calling relation based on the service nodes and the second node identifiers of the called service nodes.

In some embodiments, obtaining the target link identification comprises:

screening out at least one target link identification based on the target link identification screening condition to obtain a target link identification set;

and selecting the target link identification from the target link identification set.

In some embodiments, screening out at least one target link identifier based on the target link identifier screening condition includes:

screening at least one target link identifier from the specified information based on the target link identifier screening condition;

the specifying information includes at least one of: log, reported error event, request head recorded in console of browser;

the screening conditions include at least one of:

access stratum type, geographical range, status code, domain name, and IP address.

For descriptions of the steps in this method embodiment, reference may be made to the relevant descriptions of corresponding steps in the method embodiments of the first aspect and the second aspect, which are not described herein again.

Based on the same technical concept, the embodiment of the disclosure also provides a processing system for calling the link. The system comprises a gateway, a content server and a link analysis server, wherein:

the gateway may perform the method in the first aspect of the embodiments of the present disclosure, for example, obtain a pending access request; generating a target link identification of a calling link of the access request to be processed; the target link identification comprises a first node identification and a tracking identification; transmitting the tracking identification to the service node of the content server under the condition of calling the service node of the content server;

the content server is used for transmitting the tracking identifier to the called service node from any service node under the condition that any service node calls the called service node in the calling link;

the link resolution server may perform the method of the second aspect in the embodiments of the present disclosure, such as obtaining a target link identifier; analyzing a first node identifier and a tracking identifier from a target link identifier; analyzing the calling relation among the service nodes in the calling link based on the tracking identification; and generating a calling link which takes the service node corresponding to the first node identifier as an initial service node and contains the calling relationship among the service nodes.

It should be noted that, when any service node in the content server invokes the invoked service node, the service node may store the second node identifier of the invoked service node in the local instance.

To facilitate the system to understand the processing method of the call link provided by the embodiment of the present disclosure, this is described below with reference to the application scenario diagram shown in fig. 12. In fig. 12, the terminal 101, the gateway 102, a content server (represented by a service node a, a service node B, and a service node C in fig. 12), and a link resolution server 104 are included. The service node a is called by a request 1 from the user at the terminal 101 and a call request 2 generated at the gateway 102. The gateway 102 generates a target link identifier a of the invocation request 2, which includes a trace identifier b and a first node identifier c. The gateway 102 calls the service node a based on the call request 2, and simultaneously transmits the tracking identifier b in the target link identifier a to the service node a through an http request. For example, the trace identifier may be carried in a request header of an http request, and the http request may be sent to the service node a as a request for invoking the service node a. Thus, the service node a can parse the trace identifier b from the request header of the http request.

When the service node a calls the next-stage service node B and the service node C, the service node a also transmits the tracking identifier B to the service node B and the service node C, or may transmit the tracking identifier B through an http request header. And in the same way, the tracking identifier b is transmitted from the previous service node to the next service node in the whole calling link L. The trace identifier b is concatenated to form a whole calling link L.

It should be noted that different service nodes may be located in the same server or in different services. For example, one microservice is a service node, and the same server may provide multiple microservices. In the event that a call relationship exists between these multiple microservices, then the tracking identification will be passed between different microservices of the same server.

When the next service node is called based on the message queue, and no http request exists between the next service node and the previous service node, the trace identifier b can be explicitly transmitted to the next service node through the message queue. For example, when the service node a calls the service node B through the message queue, the service node a stores a task S to be processed by the service node B into the message queue, and may associate the establishment tracking identifier B with the task S. When the serving node B acquires the task S from the message queue, it may acquire the tracking identifier B associated with the task S at the same time. Thereby enabling an explicit communication of the tracking identity B to the serving node B.

When any service node needs to call the called service node, the second node identifier of the called service node is stored in the local instance. As shown in fig. 12, when gateway 102 invokes service node a, the node identification of service node a is saved in the local instance. When the service node A calls the service node B, the service node A stores the node identification of the service node B in the local instance of the service node A, and so on. In order to save storage resources, in the embodiment of the present disclosure, the node identifier of each service node may be represented by an IP + port number. That is, when a plurality of service nodes are provided in the same server, each service node can be distinguished using a port number.

When the call link needs to be analyzed, the link analysis server 104 first obtains the target link identifier a, and then analyzes the target link identifier a, so as to obtain the tracking identifier b and the first node identifier c. The originating serving node gateway 102 is found based on the first node identification c. The gateway includes a router (route) and an inner router (another route), and the inner router may be uniformly used as an initial service node in the embodiment of the present disclosure.

And analyzing the calling relation among the service nodes in the calling link based on the tracking identification, thereby obtaining the calling link L. For example, the trace identifier b is parsed from the target link identifier a. Then all the service nodes with the tracking identification B are obtained, such as obtaining the service node a, the service node B and the service node C in fig. 12. In order to clarify the calling relationship between the service nodes, the node identification of the called service node stored in the local instance of each service node can be checked. For example, the node identifier of service node a may be queried in the inrouter, thereby determining that the inrouter has invoked service node a. The node identification of serving node B and the node identification of serving node C are queried in the local instance of serving node a, from which it can be determined that serving node a invoked serving node B and serving node C. By analogy, the call relation between different service nodes on the whole call link L can be analyzed, and the call link L is obtained.

Having obtained the calling link L, a calling link topology graph as shown in fig. 4 can be generated. In the calling link topology graph, the initial service node is displayed, and the calling relationship between different service nodes in the whole calling link L is displayed.

In addition, to obtain important information of the timestamp of the invocation request 2. In the embodiment of the present disclosure, when generating the target link identifier, the gateway 102 obtains time information, such as sending time, of the invocation request 2. The time information is then divided into a first portion of information and a second portion of information. The first part of information is minutes and seconds, and the second part of information is months, days and hours. The default year may be the current year. Then generating a tracking identifier based on the first part of information; and generating a target link identification based on the second part of information, the tracking identification and the first node identification. When the timestamp is analyzed, a first part of information (such as a minute and a second part of information) of the time information is analyzed from the tracking identifier, and a second part of information (such as a month, a day and a hour) of the time information is analyzed from a third target position of the target link identifier, wherein the default year is the current year, and therefore the time information is obtained. A timestamp of the time information may then be generated. The generated timestamp may be exposed in the call link topology map. Such as may be a piece of information in the details of the originating service node.

In summary, in the system provided in the embodiment of the present disclosure, a whole call link may be connected in series based on the target link identifier and the tracking identifier. And analyzing the target link identification to obtain a first node identification and a tracking identification so as to obtain a calling link between the service nodes. And the calling link is tracked based on the tracking identifier, so that the speed and the accuracy of determining the calling link are improved. The calling link takes the service node corresponding to the first node identification as the initial service node, so that the speed and the accuracy of positioning the initial position of the link are improved. By combining the two aspects, the speed and the accuracy of obtaining the target call link are improved to a certain extent.

Based on the same technical concept, an embodiment of the present disclosure further provides a processing apparatus for invoking a link, as shown in fig. 13, including:

a first obtaining module 1301, configured to obtain an access request to be processed;

a first generating module 1302, configured to generate a target link identifier of a call link of an access request to be processed;

the target link identification is used for analyzing the call link and comprises a first node identification and a tracking identification; the calling link comprises a plurality of service nodes, and the first node identification is used for marking an initial service node in the plurality of service nodes; and when any service node in the calling link calls the called service node, the tracking identifier is used for transmitting the calling link from any service node to the called service node, and the tracking identifier is used for tracking and analyzing the calling relationship among the service nodes in the calling link.

In one possible implementation, the first generating module 1302 includes:

the first dividing module is used for dividing the time information of the access request to be processed into first part information and second part information;

the first generation submodule is used for generating a tracking identifier based on the first part of information;

and the second generation submodule is used for generating the target link identification based on the second part information timestamp, the tracking identification and the first node identification.

In one possible embodiment, the second generation submodule is configured to:

In one possible embodiment, the apparatus further comprises:

and the first storage module is used for storing the second node identification of the called service node in the local instance under the condition of calling the service node.

Based on the same technical concept, the present embodiment further provides a processing apparatus for invoking a link, as shown in fig. 14, including:

a second obtaining module 1401, configured to obtain a target link identifier;

a first parsing module 1402, configured to parse the first node identifier and the tracking identifier from the target link identifier;

a second parsing module 1403, configured to parse, based on the tracking identifier, a call relationship between service nodes in the call link;

the second generating module 1404 is configured to generate a call link that takes the service node corresponding to the first node identifier as an initial service node and includes a call relationship between the service nodes.

In one possible implementation, the first parsing module 1402 includes:

the first analysis submodule is used for analyzing the tracking identifier from a first target position of the target link identifier;

the second analysis submodule is used for analyzing the digital identifier from a second target position of the target link identifier;

and the decompiling submodule is used for decompiling the digital identifier to obtain a first node identifier.

In one possible implementation, the first parsing module 1402 further includes:

the third analysis submodule is used for analyzing the first part of information of the time information from the tracking identifier;

the fourth analysis submodule is used for analyzing the second part information of the time information from the third target position of the target link mark;

and the time stamp generating submodule is used for generating the time stamp of the time information based on the first part of information and the second part of information.

In a possible implementation, the second parsing module 1403 is configured to:

acquiring a plurality of service nodes recorded with tracking identifiers;

In a possible implementation, the second parsing module 1403 includes:

the first screening submodule is used for screening out at least one target link identifier based on the target link identifier screening condition to obtain a target link identifier set;

and the first selection submodule is used for selecting the target link identification from the target link identification set.

In one possible embodiment, the first filter submodule is configured to:

the specifying information includes at least one of: log, reported error event, request header recorded in console of browser.

In one possible embodiment, the target link identification screening condition includes at least one of: access layer type, geographical range, status code, domain name and IP address.

Based on the same technical concept, an embodiment of the present disclosure further provides a processing apparatus for invoking a link, as shown in fig. 15, including:

a third obtaining module 1501, configured to obtain an access request to be processed;

a third generating module 1502, configured to generate a target link identifier of a call link of the pending access request; the target link identification comprises a first node identification and a tracking identification; in the calling link, under the condition that any service node calls the called service node, the tracking identifier is used for being transmitted to the called service node from any service node;

a fourth obtaining module 1503, configured to obtain a target link identifier;

a third parsing module 1504, configured to parse the first node identifier and the trace identifier from the target link identifier;

a fourth parsing module 1505, configured to parse, based on the tracking identifier, a call relationship between service nodes in the call link;

the fourth generating module 1506 is configured to generate a call link that takes the service node corresponding to the first node identifier as an initial service node and includes a call relationship between the service nodes.

In some embodiments, the third generation module 1502 includes:

the second division submodule is used for dividing the time information of the access request to be processed into first part information and second part information;

a third generation submodule, configured to generate a tracking identifier based on the first part of information;

and the fourth generation submodule is used for generating a target link identifier based on the second part of information, the tracking identifier and the first node identifier.

In some embodiments, the fourth generation submodule is to:

compiling the first node identification into a digital identification under the condition that the first node identification contains characters;

In some embodiments, the apparatus further comprises:

and the second storage module is used for storing the second node identification of the called service node in the local instance under the condition of calling the service node.

In some embodiments, a third parsing module 1504 to:

and performing decompiling on the digital identifier to obtain a first node identifier.

In some embodiments, the fourth parsing module 1505 is configured to:

acquiring a plurality of service nodes recorded with tracking identifiers;

and determining the calling relationship based on the second node identifiers of the service nodes and the called service nodes.

In some embodiments, the fourth obtaining module 1503 includes:

the second screening submodule is used for screening out at least one target link identifier based on the target link identifier screening condition to obtain a target link identifier set;

and the second selection submodule is used for selecting the target link identification from the target link identification set.

In some embodiments, a second screening submodule to:

In some embodiments, the target link identification screening conditions include at least one of:

For a description of specific functions and examples of each module and sub-module of the apparatus in the embodiment of the present disclosure, reference may be made to the description of corresponding steps in the foregoing method embodiments, and details are not repeated here.

The present disclosure also provides an electronic device, a readable storage medium, and a computer program product according to embodiments of the present disclosure.

FIG. 16 shows a schematic block diagram of an example electronic device 1600 that can be used to implement embodiments of the present disclosure. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital assistants, cellular telephones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not meant to limit implementations of the disclosure described and/or claimed herein.

As shown in fig. 16, the apparatus 1600 includes a computing unit 1601, which may perform various appropriate actions and processes according to a computer program stored in a Read Only Memory (ROM) 1602 or a computer program loaded from a storage unit 1608 into a Random Access Memory (RAM) 1603. In the RAM 1603, various programs and data required for the operation of the device 1600 can also be stored. The computing unit 1601, ROM 1602 and RAM 1603 are connected to each other via a bus 1604. An input/output (I/O) interface 1605 is also connected to the bus 1604.

Various components in device 1600 connect to I/O interface 1605, including: an input unit 1606 such as a keyboard, a mouse, and the like; an output unit 1607 such as various types of displays, speakers, and the like; a storage unit 1608 such as a magnetic disk, optical disk, or the like; and a communication unit 1609 such as a network card, a modem, a wireless communication transceiver, etc. A communication unit 1609 allows device 1600 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunications networks.

Computing unit 1601 may be a variety of general purpose and/or special purpose processing components with processing and computing capabilities. Some examples of computing unit 1601 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various dedicated Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, and so forth. The computing unit 1601 performs the various methods and processes described above, such as invoking a processing method of a link. For example, in some embodiments, the processing method of the call link may be implemented as a computer software program tangibly embodied in a machine-readable medium, such as storage unit 1608. In some embodiments, part or all of the computer program can be loaded and/or installed onto device 1600 via ROM 1602 and/or communications unit 1609. When the computer program is loaded into RAM 1603 and executed by computing unit 1601, one or more steps of the processing method of invoking the link described above may be performed. Alternatively, in other embodiments, computing unit 1601 may be configured by any other suitable means (e.g., by way of firmware) to perform the processing method of the call link.

Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuitry, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), system on a chip (SOCs), complex Programmable Logic Devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.

Program code for implementing the methods of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the program codes, when executed by the processor or controller, cause the functions/operations specified in the flowchart and/or block diagram to be performed. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.

In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the Internet.

The computer system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server may be a cloud server, a server of a distributed system, or a server with a combined blockchain.

It should be understood that various forms of the flows shown above, reordering, adding or deleting steps, may be used. For example, the steps described in the present disclosure may be executed in parallel or sequentially or in different orders, and are not limited herein as long as the desired results of the technical solutions disclosed in the present disclosure can be achieved.

The above detailed description should not be construed as limiting the scope of the disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the principle of the present disclosure should be included in the protection scope of the present disclosure.

Claims

1. A processing method for calling a link comprises the following steps:

acquiring an access request to be processed;

the target link identification is used for analyzing the call link, and the target link identification comprises a first node identification and a tracking identification; the calling link comprises a plurality of service nodes, and the first node identification is used for marking an initial service node in the plurality of service nodes; and when any service node in the calling link calls the called service node, the tracking identifier is used for being transmitted to the called service node from any service node, and the tracking identifier is used for analyzing the calling relationship among the service nodes in the calling link.

2. The method of claim 1, wherein the generating a target link identification for a call link of the pending access request comprises:

generating the tracking identifier based on the first part of information;

and generating the target link identification based on the second part of information, the tracking identification and the first node identification.

3. The method of claim 2, wherein said generating the target link identification based on the second portion of information, the tracking identification, and the first node identification comprises:

4. The method of any of claims 1-3, further comprising:

and in the case of calling the service node, storing the second node identification of the called service node in the local instance.

5. A processing method for calling a link comprises the following steps:

acquiring a target link identification;

analyzing a first node identifier and a tracking identifier from the target link identifier;

6. The method of claim 5, wherein the parsing out the first node identifier and the trace identifier from the target link identifier comprises:

analyzing the tracking identifier from a first target position of the target link identifier;

and performing decompiling on the digital identifier to obtain the first node identifier.

7. The method of claim 5 or 6, further comprising:

analyzing first part information of time information from the tracking identifier;

analyzing second part information of the time information from a third target position of the target link identification;

generating a timestamp of the time information based on the first partial information and the second partial information.

8. The method of claim 5, wherein said resolving calling relationships between service nodes in said calling link based on said tracking identity comprises:

acquiring a plurality of service nodes recorded with the tracking identifiers;

for each service node, respectively acquiring a second node identifier of a called service node called by the service node from a local instance of the service node;

and determining the calling relation based on the second node identifiers of the service nodes and the called service nodes.

9. The method according to any of claims 5-8, wherein said obtaining the target link identification comprises:

10. The method of claim 9, wherein the screening out at least one target link identifier based on a target link identifier screening condition comprises:

screening at least one target link identifier from the designated information based on the target link identifier screening condition;

11. The method of claim 9, the target link identification screening condition comprising at least one of:

12. A processing method for calling a link comprises the following steps:

acquiring an access request to be processed;

generating a target link identification of a calling link of the access request to be processed; the target link identification comprises a first node identification and a tracking identification; when any service node in the calling link calls a called service node, the tracking identifier is used for being transmitted to the called service node from any service node;

acquiring the target link identification;

analyzing the first node identifier and the tracking identifier from the target link identifier;

13. The method of claim 12, wherein the generating a target link identification for a call link of the pending access request comprises:

generating the tracking identifier based on the first part of information;

14. The method of claim 13, wherein said generating the target link identifier based on the second partial information, the tracking identifier, and the first node identifier comprises:

and compiling the second part of information, the tracking identifier and the digital identifier into a digital string to obtain the target link identifier.

15. The method according to any one of claims 12-14, further comprising:

16. The method of claim 12, wherein said parsing the first node identification and the tracking identification from the target link identification comprises:

17. The method according to any one of claims 1-16, further comprising:

18. The method of any one of claims 1-16, wherein said resolving call relationships between service nodes in the call link based on the tracking identity comprises:

acquiring a plurality of service nodes recorded with the tracking identifiers;

19. The method of any of claims 12-18, wherein the obtaining the target link identification comprises:

20. The method of claim 19, wherein the screening out at least one target link identifier based on a target link identifier screening condition comprises:

21. The method of claim 19, the target link identification screening condition comprising at least one of:

access layer type, geographical range, status code, domain name and IP address.

22. A processing system for invoking a link, comprising:

a gateway for performing the method of any one of claims 1-4;

a link resolution server for performing the method of any one of claims 5-11.

23. A processing apparatus that invokes a link, comprising:

the target link identification is used for analyzing the call link, and the target link identification comprises a first node identification and a tracking identification; the calling link comprises a plurality of service nodes, and the first node identification is used for marking an initial service node in the plurality of service nodes; and when any service node in the calling link calls the called service node, the tracking identifier is used for transmitting the tracking identifier to the called service node from any service node, and the tracking identifier is used for tracking and analyzing the calling relationship between the service nodes in the calling link.

24. A processing apparatus that invokes a link, comprising:

25. A processing apparatus that invokes a link, comprising:

a third generating module, configured to generate a target link identifier of a call link of the to-be-processed access request; the target link identification comprises a first node identification and a tracking identification; when any service node in the calling link calls a called service node, the tracking identifier is used for being transmitted to the called service node from any service node;

a fourth obtaining module, configured to obtain the target link identifier;

a third parsing module, configured to parse the first node identifier and the tracking identifier from the target link identifier;

the fourth analysis module is used for analyzing the calling relation among the service nodes in the calling link based on the tracking identification;

and the fourth generation module is used for generating a calling link which takes the service node corresponding to the first node identifier as an initial service node and contains the calling relationship among the service nodes.

26. An electronic device, comprising:

at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-21.

27. A non-transitory computer readable storage medium having stored thereon computer instructions for causing the computer to perform the method of any of claims 1-21.

28. A computer program product comprising a computer program which, when executed by a processor, implements the method according to any one of claims 1-21.