WO2021151312A1

WO2021151312A1 - Method for determining inter-service dependency, and related apparatus

Info

Publication number: WO2021151312A1
Application number: PCT/CN2020/122047
Authority: WO
Inventors: 李铭路
Original assignee: 平安科技（深圳）有限公司
Priority date: 2020-08-07
Filing date: 2020-10-20
Publication date: 2021-08-05
Also published as: CN111913818A; CN111913818B

Abstract

Disclosed are a method for determining inter-service dependency, and a related apparatus. The method is applied to a service system. The service system is deployed with a full link monitoring system jaeger. The method comprises: acquiring, by means of a full link monitoring system jaeger, a tracking information span when an interface is called; transmitting the tracking information span into a distributed message queue kafka; consuming each piece of tracking information span in the distributed message queue kafka to obtain a service corresponding to each span, and a parent span, and determining a service corresponding to the parent span; and obtaining, according the service corresponding to each span and the service corresponding to the parent span, an inter-service calling dependency represented by each span. By means the embodiments of the present application, an inter-service dependency can be flexibly acquired.

Description

Method and related device for determining dependency between services

This application claims the priority of a Chinese patent application filed with the Chinese Patent Office on August 7, 2020, the application number is 202010787909.1, and the invention title is "a method and related device for determining dependencies between services", the entire content of which is by reference Incorporated in this application.

Technical field

This application relates to the field of computer technology, and in particular to a method and related devices for determining dependency relationships between services.

Background technique

Jaeger is an open source distributed full-link monitoring system based on the opentracing protocol by Uber. After users access jaeger in their business systems, they can generate tracking information and record the status information of the interface processing and upstream calling components when calling the interface. Information and report to jaeger. The inventor realized that the general user access to the full-link monitoring system jaeger's business system is a complex system with a distributed or micro-service architecture, so a lot of tracking information will be generated, and this tracking information can help users understand the business system Usage status among various components. However, in the process of using, due to the complex scale of the business system connected to jaeger, the amount of link tracking information data is very large. From the perspective of the needs of operation and maintenance personnel, they usually hope to understand the current business from a macro perspective. The interface service status of each component in the system, so as to confirm the health status of the current business system and even abnormal components.

However, the inventor found that jaeger's dependency calculation component spark-dependency can only calculate service dependencies within a whole day, and cannot meet the dependency query requirements in any time period. How to be flexible in the business system connected to jaeger Obtaining service dependency is a technical problem being studied by those skilled in the art.

technical problem

The embodiment of the present application discloses a method and related device for determining the dependency relationship between services, which can flexibly obtain the dependency relationship between services.

Technical solutions

In the first aspect, the embodiment of the present application provides a method for determining the dependency relationship between services, which is applied to a business system, and the business system deploys the full-link monitoring system jaeger, and the method includes: using the full-link monitoring system jaeger Obtain the tracking information span when calling the interface; pass the tracking information span into the distributed message queue kafka; consume each tracking information span in the distributed message queue kafka to obtain the service and parent span corresponding to each span , And determine the service corresponding to the parent span; obtain the inter-service call dependency relationship represented by each span according to the service corresponding to each span and the service corresponding to the parent span.

In the second aspect, the embodiment of the present application provides a device for determining the dependency relationship between services, which is applied to a business system. The business system deploys the full-link monitoring system jaeger. The device includes: an acquisition module for passing The link monitoring system jaeger obtains the tracking information span when the interface is called; the transmission module is used to transfer the tracking information span into the distributed message queue kafka; the consumption module is used to consume each of the distributed message queue kafka Tracking information span, obtain the service and parent span corresponding to each span, and determine the service corresponding to the parent span; a generating module is used to obtain each span according to the service corresponding to each span and the service corresponding to the parent span The inter-service call dependencies represented by a span.

In a third aspect, an embodiment of the present application provides an electronic device, the electronic device includes a processor, a memory, a communication interface, and one or more programs, wherein the one or more programs are stored in the memory , And configured to be executed by the processor, and the program includes instructions for executing the steps in any method of the first aspect of the present application. Applied to a business system, the business system deploys a full-link monitoring system jaeger, and when the computer program is executed by the processor, the following method is implemented: the full-link monitoring system jaeger obtains the tracking information span when the interface is called; Pass the tracking information span into the distributed message queue kafka; consume each tracking information span in the distributed message queue kafka, obtain the service and parent span corresponding to each span, and determine the corresponding parent span Service; According to the service corresponding to each span and the service corresponding to the parent span, the inter-service call dependency relationship represented by each span is obtained.

