CN106657192B - Method and equipment for presenting service calling information - Google Patents
Method and equipment for presenting service calling information Download PDFInfo
- Publication number
- CN106657192B CN106657192B CN201510734355.8A CN201510734355A CN106657192B CN 106657192 B CN106657192 B CN 106657192B CN 201510734355 A CN201510734355 A CN 201510734355A CN 106657192 B CN106657192 B CN 106657192B
- Authority
- CN
- China
- Prior art keywords
- service
- topology
- invocation
- topologies
- call
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/51—Discovery or management thereof, e.g. service location protocol [SLP] or web services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Telephonic Communication Services (AREA)
Abstract
The application aims to provide a method and equipment for presenting service calling information. Specifically, one or more service call chains in a distributed service system are obtained; generating one or more corresponding first service call topologies according to the one or more service call chains; presenting at least one of the one or more first service invocation topologies. Compared with the prior art, the service calling chain with the service node calling sequence information in the distributed service system is obtained, the service calling chains with the same service node calling sequence are aggregated into the service calling topology, and the service calling topology relation is presented, so that the problem that the service calling relation in the distributed service system is visually presented is solved, the service calling relation in the distributed service system can be visually and clearly presented, and the efficiency of the service calling relation in the distributed service system in the developing, optimizing and problem locating processes is improved.
Description
Technical Field
The present application relates to the field of computers, and more particularly, to a technique for presenting service invocation information.
Background
With the development of the internet, the scale of applications depending on the network, such as service platforms, online malls, and the like, is gradually enlarged and a distributed service system is adopted, wherein more and more services of the applications are increasingly closely related and dependent, so that the call relationship in the distributed system is complicated, the services called by the same service in each operation are different due to different internal and external factors during the operation, and therefore, the relationship between the call services is difficult to clear and adjust in the process of developing the service or service in the same service, and the related service of the development service is often searched and developed according to the original technical development document or path in the prior art when the development is performed in the distributed service system.
However, in the prior art, it is difficult to visually observe the relationship between service branches in the development process, the manner of searching historical development documents and paths is time-consuming and complex, and it is difficult to accurately comb the relationship between services, problems are difficult to locate, the optimization of the call relationship between services is difficult, and the development efficiency is low.
Disclosure of Invention
An object of the present application is to provide a method and an apparatus for presenting service invocation information, so as to solve the problem of intuitive presentation of service invocation relationship in a distributed system.
To achieve the above object, according to one aspect of the present application, there is provided a method for presenting service invocation information, which solves the problem of intuitive presentation of service invocation relationship in a distributed system, and includes:
acquiring one or more service call chains in a distributed service system, wherein each service call chain comprises one or more service nodes which are called sequentially;
generating one or more corresponding first service call topologies according to the one or more service call chains, wherein each first service call topology is aggregated by one or more service call chains;
presenting at least one of the one or more first service invocation topologies.
According to another aspect of the present application, the present application provides an apparatus for presenting service invocation information, the apparatus solves the problem of intuitive presentation of service invocation relationship in a distributed system, and the apparatus comprises:
the service calling chain acquiring device is used for acquiring one or more service calling chains in the distributed service system, wherein each service calling chain comprises one or more service nodes which are called sequentially;
a first service call topology generating device, configured to generate one or more corresponding first service call topologies according to the one or more service call chains, where each first service call topology is aggregated by one or more service call chains;
service invocation presenting means for presenting at least one of said one or more first service invocation topologies.
Compared with the prior art, the service calling chain with the service node calling sequence information in the distributed service system is obtained, the service calling chains with the same service node calling sequence are aggregated into the service calling topology, and the service calling topology relation is presented, so that the problem that the service calling relation in the distributed service system is visually presented is solved, the service calling relation in the distributed service system can be visually and clearly presented, and the efficiency of the service calling relation in the distributed service system in the developing, optimizing and problem locating processes is improved.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 illustrates a flow diagram of a method for presenting service invocation information in accordance with an aspect of the subject application;
FIG. 2 illustrates a flow diagram of a method for presenting service invocation information in accordance with another preferred embodiment of the present application;
FIG. 3 illustrates a flow diagram of a method for presenting service invocation information in accordance with yet another preferred embodiment of the present application;
FIG. 4 illustrates a schematic diagram of an apparatus for presenting service invocation information in accordance with another aspect of the subject application;
FIG. 5 is a schematic diagram of an apparatus for presenting service invocation information in accordance with another preferred embodiment of the present application;
FIG. 6 is a schematic diagram of an apparatus for presenting service invocation information in accordance with yet another preferred embodiment of the present application;
FIG. 7 is a diagram illustrating the differentiated presentation of service invocation information in a display window according to yet another preferred embodiment of the present application.
The same or similar reference numbers in the drawings identify the same or similar elements.
Detailed Description
The present application is described in further detail below with reference to the attached figures.
In a typical configuration of the present application, the terminal, the device serving the network, and the trusted party each include one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include non-transitory computer readable media (transient media), such as modulated data signals and carrier waves.
FIG. 1 illustrates a flow diagram of a method for presenting service invocation information in accordance with an aspect of the subject application. Including step S1, step S2, and step S3.
In step S1, the device 1 acquires one or more service call chains in the distributed service system, where each service call chain includes one or more service nodes that are called sequentially; in step S2, the device 1 generates one or more corresponding first service invocation topologies according to the one or more service invocation chains, where each first service invocation topology is aggregated by one or more service invocation chains; in step S3, the device 1 presents at least one of the one or more first service invocation topologies.
Specifically, in step S1, the device 1 acquires one or more service call chains in the distributed service system, where each service call chain includes one or more service nodes that are sequentially called. Herein, the distributed service system includes, but is not limited to, a service-oriented architecture or a software system built on a distributed system. The service node includes, but is not limited to, a service or a function for calling in the distributed service system, and for example, the service node when the product is consumed on the e-commerce platform includes calling a user name, calling a user-associated account, calling a payment page, obtaining security verification, checking account balance, and the like. The service call chain refers to service nodes and sequences thereof related to one service call completed in the distributed service system, acquires log information related to the service call chain and operation history information of the system, extracts the service nodes and information thereof related to the service called each time, acquires a process capable of clearly displaying the service call of the service call chain including the service nodes and the call sequences thereof related to the called service, and acquires the topology and the topology thereof of each service call.
It will be understood by those skilled in the art that the above-described manner of obtaining a service call chain is merely exemplary, and that other existing or future manners of obtaining a service call chain, as applicable to the present application, are also intended to be encompassed within the scope of the present application and are hereby incorporated by reference.
Next, in step S2, the device 1 generates one or more corresponding first service call topologies according to the one or more service call chains, where each first service call topology is aggregated by one or more service call chains. For example, the obtained log information of each service node records the topology sequence called each time, for example, the first called service node a is a service node a0, the service node D that must be called first to complete the call of the service node a is 0.1, the service node B that needs to be called after calling the service node D is 0.2, and the service node C that must be called first to call the service node B is 0.2.1, so that the topology information of the node in a call, for example, A0D0.1B0.2C0.2.1, can be recorded according to the log information. And then according to the topology information in each service call chain, aggregating the topology information of the service call chains with the same service node topology information to generate the first service call topology, so that the first service call topology represents a type of the service call chain, and the service node call sequence and the topology relationship of the service call chain are the same.
It should be understood by those skilled in the art that the above-mentioned method for annotating service call chain topological relationships is only an example, and other existing or future methods for annotating service call chain topological relationships, such as those applicable to the present application, are also included in the scope of the present application and are hereby incorporated by reference.
Next, the device 1 presents at least one of the one or more first service invocation topologies in step S3. That is, the topological relationship between the service nodes in the first service invocation topology is expressed by a graph or other perceptible and visual manners, for example, the branch 1 shown in fig. 7 is a first service invocation topology, wherein a point in a tree-like graph in a square frame is a service node, so that the invocation relationship between the service nodes in the service invocation and the relationship between the service nodes are clearly and intuitively expressed, thereby facilitating development and data analysis.
It will be understood by those skilled in the art that the above-described manner of presenting a service invocation topology is by way of example only, and that other existing or future manners of presenting a service invocation topology, as applicable to the present application, are also intended to be encompassed within the scope of the present application and are hereby incorporated by reference.
Preferably, the method further comprises, in step S6 (not shown), device 1 performing a cleaning operation on the service call chain in step S6. Wherein, the cleaning operation is to filter out unimportant call object information. For example, two service calls with the same service link topology are all called by a service node C, wherein one service node C additionally queries some information during calling, for example, the cache C1 is queried in the 1 st service call link, the database C2 is queried once after the cache C1 is not obtained, the data is put into the cache C3, and the cache C1 is directly queried in the 2 nd service call link to be obtained. In this case, the two different links, i.e. C also calls the nodes C1, C2, and C3, may be the case before the flush operation, because the nodes that are queried usually go through one system after error and do not feed back the execution result, and the call result is usually fed back to the node C, so the flush operation can be ignored. Besides, nodes queried by the middleware route and the like can be cleaned without influencing the model.
It will be understood by those skilled in the art that the above-described manner of invoking a chain of cleaning services is merely exemplary, and that other existing or future manners of invoking a chain of cleaning services, as applicable to the present application, are intended to be encompassed within the scope of the present application and are hereby incorporated by reference.
In step S2, the device 1 generates one or more first service call topologies according to the one or more washed service call chains, where each first service call topology is aggregated by one or more service call chains. The service call chains with the same service call topology after the flushing operation are aggregated according to the log information or other available information containing the node call time sequence, so as to generate a first service call topology representing the service call chains with the same service call topology, specifically in the same manner as the method described above.
More preferably, the cleaning operation comprises at least any one of:
and deleting the predetermined service node in the service calling topology, namely filtering the called calling node such as the middleware service node routing query and the like.
And deleting the service node which does not feed back the calling result information in the service calling topology, namely filtering the called service calling result which is carried out in the system and has no execution result feedback, such as inquiring and calling a cache, calling a database and the like.
Fig. 2 shows a flow diagram of a method for presenting service invocation information according to another preferred embodiment of the present application. Including step S1, step S2, step S4, and step S3.
In step S1, the device 1 acquires one or more service call chains in the distributed service system, where each service call chain includes one or more service nodes that are called sequentially; in step S2, the device 1 generates one or more corresponding first service invocation topologies according to the one or more service invocation chains, where each first service invocation topology is aggregated by one or more service invocation chains; in step S4, the device 1 performs an aggregation process on at least two associated first service invocation topologies in the one or more first service invocation topologies to obtain corresponding one or more second service invocation topologies; device 1 presents at least one of the one or more second service invocation topologies in step S3.
Here, steps S1 and S2 in fig. 2 are the same as or similar to steps S1 and S2 in fig. 1, and are not repeated herein.
Specifically, in step S4, the device 1 performs an aggregation process on at least two associated first service invocation topologies in the one or more first service invocation topologies to obtain corresponding one or more second service invocation topologies. That is, the same ingress service nodes in the multiple first service invocation topologies are merged, starting from the ingress service nodes, the same service nodes at the same level are merged according to a certain merging rule, for example, after the ingress service nodes aggregate a plurality of service invocation topologies, other service invocation topologies are sequentially merged onto the first service invocation topology, the service invocation topologies which are recursively merged during merging are only merged for child service nodes having the same parent service node, when the merged service invocation topology service nodes have no mergeable nodes, the merged service invocation topology service nodes are directly hung on the parent service nodes of the merging tree, because the merged service invocation topologies have the same entry, certain identical parent service nodes can be hung, wherein the parent service nodes are the superior service nodes of the child service nodes, that is, the child service nodes are behind the parent service nodes from the invocation time, thereby obtaining a larger service call link and its topology relation, i.e. a second service call topology.
It should be understood by those skilled in the art that the above-mentioned merge rule for generating the second service invocation topology is only an example, and other existing or future merge rules for generating the second service invocation topology, as applicable to the present application, are also included in the scope of the present application and are hereby incorporated by reference.
Preferably, the associated at least two of the first service invocation topologies meet at least any of:
the at least two first service invocation topologies start from the same service node, i.e. invocation topologies with the same ingress service node, such as two invocation topologies, "ABC" is the invocation order of one topology and "ADE" is the invocation order of the other topology, both starting from the same service node "a".
The originating service node of one of the at least two first service invocation topologies is contained in the other of the at least two first service invocation topologies, e.g., as two invocation topologies, "ABC" is the invocation order of one topology and "GAH" is the invocation order of the other topology, where the "a" service node is the originating service node of the former and the latter contains the originating node of the former.
More preferably, in step S4, the device 1 performs an aggregation process on at least two associated first service invocation topologies in the one or more first service invocation topologies to obtain corresponding one or more second service invocation topologies, where the aggregation process satisfies the invocation order of the service nodes in the at least two first service invocation topologies. For example, the service nodes are aggregated according to the calling order to ensure that the calling order of the calling topology at the merging front end is consistent with the calling order, for example, recursively merged service calling topologies during merging are only merged for child service nodes having the same parent service node, and the merged service calling topology service nodes are directly hung on the parent service node of the merging tree when there is no node that can be merged, because the merged service calling topology entries are the same, the same parent service node can be hung, wherein the parent service node is an upper service node of the child service node, that is, the child service node is connected behind the parent service node from the calling time, thereby ensuring that the aggregation meets the calling order of the service nodes in the at least two first service calling topologies.
Next, device 1 presents at least one of the one or more second service invocation topologies in step S3. The topological relation between the service nodes in the second service invocation topology is expressed through a chart or other sensible visualization mode, for example, all tree-shaped graphs in the graph shown in fig. 7 are a second service invocation topology, a point in the tree-shaped graph in the square frame is a service node, and during specific presentation, selection and differential display can be performed according to name information corresponding to the service invocation topology in each node, for example, a label is added to each node in the service invocation topology to add different differential labels to adjacent nodes, adjacent invocation relations and adjacent branches, so that the label information is read during display, and an object needing differential display is obtained. Therefore, the relation between service nodes in the service call and various service call chains can be clearly and intuitively displayed, and development and data analysis are facilitated.
It will be understood by those skilled in the art that the above-described manner of presenting a service invocation topology is by way of example only, and that other existing or future manners of presenting a service invocation topology, as applicable to the present application, are also intended to be encompassed within the scope of the present application and are hereby incorporated by reference.
Preferably, in step S3, the device 1 presents at least one of the one or more second service invocation topologies and one or more first service invocation topologies corresponding to the presented second service invocation topology. That is, as shown in fig. 7, the tree diagram is displayed, and each calling topology is labeled, so that not only can the global second service calling topology be observed and analyzed, but also the name of each calling topology can be clicked to observe and analyze the first service calling topology, and thus, data analysis and development can be performed in a targeted manner.
It will be understood by those skilled in the art that the above-described manner of presenting a service invocation topology is by way of example only, and that other existing or future manners of presenting a service invocation topology, as applicable to the present application, are also intended to be encompassed within the scope of the present application and are hereby incorporated by reference.
Fig. 3 shows a flow chart of a method for presenting service invocation information according to yet another preferred embodiment of the present application. Including step S1, step S2, step S4, step S5, and step S3.
In step S1, the device 1 acquires one or more service call chains in the distributed service system, where each service call chain includes one or more service nodes that are called sequentially; in step S2, the device 1 generates one or more corresponding first service invocation topologies according to the one or more service invocation chains, where each first service invocation topology is aggregated by one or more service invocation chains; in step S4, the device 1 performs an aggregation process on at least two associated first service invocation topologies in the one or more first service invocation topologies to obtain corresponding one or more second service invocation topologies; in step S5, the device 1 obtains a selection or viewing operation of the user for the call related information of at least one of the first service call topology or the second service call topology; in step S3, the device 1 distinguishes between presenting the call related information in the corresponding display window of at least one of the first service call topology or the second service call topology.
Here, steps S1 and S2 in fig. 3 are the same as or similar to steps S1 and S2 in fig. 1, and step S4 in fig. 3 is the same as or similar to step S4 in fig. 2, and are not repeated herein.
Specifically, in step S5, the device 1 obtains a selection or viewing operation of the user for the call related information of at least one of the first service call topology or the second service call topology. The call related information refers to adjacent nodes, adjacent call relations, adjacent branches and the like. The method comprises the steps of giving an instruction through an input device to perform selection or viewing operation, for example, inputting names or other representative information of a first service call topology or a second service call topology, viewing service node information in the topology under the name or information in adjacent branches, for example, as shown in fig. 7, clicking the name of a branch 1 below to select and view a branch 1 of the first service call topology, wherein the clicking operation is the selection or viewing operation, and the name of the branch 1 and the associated display of a system after clicking a button to the service node in the branch 1 are the call related information.
It will be understood by those skilled in the art that the above-described selection or viewing operations are exemplary only, and other selection or viewing operations now or later that may occur, if applicable, are intended to be encompassed within the scope of the present application and are hereby incorporated by reference.
Preferably, the call related information includes at least any one of:
the one or more service nodes of at least one of the first service invocation topology or the second service invocation topology refer to the service nodes in the service invocation topology, for example, the dots in the topology shown in fig. 7, that are invocation related information representing the service nodes in the branches.
One or more service invocation relations of at least one of the first service invocation topology or the second service invocation topology, that is, the front-back and parallel sequential relations of the invocation in the topology, for example, the lines in the topology shown in fig. 7 represent the invocation relations of the service nodes in the branches by connecting the circles representing the service nodes at the two ends of the lines.
Next, in step S3, the device 1 distinguishes between presenting the call related information in the corresponding display window of at least one of the first service call topology or the second service call topology. The differentiated presentation means that the displayed service invocation topology is differentiated and displayed by using different colors, fonts or adding filling colors, for example, the branches required to be displayed in fig. 7 are differentiated and displayed by deepening the color of the line thereof and displaying the square frame in the display range of the viewed branch, so that the topology relationship of the service invocation is displayed more intuitively and clearly. During specific presentation, selection and differential display can be performed according to name information corresponding to branches in each node, for example, a label is added to each node in the service call topology to add different differential labels to adjacent nodes, adjacent call relations and adjacent branches, so that the label information is read during display, and objects needing differential display are obtained.
Preferably, in step S3, the device 1 distinguishes between presenting the call related information and the adjacent call information corresponding to the call related information in the display window corresponding to at least one of the first service call topology or the second service call topology. The adjacent calling information refers to that the same node is arranged with the displayed service calling topology, so that the service calling topology has a certain probability of calling or being associated with other adjacent service calling topologies or nodes when being developed or used, and the adjacent calling information is displayed in a distinguishing manner, so that the adjacent service nodes can be correspondingly processed and analyzed when being developed or positioned, and the developing, monitoring or problem positioning efficiency is improved.
FIG. 4 illustrates a schematic diagram of an apparatus for presenting service invocation information in accordance with another aspect of the subject application. The device 1 comprises service call chain obtaining means 11, first service call topology generating means 12 and service call presentation means 13.
The service call chain acquiring device 11 acquires one or more service call chains in the distributed service system, wherein each service call chain comprises one or more service nodes which are called sequentially; the first service call topology generating device 12 generates one or more corresponding first service call topologies according to the one or more service call chains, wherein each first service call topology is aggregated by one or more service call chains; the service invocation presenting means 13 presents at least one of said one or more first service invocation topologies.
Specifically, the service call chain acquiring means 11 acquires one or more service call chains in the distributed service system, wherein each service call chain includes one or more service nodes that are sequentially called. Herein, the distributed service system includes, but is not limited to, a service-oriented architecture or a software system built on a distributed system. The service node includes, but is not limited to, a service or a function for calling in the distributed service system, and for example, the service node when the product is consumed on the e-commerce platform includes calling a user name, calling a user-associated account, calling a payment page, obtaining security verification, checking account balance, and the like. The service call chain refers to service nodes and sequences thereof related to one service call completed in the distributed service system, acquires log information related to the service call chain and operation history information of the system, extracts the service nodes and information thereof related to the service called each time, acquires a process capable of clearly displaying the service call of the service call chain including the service nodes and the call sequences thereof related to the called service, and acquires the topology and the topology thereof of each service call.
It will be understood by those skilled in the art that the above-described manner of obtaining a service call chain is merely exemplary, and that other existing or future manners of obtaining a service call chain, as applicable to the present application, are also intended to be encompassed within the scope of the present application and are hereby incorporated by reference.
Next, the first service invocation topology generating device 12 generates one or more corresponding first service invocation topologies according to the one or more service invocation chains, wherein each first service invocation topology is aggregated by one or more service invocation chains. For example, the obtained log information of each service node records the topology sequence called each time, for example, the first called service node a is a service node a0, the service node D that must be called first to complete the call of the service node a is 0.1, the service node B that needs to be called after calling the service node D is 0.2, and the service node C that must be called first to call the service node B is 0.2.1, so that the topology information of the node in a call, for example, A0D0.1B0.2C0.2.1, can be recorded according to the log information. And then according to the topology information in each service call chain, aggregating the topology information of the service call chains with the same service node topology information to generate the first service call topology, so that the first service call topology represents a type of the service call chain, and the service node call sequence and the topology relationship of the service call chain are the same.
It should be understood by those skilled in the art that the above-mentioned method for annotating service call chain topological relationships is only an example, and other existing or future methods for annotating service call chain topological relationships, such as those applicable to the present application, are also included in the scope of the present application and are hereby incorporated by reference.
Then, the service invocation presenting means 13 presents at least one of said one or more first service invocation topologies. That is, the topological relationship between the service nodes in the first service invocation topology is expressed by a graph or other perceptible and visual manners, for example, the branch 1 shown in fig. 7 is a first service invocation topology, wherein a point in a tree-like graph in a square frame is a service node, so that the invocation relationship between the service nodes in the service invocation and the relationship between the service nodes are clearly and intuitively expressed, thereby facilitating development and data analysis.
It will be understood by those skilled in the art that the above-described manner of presenting a service invocation topology is by way of example only, and that other existing or future manners of presenting a service invocation topology, as applicable to the present application, are also intended to be encompassed within the scope of the present application and are hereby incorporated by reference.
Preferably, the device 1 further comprises: a cleansing means 16 (not shown), said cleansing means 16 performing cleansing operations on said service call chain. Wherein, the cleaning operation is to filter out unimportant call object information. For example, two service calls with the same service link topology are all called by a service node C, wherein one service node C additionally queries some information during calling, for example, the cache C1 is queried in the 1 st service call link, the database C2 is queried once after the cache C1 is not obtained, the data is put into the cache C3, and the cache C1 is directly queried in the 2 nd service call link to be obtained. In this case, the two different links, i.e. C also calls the nodes C1, C2, and C3, may be the case before the flush operation, because the nodes that are queried usually go through one system after error and do not feed back the execution result, and the call result is usually fed back to the node C, so the flush operation can be ignored. Besides, nodes queried by the middleware route and the like can be cleaned without influencing the model.
It will be understood by those skilled in the art that the above-described manner of invoking a chain of cleaning services is merely exemplary, and that other existing or future manners of invoking a chain of cleaning services, as applicable to the present application, are intended to be encompassed within the scope of the present application and are hereby incorporated by reference.
The first service invocation topology generating device 12 generates one or more corresponding first service invocation topologies according to the one or more washed service invocation chains, where each first service invocation topology is aggregated by one or more service invocation chains. The service call chains with the same service call topology after the flushing operation are aggregated according to the log information or other available information containing the node call time sequence, so as to generate a first service call topology representing the service call chains with the same service call topology, specifically in the same manner as the method described above.
More preferably, the cleaning operation comprises at least any one of:
and deleting the predetermined service nodes in the service calling topology, namely filtering and deleting the called calling nodes such as the middleware service node routing query.
And deleting the service nodes which do not feed back the calling result information in the service calling topology, namely filtering and deleting the called service calling results which are processed in the system and have no execution result feedback, such as querying and calling a cache, calling a database and the like.
Fig. 5 shows a schematic diagram of a device for presenting service invocation information according to another preferred embodiment of the present application. The device 1 comprises service invocation chain obtaining means 21, first service invocation topology generating means 22, second service invocation topology generating means 24 and service invocation rendering means 23.
The service call chain acquiring device 21 acquires one or more service call chains in the distributed service system, wherein each service call chain comprises one or more service nodes which are called sequentially; the first service call topology generating device 22 generates one or more corresponding first service call topologies according to the one or more service call chains, wherein each first service call topology is aggregated by one or more service call chains; the second service invocation topology generating device 24 performs aggregation processing on at least two associated first service invocation topologies in the one or more first service invocation topologies to obtain corresponding one or more second service invocation topologies; the service invocation presenting means 23 presents at least one of said one or more second service invocation topologies.
Here, the service invocation chain obtaining device 21 and the first service invocation topology generating device 22 in fig. 5 are the same as or similar to the service invocation chain obtaining device 11 and the first service invocation topology generating device 12 in fig. 4, and are not described again here.
Specifically, the second service invocation topology generating device 24 performs aggregation processing on at least two associated first service invocation topologies in the one or more first service invocation topologies to obtain corresponding one or more second service invocation topologies. That is, the same ingress service nodes in the multiple first service invocation topologies are merged, starting from the ingress service nodes, the same service nodes at the same level are merged according to a certain merging rule, for example, after the ingress service nodes aggregate a plurality of service invocation topologies, other service invocation topologies are sequentially merged onto the first service invocation topology, the service invocation topologies which are recursively merged during merging are only merged for child service nodes having the same parent service node, when the merged service invocation topology service nodes have no mergeable nodes, the merged service invocation topology service nodes are directly hung on the parent service nodes of the merging tree, because the merged service invocation topologies have the same entry, certain identical parent service nodes can be hung, wherein the parent service nodes are the superior service nodes of the child service nodes, that is, the child service nodes are behind the parent service nodes from the invocation time, thereby obtaining a larger service call link and its topology relation, i.e. a second service call topology.
It should be understood by those skilled in the art that the above-mentioned merge rule for generating the second service invocation topology is only an example, and other existing or future merge rules for generating the second service invocation topology, as applicable to the present application, are also included in the scope of the present application and are hereby incorporated by reference.
Preferably, the associated at least two of the first service invocation topologies meet at least any of:
the at least two first service invocation topologies start from the same service node, i.e. invocation topologies with the same ingress service node, such as two invocation topologies, "ABC" is the invocation order of one topology and "ADE" is the invocation order of the other topology, both starting from the same service node "a".
The originating service node of one of the at least two first service invocation topologies is contained in the other of the at least two first service invocation topologies, e.g., as two invocation topologies, "ABC" is the invocation order of one topology and "GAH" is the invocation order of the other topology, where the "a" service node is the originating service node of the former and the latter contains the originating node of the former.
More preferably, the second service invocation topology generating device 24 performs an aggregation process on at least two associated first service invocation topologies in the one or more first service invocation topologies to obtain corresponding one or more second service invocation topologies, where the aggregation process satisfies the invocation order of the service nodes in the at least two first service invocation topologies. For example, the service nodes are aggregated according to the calling order to ensure that the calling order of the calling topology at the merging front end is consistent with the calling order, for example, recursively merged service calling topologies during merging are only merged for child service nodes having the same parent service node, and the merged service calling topology service nodes are directly hung on the parent service node of the merging tree when there is no node that can be merged, because the merged service calling topology entries are the same, the same parent service node can be hung, wherein the parent service node is an upper service node of the child service node, that is, the child service node is connected behind the parent service node from the calling time, thereby ensuring that the aggregation meets the calling order of the service nodes in the at least two first service calling topologies.
Then, the service invocation presenting means 23 presents at least one of said one or more second service invocation topologies. The topological relation between the service nodes in the second service invocation topology is expressed through a chart or other sensible visualization mode, for example, all tree-shaped graphs in the graph shown in fig. 7 are a second service invocation topology, a point in the tree-shaped graph in the square frame is a service node, and during specific presentation, selection and differential display can be performed according to name information corresponding to the service invocation topology in each node, for example, a label is added to each node in the service invocation topology to add different differential labels to adjacent nodes, adjacent invocation relations and adjacent branches, so that the label information is read during display, and an object needing differential display is obtained. Therefore, the relation between service nodes in the service call and various service call chains can be clearly and intuitively displayed, and development and data analysis are facilitated.
It will be understood by those skilled in the art that the above-described manner of presenting a service invocation topology is by way of example only, and that other existing or future manners of presenting a service invocation topology, as applicable to the present application, are also intended to be encompassed within the scope of the present application and are hereby incorporated by reference.
Preferably, the service invocation presenting device 23 presents at least one of the one or more second service invocation topologies and one or more first service invocation topologies corresponding to the presented second service invocation topology. That is, as shown in fig. 7, the tree diagram is displayed, and each calling topology is labeled, so that not only can the global second service calling topology be observed and analyzed, but also the name of each calling topology can be clicked to observe and analyze the first service calling topology, and thus, data analysis and development can be performed in a targeted manner.
It will be understood by those skilled in the art that the above-described manner of presenting a service invocation topology is by way of example only, and that other existing or future manners of presenting a service invocation topology, as applicable to the present application, are also intended to be encompassed within the scope of the present application and are hereby incorporated by reference.
Fig. 6 shows a schematic diagram of a device for presenting service invocation information according to yet another preferred example of the present application. The device 1 comprises that the device 1 comprises service invocation chain obtaining means 31, first service invocation topology generating means 32, second service invocation topology generating means 34, service invocation topology operation obtaining means 35 and service invocation topology presenting means 33.
The service call chain acquiring device 31 acquires one or more service call chains in the distributed service system, wherein each service call chain comprises one or more service nodes which are called sequentially; the first service call topology generating device 32 generates one or more corresponding first service call topologies according to the one or more service call chains, wherein each first service call topology is aggregated by one or more service call chains; the second service invocation topology generating device 34 performs aggregation processing on at least two associated first service invocation topologies in the one or more first service invocation topologies to obtain corresponding one or more second service invocation topologies; the service invocation topology operation obtaining device 35 obtains a selection or viewing operation of the user for the invocation related information of at least one of the first service invocation topology or the second service invocation topology; the service invocation topology presenting means 33 presents the invocation related information differently in a display window corresponding to at least one of the first service invocation topology or the second service invocation topology.
Here, the service invocation chain obtaining device 31 and the first service invocation topology generating device 32 in fig. 6 are the same as or similar to the service invocation chain obtaining device 11 and the first service invocation topology generating device 12 in fig. 4, and the second service invocation topology generating device 34 in fig. 6 is the same as or similar to the second service invocation topology generating device 24 in fig. 5, and are not described again here.
Specifically, the service invocation topology operation obtaining means 35 obtains a selection or viewing operation of the user for invocation related information of at least one of the first service invocation topology or the second service invocation topology. The call related information refers to adjacent nodes, adjacent call relations, adjacent branches and the like. The method comprises the steps of giving an instruction through an input device to perform selection or viewing operation, for example, inputting names or other representative information of a first service call topology or a second service call topology, viewing service node information in the topology under the name or information in adjacent branches, for example, as shown in fig. 7, clicking the name of a branch 1 below to select and view a branch 1 of the first service call topology, wherein the clicking operation is the selection or viewing operation, and the name of the branch 1 and the associated display of a system after clicking a button to the service node in the branch 1 are the call related information.
It will be understood by those skilled in the art that the above-described selection or viewing operations are exemplary only, and other selection or viewing operations now or later that may occur, if applicable, are intended to be encompassed within the scope of the present application and are hereby incorporated by reference.
Preferably, the call related information includes at least any one of:
the one or more service nodes of at least one of the first service invocation topology or the second service invocation topology refer to the service nodes in the service invocation topology, for example, the dots in the topology shown in fig. 7, that are invocation related information representing the service nodes in the branches.
One or more service invocation relations of at least one of the first service invocation topology or the second service invocation topology, that is, the front-back and parallel sequential relations of the invocation in the topology, for example, the lines in the topology shown in fig. 7 represent the invocation relations of the service nodes in the branches by connecting the circles representing the service nodes at the two ends of the lines.
Then, the service invocation topology presenting means 33 distinguishes presenting the invocation related information in a corresponding display window of at least one of the first service invocation topology or the second service invocation topology. The differentiated presentation means that the displayed service invocation topology is differentiated and displayed by using different colors, fonts or adding filling colors, for example, the branches required to be displayed in fig. 7 are differentiated and displayed by deepening the color of the line thereof and displaying the square frame in the display range of the viewed branch, so that the topology relationship of the service invocation is displayed more intuitively and clearly. During specific presentation, selection and differential display can be performed according to name information corresponding to branches in each node, for example, a label is added to each node in the service call topology to add different differential labels to adjacent nodes, adjacent call relations and adjacent branches, so that the label information is read during display, and objects needing differential display are obtained.
Preferably, the service invocation topology presenting device 33 distinguishes between presenting the invocation related information and the adjacent invocation information corresponding to the invocation related information in a display window corresponding to at least one of the first service invocation topology or the second service invocation topology. The adjacent calling information refers to that the same node is arranged with the displayed service calling topology, so that the service calling topology has a certain probability of calling or being associated with other adjacent service calling topologies or nodes when being developed or used, and the adjacent calling information is displayed in a distinguishing manner, so that the adjacent service nodes can be correspondingly processed and analyzed when being developed or positioned, and the developing, monitoring or problem positioning efficiency is improved.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.
It should be noted that the present application may be implemented in software and/or a combination of software and hardware, for example, implemented using Application Specific Integrated Circuits (ASICs), general purpose computers or any other similar hardware devices. In one embodiment, the software programs of the present application may be executed by a processor to implement the steps or functions described above. Likewise, the software programs (including associated data structures) of the present application may be stored in a computer readable recording medium, such as RAM memory, magnetic or optical drive or diskette and the like. Additionally, some of the steps or functions of the present application may be implemented in hardware, for example, as circuitry that cooperates with the processor to perform various steps or functions.
In addition, some of the present application may be implemented as a computer program product, such as computer program instructions, which when executed by a computer, may invoke or provide methods and/or techniques in accordance with the present application through the operation of the computer. Program instructions which invoke the methods of the present application may be stored on a fixed or removable recording medium and/or transmitted via a data stream on a broadcast or other signal-bearing medium and/or stored within a working memory of a computer device operating in accordance with the program instructions. An embodiment according to the present application comprises an apparatus comprising a memory for storing computer program instructions and a processor for executing the program instructions, wherein the computer program instructions, when executed by the processor, trigger the apparatus to perform a method and/or a solution according to the aforementioned embodiments of the present application.
It will be evident to those skilled in the art that the present application is not limited to the details of the foregoing illustrative embodiments, and that the present application may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the application being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned. Furthermore, it is obvious that the word "comprising" does not exclude other elements or steps, and the singular does not exclude the plural. A plurality of units or means recited in the apparatus claims may also be implemented by one unit or means in software or hardware. The terms first, second, etc. are used to denote names, but not any particular order.
Claims (16)
1. A method for presenting service invocation information, wherein the method comprises:
acquiring one or more service call chains in a distributed service system, wherein each service call chain comprises one or more service nodes which are called sequentially;
generating one or more corresponding first service call topologies according to the one or more service call chains, wherein each first service call topology is aggregated by one or more service call chains;
presenting at least one of the one or more first service invocation topologies;
aggregating at least two associated first service invocation topologies in the one or more first service invocation topologies to obtain corresponding one or more second service invocation topologies;
wherein said presenting at least one of said one or more first service invocation topologies comprises:
presenting at least one of the one or more second service invocation topologies;
wherein the aggregating at least two associated first service invocation topologies of the one or more first service invocation topologies comprises:
and aggregating at least two associated first service call topologies in the one or more first service call topologies to obtain corresponding one or more second service call topologies, wherein the aggregation meets the call sequence of the service nodes in the at least two first service call topologies.
2. The method of claim 1, wherein the associated at least two of the first service invocation topologies meet at least any of:
the at least two first service invocation topologies start at the same service node;
an originating service node of one of the at least two first service invocation topologies is included in another of the at least two first service invocation topologies.
3. The method of claim 1, wherein said presenting at least one of the one or more first service invocation topologies comprises:
presenting at least one of the one or more second service invocation topologies and one or more of the first service invocation topologies corresponding to the presented second service invocation topology.
4. The method of claim 1, wherein the method further comprises:
executing a cleaning operation on the service call chain;
wherein the generating of the corresponding one or more first service invocation topologies according to the one or more service invocation chains comprises:
and generating one or more corresponding first service call topologies according to the one or more washed service call chains, wherein each first service call topology is obtained by aggregating one or more service call chains.
5. The method of claim 4, wherein the cleaning operation comprises at least any one of:
deleting a predetermined service node in the service invocation chain;
and deleting the service nodes which do not feed back the calling result information in the service calling chain.
6. The method of any of claims 1-5, wherein the method further comprises:
acquiring selection or viewing operation of a user for invoking related information in at least one of the first service invocation topology or the second service invocation topology;
and displaying the calling related information in a display window corresponding to at least one of the first service calling topology and the second service calling topology in a distinguishing manner.
7. The method of claim 6, wherein the call related information comprises at least any one of:
one or more service nodes in at least one of the first service invocation topology or the second service invocation topology;
one or more service invocation relationships in at least one of the first service invocation topology or the second service invocation topology.
8. The method of claim 7, wherein said distinguishing presentation of said invocation-related information in a corresponding display window of at least one of said first service invocation topology or said second service invocation topology comprises:
and displaying the calling related information and the adjacent calling information corresponding to the calling related information in a display window corresponding to at least one of the first service calling topology and the second service calling topology in a distinguishing manner.
9. An apparatus for presenting service invocation information, wherein the apparatus comprises:
the service calling chain acquiring device is used for acquiring one or more service calling chains in the distributed service system, wherein each service calling chain comprises one or more service nodes which are called sequentially;
a first service call topology generating device, configured to generate one or more corresponding first service call topologies according to the one or more service call chains, where each first service call topology is aggregated by one or more service call chains;
service invocation presenting means for presenting at least one of said one or more first service invocation topologies;
a second service invocation topology generation device, configured to perform aggregation processing on at least two associated first service invocation topologies in the one or more first service invocation topologies to obtain corresponding one or more second service invocation topologies;
wherein the service call presentation means is for:
presenting at least one of the one or more second service invocation topologies;
wherein the second service invocation topology generating device is further configured to:
and aggregating at least two associated first service call topologies in the one or more first service call topologies to obtain corresponding one or more second service call topologies, wherein the aggregation meets the call sequence of the service nodes in the at least two first service call topologies.
10. The apparatus of claim 9, wherein the associated at least two of the first service invocation topologies satisfy at least any of:
the at least two first service invocation topologies start at the same service node;
an originating service node of one of the at least two first service invocation topologies is included in another of the at least two first service invocation topologies.
11. The apparatus of claim 9, wherein the service call presentation device is to:
presenting at least one of the one or more second service invocation topologies and one or more of the first service invocation topologies corresponding to the presented second service invocation topology.
12. The apparatus of claim 11, wherein the apparatus further comprises:
the cleaning device is used for executing cleaning operation on the service calling chain;
wherein the first service invocation topology generating device is configured to:
and generating one or more corresponding first service call topologies according to the one or more washed service call chains, wherein each first service call topology is obtained by aggregating one or more service call chains.
13. The apparatus of claim 12, wherein the cleaning operation comprises at least any one of:
deleting a predetermined service node in the service invocation chain;
and deleting the service nodes which do not feed back the calling result information in the service calling chain.
14. The apparatus of any of claims 9 to 13, wherein the apparatus further comprises:
the service calling topology operation acquisition device is used for acquiring selection or viewing operation of a user on calling related information of at least one of the first service calling topology or the second service calling topology;
and the service calling topology presenting device is used for distinguishing and presenting the calling related information in at least one corresponding display window in the first service calling topology or the second service calling topology.
15. The device of claim 14, wherein the call related information comprises at least any one of:
one or more service nodes of at least one of the first service invocation topology or the second service invocation topology;
one or more service invocation relationships of at least one of the first service invocation topology or the second service invocation topology.
16. The apparatus of claim 15, wherein the service invocation topology rendering device is to:
and displaying the calling related information and the adjacent calling information corresponding to the calling related information in a display window corresponding to at least one of the first service calling topology and the second service calling topology in a distinguishing manner.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510734355.8A CN106657192B (en) | 2015-11-03 | 2015-11-03 | Method and equipment for presenting service calling information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510734355.8A CN106657192B (en) | 2015-11-03 | 2015-11-03 | Method and equipment for presenting service calling information |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106657192A CN106657192A (en) | 2017-05-10 |
| CN106657192B true CN106657192B (en) | 2020-06-30 |
Family
ID=58810912
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510734355.8A Active CN106657192B (en) | 2015-11-03 | 2015-11-03 | Method and equipment for presenting service calling information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106657192B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107656999B (en) * | 2017-09-20 | 2020-06-30 | 携程旅游信息技术（上海）有限公司 | Call history tracing method and device, electronic equipment and storage medium |
| CN110147309A (en) * | 2018-02-11 | 2019-08-20 | 北京京东尚科信息技术有限公司 | Information generating method and device |
| CN109254901B (en) * | 2018-09-30 | 2019-11-29 | 北京九章云极科技有限公司 | A kind of Monitoring Indexes method and system |
| CN111259275B (en) * | 2018-12-03 | 2023-12-15 | 阿里巴巴集团控股有限公司 | Data tracking method, device and storage medium |
| CN110417574B (en) * | 2019-05-21 | 2022-01-07 | 腾讯科技（深圳）有限公司 | Topology analysis method and device and storage medium |
| CN110717032A (en) * | 2019-08-26 | 2020-01-21 | 四川新网银行股份有限公司 | Method for generating and displaying multi-system method call link diagram |
| CN110674284A (en) * | 2019-08-26 | 2020-01-10 | 四川新网银行股份有限公司 | Method for generating multi-system method call link diagram |
| CN112783720B (en) * | 2021-01-05 | 2023-05-19 | 广州品唯软件有限公司 | Topology structure diagram generation method, device, computer equipment and display system |
| CN113869989B (en) * | 2021-12-01 | 2022-05-06 | 阿里云计算有限公司 | Information processing method and device |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101491061A (en) * | 2006-07-12 | 2009-07-22 | 惠普开发有限公司 | Method of providing services in a network and network element |
| CN101562633A (en) * | 2009-05-27 | 2009-10-21 | 天津大学 | Visual service network user interactive system |
| CN101593135A (en) * | 2008-05-29 | 2009-12-02 | 国际商业机器公司 | In distributed integrated environment, focus on the apparatus and method of business process failure |
| CN102413114A (en) * | 2011-08-12 | 2012-04-11 | 华南理工大学 | Combining-oriented semantic web service discovery method |
| CN102594851A (en) * | 2011-01-07 | 2012-07-18 | 中国科学院遥感应用研究所 | Method for dynamically building marine application service chain |
| CN104022951A (en) * | 2014-06-18 | 2014-09-03 | 中国人民解放军信息工程大学 | Building method and system for network service path |
| CN104202427A (en) * | 2014-09-24 | 2014-12-10 | 国家电网公司 | Service calling method and system among distributive nodes |
| CN104780099A (en) * | 2014-01-10 | 2015-07-15 | 瞻博网络公司 | Dynamic end-to-end network path setup across multiple network layers with network service chaining |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070027974A1 (en) * | 2005-08-01 | 2007-02-01 | Microsoft Corporation | Online service monitoring |
| US9444675B2 (en) * | 2013-06-07 | 2016-09-13 | Cisco Technology, Inc. | Determining the operations performed along a service path/service chain |
-
2015
- 2015-11-03 CN CN201510734355.8A patent/CN106657192B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101491061A (en) * | 2006-07-12 | 2009-07-22 | 惠普开发有限公司 | Method of providing services in a network and network element |
| CN101593135A (en) * | 2008-05-29 | 2009-12-02 | 国际商业机器公司 | In distributed integrated environment, focus on the apparatus and method of business process failure |
| CN101562633A (en) * | 2009-05-27 | 2009-10-21 | 天津大学 | Visual service network user interactive system |
| CN102594851A (en) * | 2011-01-07 | 2012-07-18 | 中国科学院遥感应用研究所 | Method for dynamically building marine application service chain |
| CN102413114A (en) * | 2011-08-12 | 2012-04-11 | 华南理工大学 | Combining-oriented semantic web service discovery method |
| CN104780099A (en) * | 2014-01-10 | 2015-07-15 | 瞻博网络公司 | Dynamic end-to-end network path setup across multiple network layers with network service chaining |
| CN104022951A (en) * | 2014-06-18 | 2014-09-03 | 中国人民解放军信息工程大学 | Building method and system for network service path |
| CN104202427A (en) * | 2014-09-24 | 2014-12-10 | 国家电网公司 | Service calling method and system among distributive nodes |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106657192A (en) | 2017-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106657192B (en) | Method and equipment for presenting service calling information | |
| CN110928772B (en) | Test method and device | |
| KR102146173B1 (en) | Service call information processing method and device | |
| US11966426B2 (en) | Non-tabular datasource connector | |
| US11232125B1 (en) | Conversion of cloud computing platform data for ingestion by data intake and query system | |
| US11782987B1 (en) | Using an augmented process model to track process instances | |
| US10997190B2 (en) | Context-adaptive selection options in a modular visualization framework | |
| US11651012B1 (en) | Coding commands using syntax templates | |
| CN107665228B (en) | Associated information query method, terminal and equipment | |
| US20230104928A1 (en) | Executable network troubleshooting procedure | |
| US20140067836A1 (en) | Visualizing reporting data using system models | |
| US8250479B2 (en) | Message flow interactions for display in a user interface | |
| CN113987074A (en) | Distributed service full-link monitoring method and device, electronic equipment and storage medium | |
| CN110263070A (en) | Event report method and device | |
| CN110633959A (en) | Method, device, equipment and medium for creating approval task based on graph structure | |
| CN108628648B (en) | Data processing method and data processing device | |
| US8327292B2 (en) | Distinct groupings of related objects for display in a user interface | |
| CN109032937B (en) | Data selection method and system based on webpage | |
| CN115630201A (en) | Method and device for analyzing association relation of system components | |
| Kritikos et al. | Towards semantic KPI measurement | |
| CN117130946B (en) | Test scene generation method and device, electronic equipment and readable storage medium | |
| Goulão et al. | Streamlining scenario modeling with model-driven development: A case study | |
| CN113885853A (en) | Operation method, device and equipment of business analysis model | |
| CN117311673A (en) | Data processing system, method, equipment and computer readable storage medium | |
| CN117668023A (en) | Data display method and device, electronic equipment and computer storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200924 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Patentee after: Innovative advanced technology Co.,Ltd. Address before: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Patentee before: Advanced innovation technology Co.,Ltd. Effective date of registration: 20200924 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Patentee after: Advanced innovation technology Co.,Ltd. Address before: A four-storey 847 mailbox in Grand Cayman Capital Building, British Cayman Islands Patentee before: Alibaba Group Holding Ltd. |
|
| TR01 | Transfer of patent right |