In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, the computer-readable storage medium stores a computer program, and the computer program is executed by a processor to implement the following method: through the full-link monitoring system jaeger Obtain the tracking information span when calling the interface; pass the tracking information span into the distributed message queue kafka; consume each tracking information span in the distributed message queue kafka to obtain the service and parent span corresponding to each span , And determine the service corresponding to the parent span; obtain the inter-service call dependency relationship represented by each span according to the service corresponding to each span and the service corresponding to the parent span.

Beneficial effect

In the embodiment of the application, the dependency relationship between computing services does not need to rely on jaeger's native data processing logic to calculate once a day, but based on the characteristics of kafka's timing batch processing, the dependency relationship between services represented by span is calculated in real time, which can flexibly obtain inter-service dependencies. relation.

Description of the drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the drawings that need to be used in the embodiments of the present application or the background technology.

FIG. 1 is a schematic diagram of the architecture of a service system connected to jaeger provided by an embodiment of the present application.

FIG. 2 is a schematic diagram of another architecture of a service system connected to jaeger provided by an embodiment of the present application.

FIG. 3 is a schematic flowchart of a method for determining a dependency relationship between services provided by an embodiment of the present application.

FIG. 4 is a schematic flowchart of a method for determining a dependency relationship between services provided by an embodiment of the present application.

Fig. 5 is a schematic structural diagram of an apparatus for determining a dependency relationship between services provided by an embodiment of the present application.

Fig. 6 is a schematic structural diagram of an electronic device provided by an embodiment of the present application.

Embodiments of the present invention

The technical solutions in the embodiments of the present application will be described below in conjunction with the accompanying drawings.

In order to enable those skilled in the art to better understand the solutions of the application, the technical solutions in the embodiments of the application will be clearly and completely described below in conjunction with the drawings in the embodiments of the application. Obviously, the described embodiments are only These are a part of the embodiments of this application, but not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative work should fall within the protection scope of this application.

The terms “first”, “second”, “third”, “fourth”, etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish different objects, rather than to describe a specific sequence. In addition, the terms "including" and "having" and any variations of them are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the listed steps or units, but optionally includes unlisted steps or units, or optionally also includes Other steps or units inherent to these processes, methods, products or equipment.

The technical solution of this application can be applied to the fields of smart city, blockchain and/or big data technology to achieve flexible access to dependencies between services. Optionally, the data involved in this application, such as tracking information, can be stored in a database, or can be stored in a blockchain, which is not limited in this application.

Please refer to Figure 1. Figure 1 is a schematic diagram of the architecture of a Jaeger-enabled business system provided by an embodiment of the present application. The business system includes a user application, a jaeger-collector and a storage component (storage), among which:

The user application is used to directly push link tracking information (span) to the jaeger-collector, where there may be one or multiple user applications, and n in Figure 1 is taken as an example for illustration.

The distributed full-link monitoring system port jaeger-collector is used to store link tracking information (span) in the currently configured storage component storage to complete data processing and landing.

Figure 1 is a conventional business system connected to jaeger, which can only calculate the service dependency relationship within a whole day, and cannot meet the dependency query requirements in any time period. Therefore, the applicant of this application is shown in Figure 1 Optimized on the basis of the business system shown. After jaeger-collector collects the data, a new processing logic is added to calculate the dependencies between services. The new processing logic needs to be implemented based on the new business system architecture. Please refer to the figure. 2. It is a schematic diagram of the architecture of another business system connected to jaeger provided by an embodiment of the present application. In addition to the user application, jaeger-collector and storage components in Figure 1, the business system also includes a distributed message queue Kafka and computing components (dependency-plugin).

Jaeger-collector is used to process data (such as span) and transfer it to the distributed message queue kafka.

The distributed message queue kafka is used as a middleware to cache the data to be processed to ensure the reliability of data transmission.

The computing component (dependency-plugin) is used to connect the distributed message queue kafka in the form of a consumer group, and then consume relevant data from the distributed message queue kafka and calculate the service dependency relationship represented by each span, and save it The service depends on the related storage components.

Of course, the above-mentioned business system connected to jaeger may also include other components, for example, including some components in jaeger; for example, including conventional components in parts of the business system other than jaeger.

It should be noted that the business system shown in FIG. 1 and the hardware device on which the business system shown in FIG. 2 relies may be one server, or a server cluster composed of multiple servers, or other devices with computing capabilities. If the execution subject of the subsequent corresponding operations is an electronic device, it should be understood that it can be replaced by a server, or a server cluster, or other devices with computing capabilities.

Please refer to Figure 3. Figure 3 is a schematic flow diagram of a method for determining dependency relationships between services of a full-link monitoring system provided by an embodiment of the present application. The method can be implemented based on the architecture shown in Figure 2 or based on other accesses. This method includes but is not limited to the following steps.

Step S301: The electronic device obtains the tracking information span when the interface is called through the jaeger.

Among them, the electronic device is deployed with a business system, and the business system is used to support the user to complete the corresponding business. In the embodiment of the present application, the distributed full-link monitoring system jaeger is deployed in the business system. Therefore, the electronic device can obtain the tracking information span of the calling interface through the jaeger.

It should be noted that in the business system that is connected to the distributed full-link monitoring system jaeger, when an interface call request occurs, a globally unique trace ID traceID will be generated, which represents the uniqueness of the interface call request in jaeger. When the components in the interface call request process are processed, a trace information span will be generated, and different spans are distinguished by spanID. The span here will record the global trace ID traceID of the interface request and the current trace ID spanID (that is, the current trace ID). The trace ID of the interface request), service name, interface name, call time and other information. If there are other upstream components participating in this call, the traceID, spanID and other information of other upstream component calls will also be recorded. Spans with the same traceID indicate that they belong to different call processing in the same interface call request.

Step S302: The electronic device transfers the tracking information span to the distributed message queue kafka.

Optionally, the electronic device transfers the tracking information span to the distributed message queue kafka through the jaeger-collector.

Step S303: The electronic device consumes each tracking information span in the distributed message queue kafka, obtains the service and parent span corresponding to each span, and determines the service corresponding to the parent span.

Specifically, traverse all spans to obtain the mapping relationship between spanID and service_name (service name). This process can obtain the service corresponding to each span; and traverse all spans and find service_name through parent_span_id (parentID), that is, determine the corresponding parent span service.

For the new data stream, group it according to parent + child.

Optionally, step S303 may be specifically implemented by the aforementioned computing component (dependency-plugin).

Step S304: The electronic device obtains the inter-service call dependency relationship represented by each span according to the service corresponding to each span and the service corresponding to the parent span.

In the embodiment of this application, parent_service_name + child_service_name (that is, the name of the service corresponding to the parent span + the name of the service corresponding to the child span) is an edge, which represents a service dependency relationship.

In an optional solution, when consuming span from the distributed message queue Kafka, Jaeger's span collection can be considered compatible with the zipkin protocol of the distributed tracking system. In order to achieve this goal, the embodiment of this application will determine whether there is tracking in the span. The category (spanKind) field is used to handle special scenarios where the parent and child spanIDs are the same in the case of zipkin in remote procedure call (RPC) calls. In this scenario, the embodiment of the application will update the child span with the service name of the parent span The dependency relationship of the sub-span is used to update the dependency relationship of all spans that depend on the sub-span with the service name (or spanID) of the sub-span.

The following is an example of a method of calculating dependencies between services compatible with the zipkin protocol in conjunction with Figure 4.

Step 1: The electronic device subscribes to the topic (topic) of the distributed message queue kafka cluster, and retrieves the span from the distributed message queue kafka cluster for consumption.

It can be understood that in this way, multiple spans can usually be retrieved from the distributed message queue kafka.

Step 2: For each span, the electronic device determines whether there is a spanKind field in the span. For different judgment results, there are differences in subsequent operations performed by the electronic device. For ease of description, the following takes the first span as an example. The first span is to retrieve any of the multiple spans from the distributed message queue kafka. One, the operation of the electronic device with respect to the first span is as follows.

A. If the spanKind field does not exist in the first span, update all span dependency information with the spanID of the first span as the parentID (that is, the parent ID, which can also be called the tracking ID of the last request).

B. There is a spanKind field in the first span, and the spanKind field is a client (client), then update the span dependency information that is the same as the spanID of the first span and spanKind is the host (server).

C. There is a spanKind field in the first span, and the spanKind field is server, then all span dependency information with the spanID of the first span as the parentID is updated.

Step 3: Put the spanID of the first span into the cyclic queue of the Least Recently Used (LRU) elimination algorithm, and put the first span into the cache with a fixed elimination time.

Step 4: Take out the spanID from the circular queue regularly. When the spanID of the first span is taken out, check whether the first span has expired in the cache. The two results of expiration and non-expiration correspond to two different follow-ups respectively. The operation is as follows.

A. If the first span has not expired, the execution flow will be switched to the above step 2, and the above steps 2~4 will be executed for the first span in a loop until it is finally judged that the first span has expired, then the dependence on the first span is ended Relational calculation processing flow.

B. If the first span has expired, the dependency calculation processing flow for the first span is ended.

Optionally, the above steps 1 to 3 can be specifically completed by the dependency-plugin of the computing component in the business system. Of course, other components in the business system can also be used to assist the calculation component dependency-plugin to complete one or more of the above steps 1 to 3.

The above lists a method for calculating the dependency relationship between services compatible with the zipkin protocol. Similarly, the business system that introduces jaeger in the embodiment of the present application can also be compatible with other protocols, such as opentracing. The calculation process of the dependency relationship when compatible with other protocols can refer to the calculation process of the dependency relationship between computing services compatible with the zipkin protocol, which will not be repeated here.

Optionally, although the embodiment of the present application proposes a new service dependency calculation processing flow for the business system that is connected to the full-link monitoring system jaeger, the jaeger in the business system can normally follow its original processing The calculation of the service dependency is performed logically. For example, the new service dependency calculation process proposed in the embodiment of this application is used to calculate the service dependency in real time, and the service is calculated according to the original processing logic of Jaeger every day (that is, in units of days) Dependency.

In the method shown in Figure 3, without destroying the native data processing logic of the full-link monitoring system jaeger, the distributed message queue kafka is additionally introduced as a buffer middleware for the data collection process, and then consumed (for example, through self The developed dependency-plugin component for consumption) data in kafka is periodically batch processed span. In this way, due to the additional introduction of distributed message queue kafka, the dependencies between computing services do not need to rely on jaeger’s native data processing logic. It is calculated once a day, but based on the characteristics of kafka's timing batch processing, it calculates the dependencies between services represented by the span in real time.

In addition, because the components of the computing service dependency are connected to the distributed message queue kafka in the form of a consumer group, the dependency between distributed computing services can be realized. The distributed architecture can meet the capacity requirements of business peaks, and through distributed The decoupling effect of the message queue kafka, at the peak of the business, the service set dependency calculation process newly proposed in this application basically does not affect the performance of the original jaeger.

In addition, through the introduction of the LRU elimination algorithm of the circular queue and the timing expiration mechanism of the cache, the expired span is clear in real time, and the availability of computing services can be guaranteed when the peak traffic is met.

In addition, the above method is compatible with multiple link tracing protocols, such as opentracing, zipkin and other protocols.

The foregoing describes the methods of the embodiments of the present application in detail. In order to facilitate better implementation of the above solutions of the embodiments of the present application, correspondingly, the apparatuses of the embodiments of the present application are provided below.

Please refer to FIG. 5, which is a schematic structural diagram of an apparatus 50 for determining a dependency relationship between services provided by an embodiment of the present application. The apparatus 50 may be the electronic device in the foregoing method embodiment or a module in the electronic device. The device is equipped with a business system (which can also be described as applied to a business system), and the business system deploys a full-link monitoring system jaeger. The device 50 includes an acquisition module 501, a transmission module 502, a consumption module 503, and a generation module 504. The description of each module is as follows.

The obtaining module 501 is used to obtain the trace information span when the interface is called through the full-link monitoring system jaeger.

The transmission module 502 is configured to transfer the tracking information span to the distributed message queue kafka.

The consumption module 503 is configured to consume each trace information span in the distributed message queue kafka, obtain the service and parent span corresponding to each span, and determine the service corresponding to the parent span.

The generating module 504 is configured to obtain the inter-service call dependency relationship represented by each span according to the service corresponding to each span and the service corresponding to the parent span.

Wherein, the acquiring module 501 may be the jaeger-collector in the full link monitoring system jaeger mentioned in the method embodiment. The transmission module 502 and the consumption module 503 may be two sub-modules in the dependency-plugin mentioned in the method embodiment.

In an optional solution, an auxiliary system is deployed in the business system, and the auxiliary system includes the distributed message queue kafka and computing components; each trace in the distributed message queue kafka is consumed Information span, to obtain the service and parent span corresponding to each span, and to determine the service corresponding to the parent span. The consumption module 503 is specifically configured to consume the distributed message queue kafka through the computing component For each tracking information span, the service and parent span corresponding to each span are obtained, and the service corresponding to the parent span is determined.

In yet another optional solution, the jaeger is used to generate the inter-service call dependency relationship represented by each span based on the span. That is to say, in addition to obtaining the inter-service dependency through the newly added process in this application, the jaeger will also obtain the inter-service dependency based on its existing mechanism.

In yet another optional solution, in terms of obtaining the calling dependency relationship between the services represented by each span according to the service corresponding to each span and the service corresponding to the parent span, the consumption module 503 Specifically used for: judging whether there is a spanKind field in the first span, where the first span is any span in the distributed message queue kafka consumed; based on the judgment result based on the service and the corresponding service of the first span The service corresponding to the parent span generates an inter-service call dependency relationship represented by the first span.

In yet another optional solution, in the step of generating the inter-service call dependency relationship represented by the first span based on the judgment result based on the service corresponding to the first span and the service corresponding to the parent span, the consumption The module 503 is specifically used to: if the spanKind field does not exist in the first span, update all span dependency information with the spanID of the first span as the parentID; if the spanKind field exists in the first span and the spanKind field is client, update The spanID is the same as the span ID of the first span and spanKind is the span dependency information of the server; if the spanKind field exists in the first span and the spanKind field is the server, then all span dependency information with the spanID of the first span as the parentID is updated.

In yet another optional solution, after the call dependency relationship between the services represented by the first span is generated based on the judgment result based on the service corresponding to the first span and the service corresponding to the parent span, the consumption The unit 503 is also used to: put the spanID of the first span into the circular queue of the least recently used LRU elimination algorithm, and put the first span into the buffer with a fixed elimination time; and periodically take out the spanID from the circular queue When the spanID of the first span is obtained, it is determined whether the first span expires in the cache of the fixed elimination time; if it expires, the calculation processing of the dependency relationship of the first span is ended.

In yet another optional solution, the trace information when the interface is called includes one or more of the traceID, spanID, service name, interface name, and calling time of the interface call request.

It should be noted that, in the embodiment of the present application, the specific implementation of each unit may also correspond to the corresponding description of the method embodiment shown in FIG. 3.

In the device described in Figure 5, without destroying the native data processing logic of the full-link monitoring system jaeger, the distributed message queue kafka is additionally introduced as a buffer middleware for the data collection process, and then consumed (for example, through self The developed dependency-plugin component for consumption) data in kafka is periodically batch processed span. In this way, due to the additional introduction of distributed message queue kafka, the dependencies between computing services do not need to rely on jaeger’s native data processing logic. It is calculated once a day, but based on the characteristics of kafka's timing batch processing, it calculates the dependencies between services represented by the span in real time.

Referring to FIG. 6, FIG. 6 is a schematic diagram of an electronic device structure 60 of a hardware operating environment involved in an embodiment of the application. The electronic device 60 is equipped with a business system (which can also be described as being applied to a business system), and the business system deploys a full-link monitoring system jaeger, where, as shown in FIG. 6, the hardware operating environment involved in the embodiment of the present application The electronic equipment can include the following.

The processor 601. The processor 601 may be one or more central processing units (central processing units). processing unit, CPU). When the processor 601 is a CPU, the CPU may be a single-core CPU or a multi-core CPU.

The memory 602 includes but is not limited to random access memory (RAM), read-only memory (read-only memory, ROM), erasable programmable read-only memory (erasable A programmable read only memory (EPROM) or a portable read-only memory (compact disc read-only memory, CD-ROM), the memory 602 is used for related computer programs and data.

The communication interface 603 is used to implement communication between the electronic device and other devices.

Those skilled in the art can understand that the structure of the electronic device shown in FIG. 6 does not constitute a limitation on the electronic device, and may include more or fewer components than shown in the figure, or a combination of certain components, or different component arrangements. .

As shown in FIG. 6, the memory 602 may include an operating system, a network communication module, and a text processing program. The operating system is a program that manages and controls the hardware and software resources of electronic devices, and supports the operation of text processing programs and other software or programs. The network communication module is used to implement communication between various components in the memory 602 and communication with other hardware and software in the electronic device.

In the electronic device shown in FIG. 6, the processor 601 is used to execute the computer program stored in the memory 602 to perform the following operations: obtain the trace information span when the interface is called through the full-link monitoring system jaeger; The span is passed into the distributed message queue kafka; each trace information span in the distributed message queue kafka is consumed, the service and parent span corresponding to each span are obtained, and the service corresponding to the parent span is determined; according to the The service corresponding to each span and the service corresponding to the parent span obtain the calling dependency relationship between the services represented by each span.

In an optional solution, an auxiliary system is deployed in the business system, and the auxiliary system includes the distributed message queue kafka and computing components; each trace in the distributed message queue kafka is consumed Information span, to obtain the service and parent span corresponding to each span, and to determine the service corresponding to the parent span, the processor 601 is specifically configured to consume the distributed message queue kafka through the computing component For each tracking information span, the service and parent span corresponding to each span are obtained, and the service corresponding to the parent span is determined.

In yet another optional solution, the processor is further configured to: generate the inter-service call dependency relationship represented by each span based on the span through the jaeger. That is to say, in addition to obtaining the inter-service dependency through the newly added process in this application, the jaeger will also obtain the inter-service dependency based on its existing mechanism.

In yet another optional solution, in terms of obtaining the call dependency relationship between the services represented by each span according to the service corresponding to each span and the service corresponding to the parent span, the processor 601 specifically uses In: judging whether there is a spanKind field in the first span, where the first span is any span in the distributed message queue kafka consumed; based on the judgment result based on the service corresponding to the first span and the The service corresponding to the parent span generates the inter-service call dependency relationship represented by the first span.

In yet another optional solution, in the aspect of generating the inter-service call dependency relationship represented by the first span based on the judgment result based on the service corresponding to the first span and the service corresponding to the parent span, the The processor 601 is specifically configured to: if the spanKind field does not exist in the first span, update all span dependency information with the spanID of the first span as the parentID; if the spanKind field exists in the first span and the spanKind field is client, then Update the span dependency information that is the same as the spanID of the first span and spanKind is the server; if there is a spanKind field in the first span and the spanKind field is server, then update all the span dependency information that uses the spanID of the first span as the parentID .

In yet another optional solution, after the inter-service call dependency relationship represented by the first span is generated based on the judgment result based on the service corresponding to the first span and the service corresponding to the parent span, the processing The device 601 is also used to: put the spanID of the first span into the circular queue with the least recently used LRU elimination algorithm, and put the first span into the buffer with a fixed elimination time; and periodically take out the spanID from the circular queue When the spanID of the first span is obtained, it is determined whether the first span expires in the cache of the fixed elimination time; if it expires, the calculation processing of the dependency relationship of the first span is ended.

It should be noted that the implementation of each operation may also correspond to the corresponding description of the method embodiment shown in FIG. 3.

In the electronic device 60 described in FIG. 6, without destroying the native data processing logic of the full-link monitoring system jaeger, the distributed message queue kafka is additionally introduced as a buffer middleware for the data collection process, and then consumed (for example, Consumption through the self-developed dependency-plugin component) Data in Kafka, timed batch processing span, using this method, due to the additional introduction of distributed message queue Kafka, so the dependency between computing services does not need to rely on the native data processing of Jaeger The logic is calculated once a day, but based on the characteristics of kafka's timing batch processing, it calculates the dependencies between services represented by the span in real time.

An embodiment of the present application also provides a chip system. The chip system includes at least one processor, a memory, and an interface circuit. The memory, the transceiver, and the at least one processor are interconnected by wires, and the at least one memory A computer program is stored therein; when the computer program is executed by the processor, the method shown in FIG. 3 is implemented.

The embodiment of the present application also provides a computer-readable storage medium in which a computer program is stored, and when it runs on a processor, the method flow shown in FIG. 3 is implemented. For example, the following methods can be implemented: obtain the trace information span when the interface is called through the full link monitoring system jaeger; transfer the trace information span into the distributed message queue kafka; consume each of the distributed message queue kafka Track the information span, obtain the service and parent span corresponding to each span, and determine the service corresponding to the parent span; obtain the service represented by each span according to the service corresponding to each span and the service corresponding to the parent span Call dependencies between.

Optionally, the program can also implement other steps of the above method when running on the processor, which will not be repeated here. Further optionally, the medium involved in this application, such as a computer-readable storage medium, may be non-volatile or volatile.

The embodiment of the present application also provides a computer program product. When the computer program product runs on a terminal, the method flow shown in FIG. 3 is implemented.

In summary, without destroying the native data processing logic of the full-link monitoring system jaeger, the distributed message queue kafka is additionally introduced as a buffer middleware for the data collection process, and then consumed (for example, through self-developed dependency- (plugin component for consumption) data in Kafka, timed batch processing span, using this method, due to the additional introduction of distributed message queue kafka, so the dependency between computing services does not need to rely on jaeger's native data processing logic to calculate once a day, Instead, it calculates the dependencies between services represented by span in real time based on the characteristics of kafka's timing batch processing.

It should also be noted that for the foregoing method embodiments, for the sake of simple description, they are all expressed as a series of action combinations, but those skilled in the art should know that this application is not limited by the described sequence of actions. , Because according to this application, some steps can be carried out in other order or at the same time. Secondly, those skilled in the art should also know that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by this application. In the above-mentioned embodiments, the description of each embodiment has its own emphasis. For parts that are not described in detail in an embodiment, reference may be made to related descriptions of other embodiments.

As mentioned above, the above embodiments are only used to illustrate the technical solutions of the present application, but not to limit them; although the present application has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: The technical solutions recorded in the embodiments are modified, or some of the technical features are equivalently replaced; these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present application.

Claims

A method for determining the dependency between services, which is applied to a business system that deploys a full-link monitoring system jaeger, and the method includes:

Obtain the trace information span when calling the interface through the full-link monitoring system jaeger;

Pass the tracking information span into the distributed message queue kafka;

Consuming each tracking information span in the distributed message queue kafka, obtaining the service and parent span corresponding to each span, and determining the service corresponding to the parent span;

According to the service corresponding to each span and the service corresponding to the parent span, the inter-service call dependency relationship represented by each span is obtained.
The method according to claim 1, wherein the business system deploys an auxiliary system, the auxiliary system includes the distributed message queue kafka and a computing component; the consuming each of the distributed message queue kafka Tracking the information span, obtaining the service and parent span corresponding to each span, and determining the service corresponding to the parent span, including:

Each trace information span in the distributed message queue kafka is consumed by the computing component to obtain the service and parent span corresponding to each span, and determine the service corresponding to the parent span.
The method according to claim 2, further comprising:

The jaeger generates the inter-service call dependency relationship represented by each span based on the span.
The method according to any one of claims 1 to 3, wherein the obtaining the calling dependency relationship between services represented by each span according to the service corresponding to each span and the service corresponding to the parent span includes :

Determine whether there is a tracking category spanKind field in the first span, where the first span is any span in the distributed message queue kafka consumed;

According to the judgment result, the inter-service call dependency relationship represented by the first span is generated based on the service corresponding to the first span and the service corresponding to the parent span.
The method according to claim 4, wherein the generating the inter-service call dependency relationship represented by the first span based on the service corresponding to the first span and the service corresponding to the parent span according to the judgment result comprises:

If the spanKind field does not exist in the first span, update all span dependency information that uses the spanID of the first span as the tracking identifier parentID of the last request;

If the spanKind field exists in the first span, and the spanKind field is the client client, update the span ID that is the same as the spanID of the first span and spanKind is the span dependency information of the host server;

If the spanKind field exists in the first span, and the spanKind field is server, then all span dependency information with the spanID of the first span as the parentID is updated.
The method according to claim 5, wherein after said generating the inter-service call dependency relationship represented by the first span based on the judgment result based on the service corresponding to the first span and the service corresponding to the parent span, the method further comprises :

Put the spanID of the first span into the circular queue with the least recently used LRU elimination algorithm, and put the first span into the cache with a fixed elimination time;

Timing out the spanID from the circular queue, and when the spanID of the first span is obtained, determining whether the first span has expired in the fixed elimination time cache;

If it expires, the calculation processing of the dependency relationship of the first span is ended.
The method according to any one of claims 1-3, wherein the trace information when the interface is called includes one of the global trace ID traceID of the interface call request, the current trace ID spanID, the service name, the interface name, and the calling time. Item or multiple items.
A device for determining the dependency relationship between services, which is applied to a business system where the full link monitoring system jaeger is deployed in the business system, and the device includes:

The acquisition module is used to acquire the tracking information span when calling the interface through the full-link monitoring system jaeger;

The transmission module is used to transfer the tracking information span to the distributed message queue kafka;

The consumption module is used to consume each trace information span in the distributed message queue kafka, obtain the service and parent span corresponding to each span, and determine the service corresponding to the parent span;

The generating module is used to obtain the inter-service call dependency relationship represented by each span according to the service corresponding to each span and the service corresponding to the parent span.
An electronic device, wherein, applied to a business system, the business system deploys a full-link monitoring system jaeger, the electronic device includes a processor, a memory, a communication interface, and one or more computer programs, wherein the one Or multiple computer programs are stored in the memory and configured to be executed by the processor, and when the computer program is executed by the processor, the following method is implemented:

Obtain the trace information span when calling the interface through the full-link monitoring system jaeger;

Pass the tracking information span into the distributed message queue kafka;

Consuming each tracking information span in the distributed message queue kafka, obtaining the service and parent span corresponding to each span, and determining the service corresponding to the parent span;

According to the service corresponding to each span and the service corresponding to the parent span, the inter-service call dependency relationship represented by each span is obtained.
The electronic device according to claim 9, wherein the business system deploys an auxiliary system, the auxiliary system includes the distributed message queue kafka and a computing component; the consumption of each of the distributed message queue kafka A tracking information span is used to obtain the service and parent span corresponding to each span, and when determining the service corresponding to the parent span, it is specifically used for:

Each trace information span in the distributed message queue kafka is consumed by the computing component to obtain the service and parent span corresponding to each span, and determine the service corresponding to the parent span.
The electronic device according to claim 10, wherein, when the computer program is executed by the processor, it is further used to implement:

The jaeger generates the inter-service call dependency relationship represented by each span based on the span.
The electronic device according to any one of claims 9-11, wherein, according to the service corresponding to each span and the service corresponding to the parent span, when the calling dependency relationship between the services represented by each span is obtained , Specifically used for:

Determine whether there is a tracking category spanKind field in the first span, where the first span is any span in the distributed message queue kafka consumed;

According to the judgment result, the inter-service call dependency relationship represented by the first span is generated based on the service corresponding to the first span and the service corresponding to the parent span.
The electronic device according to claim 12, wherein when the inter-service call dependency relationship represented by the first span is generated based on the judgment result based on the service corresponding to the first span and the service corresponding to the parent span, specifically Used for:

If the spanKind field does not exist in the first span, update all span dependency information that uses the spanID of the first span as the tracking identifier parentID of the last request;

If the spanKind field exists in the first span, and the spanKind field is the client client, update the span ID that is the same as the spanID of the first span and spanKind is the span dependency information of the host server;

If the spanKind field exists in the first span, and the spanKind field is server, then all span dependency information with the spanID of the first span as the parentID is updated.
The electronic device according to claim 13, wherein, after the inter-service call dependency relationship represented by the first span is generated based on the judgment result based on the service corresponding to the first span and the service corresponding to the parent span, the When the computer program is executed by the processor, it is also used to realize:

Put the spanID of the first span into the circular queue with the least recently used LRU elimination algorithm, and put the first span into the cache with a fixed elimination time;

Timing out the spanID from the circular queue, and when the spanID of the first span is obtained, determining whether the first span has expired in the fixed elimination time cache;

If it expires, the calculation processing of the dependency relationship of the first span is ended.
A computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, which, when running on a processor, implements the following method:

Obtain the trace information span when calling the interface through the full-link monitoring system jaeger;

Pass the tracking information span into the distributed message queue kafka;

Consuming each tracking information span in the distributed message queue kafka, obtaining the service and parent span corresponding to each span, and determining the service corresponding to the parent span;

According to the service corresponding to each span and the service corresponding to the parent span, the inter-service call dependency relationship represented by each span is obtained.
The computer-readable storage medium according to claim 15, wherein the business system deploys an auxiliary system, and the auxiliary system includes the distributed message queue kafka and a computing component; the consuming of the distributed message queue kafka For each tracking information span in, to obtain the service and parent span corresponding to each span, and to determine the service corresponding to the parent span, it is specifically used for:

Each trace information span in the distributed message queue kafka is consumed by the computing component to obtain the service and parent span corresponding to each span, and determine the service corresponding to the parent span.
The computer-readable storage medium according to claim 16, wherein the computer program is also used to implement:

The jaeger generates the inter-service call dependency relationship represented by each span based on the span.
The computer-readable storage medium according to any one of claims 15-17, wherein the inter-service call represented by each span is obtained according to the service corresponding to each span and the service corresponding to the parent span When it is a dependency, it is specifically used for:

Determine whether there is a tracking category spanKind field in the first span, where the first span is any span in the distributed message queue kafka consumed;

According to the judgment result, the inter-service call dependency relationship represented by the first span is generated based on the service corresponding to the first span and the service corresponding to the parent span.
18. The computer-readable storage medium according to claim 18, wherein the inter-service call dependency relationship represented by the first span is generated based on the service corresponding to the first span and the service corresponding to the parent span according to the judgment result When, specifically used for:

If the spanKind field does not exist in the first span, update all span dependency information that uses the spanID of the first span as the tracking identifier parentID of the last request;

If the spanKind field exists in the first span, and the spanKind field is the client client, update the span ID that is the same as the spanID of the first span and spanKind is the span dependency information of the host server;

If the spanKind field exists in the first span, and the spanKind field is server, then all span dependency information with the spanID of the first span as the parentID is updated.
18. The computer-readable storage medium according to claim 19, wherein the inter-service call dependency relationship represented by the first span is generated based on the service corresponding to the first span and the service corresponding to the parent span according to the judgment result After that, the computer program is also used to implement when running on the processor:

Put the spanID of the first span into the circular queue that uses the least recently used LRU elimination algorithm, and put the first span into the buffer with a fixed elimination time; periodically take out the spanID from the circular queue, and when the When the spanID of the first span is used, it is determined whether the first span has expired in the cache of the fixed elimination time; if it expires, the calculation processing of the dependency relationship of the first span is ended.