WO2017076188A1 - 一种用于处理服务调用信息的方法与设备 - Google Patents
一种用于处理服务调用信息的方法与设备 Download PDFInfo
- Publication number
- WO2017076188A1 WO2017076188A1 PCT/CN2016/103173 CN2016103173W WO2017076188A1 WO 2017076188 A1 WO2017076188 A1 WO 2017076188A1 CN 2016103173 W CN2016103173 W CN 2016103173W WO 2017076188 A1 WO2017076188 A1 WO 2017076188A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- service
- call
- service call
- topology
- node
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 68
- 238000012545 processing Methods 0.000 title claims abstract description 61
- 238000012544 monitoring process Methods 0.000 claims abstract description 30
- 238000004458 analytical method Methods 0.000 claims abstract description 29
- 238000004140 cleaning Methods 0.000 claims description 24
- 230000008569 process Effects 0.000 claims description 21
- 230000002776 aggregation Effects 0.000 claims description 14
- 238000004220 aggregation Methods 0.000 claims description 14
- 230000004931 aggregating effect Effects 0.000 claims 2
- 108010001267 Protein Subunits Proteins 0.000 claims 1
- 230000015654 memory Effects 0.000 description 15
- 238000010586 diagram Methods 0.000 description 13
- 238000007405 data analysis Methods 0.000 description 8
- 230000002354 daily effect Effects 0.000 description 6
- 238000002372 labelling Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 238000004590 computer program Methods 0.000 description 4
- 239000000284 extract Substances 0.000 description 4
- 230000002159 abnormal effect Effects 0.000 description 3
- 230000001186 cumulative effect Effects 0.000 description 3
- 238000001914 filtration Methods 0.000 description 3
- 101001024616 Homo sapiens Neuroblastoma breakpoint family member 9 Proteins 0.000 description 2
- 102100037013 Neuroblastoma breakpoint family member 9 Human genes 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003203 everyday effect Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000002085 persistent effect Effects 0.000 description 2
- KDYFGRWQOYBRFD-UHFFFAOYSA-N succinic acid Chemical compound OC(=O)CCC(O)=O KDYFGRWQOYBRFD-UHFFFAOYSA-N 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000003936 working memory Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
- H04L41/5054—Automatic deployment of services triggered by the service manager, e.g. service implementation by automatic configuration of network components
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0793—Remedial or corrective actions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0677—Localisation of faults
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0706—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment
- G06F11/0709—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment in a distributed system consisting of a plurality of standalone computer nodes, e.g. clusters, client-server systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3003—Monitoring arrangements specially adapted to the computing system or computing system component being monitored
- G06F11/3006—Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system is distributed, e.g. networked systems, clusters, multiprocessor systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
- G06F11/3409—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment for performance assessment
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0631—Management of faults, events, alarms or notifications using root cause analysis; using analysis of correlation between notifications, alarms or events based on decision criteria, e.g. hierarchy, tree or time analysis
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5003—Managing SLA; Interaction between SLA and QoS
- H04L41/5009—Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF]
- H04L41/5012—Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF] determining service availability, e.g. which services are available at a certain point in time
- H04L41/5016—Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF] determining service availability, e.g. which services are available at a certain point in time based on statistics of service availability, e.g. in percentage or over a given time
Definitions
- the present application relates to the field of computers, and in particular, to a technique for processing service call information.
- the method of locating the problem by using the log and tracking service calling path is cumbersome and time-consuming, and the time-of-time accuracy is low, and the monitoring service call is often unable to perform pre-circumvention and early warning of the problem after the problem occurs.
- An object of the present application is to provide a method and a device for processing service call information, which are used to solve the problem of the problem of running a service in a distributed system and the problem of monitoring and early warning of service operation.
- the present application provides a method for processing service call information, which solves the problem of location of a problem in a service operation in a distributed system and a problem of monitoring and warning of a service operation.
- Methods include:
- each service call chain includes one or more service nodes that are called sequentially;
- the service call chain is processed according to the service invocation model.
- the present application provides an apparatus for processing service call information, the apparatus It solves the problem of the problem of the running of the business in the distributed system and the monitoring and early warning of the business operation.
- the equipment includes:
- a service call chain obtaining means for acquiring 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;
- a service invocation model building device configured to construct a corresponding service invocation model according to the service invocation chain
- Processing means for processing the service call chain according to the service invocation model For processing the service call chain according to the service invocation model.
- the present application obtains a service call chain with service node call sequence information in a distributed service system, and constructs a service call chain with the same service node call sequence as a service call model, thereby based on the service call model. Analyze the call information of each service node and analyze the problem of normal monitoring and operation of the service call. The big data information of the service node is used for analysis and monitoring, which improves the problem location efficiency of the distributed service system and increases The reliability of the distributed service system.
- FIG. 1 shows a flow chart of a method for processing service call information in accordance with an aspect of the present application
- step S1 shows a flow chart of step S1 in a method for processing service call information according to another preferred embodiment of the present application
- step S3 shows a flow chart of step S3 in a method for processing service call information according to still another preferred embodiment of the present application
- step S32 shows a flow chart of step S32 in a method for processing service call information according to still another preferred embodiment of the present application
- FIG. 5 shows a schematic diagram of an apparatus for processing service call information according to another aspect of the present application
- FIG. 6 is a schematic diagram of a service call chain acquisition apparatus in an apparatus for processing service call information according to another preferred embodiment of the present application;
- FIG. 7 is a schematic diagram of a processing device in an apparatus for processing service call information according to still another preferred embodiment of the present application.
- FIG. 8 is a schematic diagram of a monitoring unit in an apparatus for processing service call information according to still another preferred embodiment of the present application.
- Figure 9 shows a schematic diagram of a service call in accordance with yet another preferred embodiment of the present application.
- the terminal, the device of the service network, and the trusted party each include one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
- processors CPUs
- input/output interfaces network interfaces
- memory volatile and non-volatile memory
- the memory may include non-persistent memory, random access memory (RAM), and/or non-volatile memory in a computer readable medium, such as read only memory (ROM) or flash memory.
- RAM random access memory
- ROM read only memory
- Memory is an example of a computer readable medium.
- Computer readable media includes both permanent and non-persistent, removable and non-removable media.
- Information storage can be implemented by any method or technology.
- the information can be computer readable instructions, data structures, modules of programs, 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 disk read only memory (CD-ROM), digital versatile disk (DVD) or other optical storage,
- computer readable media does not include non-transitory computer readable media, such as modulated data signals and carrier waves.
- Step S1 shows a flow chart of a method for processing service invocation information in accordance with an aspect of the present application. Step S1, step S2, and step S3 are included.
- step S1 the device 1 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; in step S2, the device 1 according to the The service call chain constructs a corresponding service invocation model; in step S3, the device 1 processes the service invocation chain according to the service invocation model.
- the device 1 acquires one or more service call chains in the distributed service system in step S1, wherein each service call chain includes one or more service nodes that are called in sequence.
- 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, such as a service node when the e-commerce platform performs product consumption, including calling a user name, calling a user association account, Get the payment page, get security verification, check account balance, and more.
- the service call chain refers to a service call completed in the distributed service system.
- the service nodes involved and their order for example, the service call diagram shown in FIG.
- A, B, C, and D indicated by circles refer to a service node.
- the entry of the indicated service call chain is service node A, and the completion of A needs to call B and then call C, and complete C needs to call D, so the service call node in the service call chain in the service call shown in FIG. 9 is There is a calling sequence, that is, the calling sequence of the service call chain shown is A ⁇ B ⁇ C ⁇ D, wherein, in order to facilitate the recognition of the computer language, the calling sequence of the service nodes in the service call chain shown in FIG. 9 can be based on the service.
- the called sequence of the node marks the order of the initial entry node as A0, and then the called B is marked as B0.1, that is, 0 represents the first "service node” after the A ".” number is followed by A, and then calls C. Marked as C0.2, that is, 0 means that the A ".” is followed by the second service node called after A. Then, in order to complete the C call D, it is known that D is called to complete C, so D is marked as D0.
- the call link represented by the topology diagram in Figure 9 can be expressed as A0, B0.1, C0.2, D0.2.1,
- the method of labeling the order is only an example.
- the number representing the sequence topology is recorded in the log.
- the field representing the call is X, and several fields after the X field are recorded.
- Obtaining the service call chain containing the service nodes involved in the call and the order in which they are called can clearly show the process of the service call and obtain the topology and characteristics of each service call.
- the device 1 constructs a corresponding service invocation model according to the service call chain.
- the service invocation model refers to a service invocation chain having the same node invocation sequence constructed according to the topology of the service invocation chain, for example, in the case that the sample of the acquired service invocation chain is sufficiently large, provided in the same service.
- the same service call chain will appear in the platform or application system of the quotient. For example, during the day, there are 30,000 service calls among the national users involved in the service node shown in Figure 9, and the calling sequence and topology are the same.
- a service invocation model is the build process. Constructing a service invocation model corresponding to the service call chain makes the analysis of the service call chain based on the big data sample clearer, and the constructed model can represent a service call, thereby facilitating subsequent data based on the pair of models. Analyze.
- the device 1 processes the service call chain according to the service invocation model.
- Means according to service The call model analyzes the service call chain data with the same service node call and topology order as the service call model.
- the call data of each service node for example, the completion time of each node call, the success or failure of the call, etc. are different. In the case of a difference, but the data sample is large enough to observe the calling rules of each service node, for example, the calling time of a service node is normally completed within 0.1 seconds, and for example, the feedback information of a certain service node is normal.
- the call rule analyzed based on the service call model and the service call chain data with the same service node call and topology order can be used to monitor whether the call in the distributed system is normal and the problem is located.
- the call time of a service node is normally completed within 0.1 seconds.
- the call time of the service node is more than 50 times and more than ten times and more than 0.1 second, then the detection can be detected. There is a problem with the call to the service node.
- step S1 shows a flow chart of step S1 in a method for processing service call information in accordance with another preferred embodiment of the present application.
- the step S1 includes a step S11 and a step S12.
- the device 1 acquires service call log information in the distributed system in step S11; in step S12, the device 1 extracts one or more service call chains from the service call log information, wherein each service call chain includes One or more service nodes that are called sequentially.
- the device 1 acquires service call log information in the distributed system in step S11.
- the service call log information records each time the service node is called, the sequence information, and other information that can determine the order and topology of each service call. For example, because a node is called more than once in a certain time range, if the node is marked D0.2.1 in the service call shown in Figure 9 in the order of the call, there is a certain chance that it will be twice or The above call process is called by the starting point, and after calling the first service node, it is called after the second service node and is marked as 0.2.1. Therefore, it needs to be called when each node is called.
- Each service call is marked and recorded in the log, for example, in the log, the record represents the field of the call shown in Figure 9 as X, that is, X represents a service call marked X by A entry to D, thus
- the field called by the tag is read when the log information is obtained.
- the above example exemplifies that the number representing the sequential topology is recorded in the log when each node is called, so that when the log information is acquired, a field indicating the calling sequence and topology of the service node in the service call chain is read.
- Obtain the log information of the above service call and associate the nodes in the service call to obtain the service call chain.
- step S12 the device 1 extracts one or more service call chains from the service call log information, wherein each service call chain includes one or more service nodes that are called in sequence. That is, according to the mark, sequence information, and other information that can be determined in each log of each service node, as well as the order and topology of each service call, the relevant called sequence is extracted in units of each service call. And topology information and associations to generate a chain of service calls for each service call.
- the obtained call log information is: "alipay, com.alipay.chashier.xxx, 0x0boc123, 0.2.1, AE001"
- the comma is separated by the log, the first field is the system name alipay, the second The fields are interface methods, the third field is the token representing a service call, the fourth field is the order and topology when called, and the fifth field is the return code "AE001" representing the result of the call execution.
- Multi-fields are omitted with "", that is, the third field in all logs is searched according to the mark of the record service call, all service call nodes containing "0x0boc123" are searched, and the searched log records are searched.
- the corresponding node performs the ordering of the calling sequence and the topology according to the fields recorded in the fourth field recorded by the marking method exemplified above, and finally forms a service call such as A0, B0.1, C0.2, and D0.2.1 format. chain.
- the device 1 constructs a corresponding service invocation model by performing aggregation processing on the service call chain, wherein the service invocation model includes one or more service invocation topologies, and each service invocation topology is performed by one or A plurality of said service call chain aggregation processes are obtained.
- the service invocation models all include the same service invocation topology, that is, aggregated by service invocation chains with the same service invocation topology. For example, in the above example, there are 30,000 service call chains in the service call chain obtained as A0, B0.1, C0.2, D0.2.1, and 20,000 service call chains are A0, B0.1.
- service call chain is listed separately as a service call model 003. That is, the service invocation model is a representative of all service call chains that contain the same service node and the service node invocation topology and order, so that the service node call data in the service call chain can be analyzed and monitored by the service invocation model.
- the device 1 processes the corresponding service call chain according to the service call topology in step S3.
- the service call topology in the service call model to be aggregated is based on the service with the same service call topology Call the link for data analysis.
- the analysis shows that the probability of the call of one of the service invocation nodes displaying an error is one ten thousandth of an hour, and then according to the analysis result, other service invocation links having the same service invocation topology with the service invocation model are monitored, thereby When this service invocation node displays an error probability of more than one tenth of an hour, an error is reported. Therefore, the service call chain is processed according to the service invocation topology, so that the system is effectively monitored in a large data sample, and the early warning performance and stability of the system are improved.
- the apparatus further comprises a step S4 (not shown), in which the device 1 performs a cleaning operation on the service invocation topology.
- the cleaning operation is to filter out the information of the calling object that is not important.
- One of the service nodes C will additionally query some information when calling, for example, in the first service call link.
- the cache C1 is queried, the database C2 is queried after being acquired, and then the data is put into the cache C3, and the cache C1 is directly queried in the second service call link.
- the situation before the cleaning operation may be two different links, that is, C also calls the C1, C2, C3 nodes, because the nodes of these queries are usually performed in one system after the error, and the execution result is not fed back.
- the result of the call is usually fed back to the C node, so it can be cleaned and ignored.
- the nodes of the middleware routing query can be cleaned up without affecting the model, thus highlighting the call of the key service node. Make the service call topology more accurate.
- step S3 the device 1 processes the corresponding service call chain according to the service call topology after the cleaning.
- the service call chain with the same service tune topology after the cleaning operation is aggregated according to its log information to construct a service invocation model, specifically the same as the method described above.
- the cleaning operation comprises at least one of the following:
- Deleting the predetermined service node in the service invocation topology that is, filtering the called service node that is not part of the remote service, such as the calling node of the middleware service node routing query, and the like.
- the service node in the service invocation topology that does not feed back the result information is deleted, that is, the invoked operation is performed in the system and the result of the service call without the execution result feedback is filtered, such as querying and calling the cache, calling the database, and the like.
- the cumulative number of occurrences is less than or equal to the predetermined even-use threshold information, that is, by setting a certain threshold number of times to be called, by reading the number of calls in the log information or other history information,
- the service node that is normally used when a complete service call chain is completed or is very accidental is deleted to reduce the burden on the system for data analysis and processing, and a more prepared service call model is obtained. And data.
- the occasional service node in the service invocation topology Deleting the occasional service node in the service invocation topology, wherein the occasional service node accumulates the number of occurrences less than or equal to a predetermined even-use threshold information in the service call chain corresponding to the service invocation topology,
- the service node in the service call topology except for the occasional service node, the cumulative number of occurrences in the service call chain corresponding to the service call topology is greater than or equal to a predetermined common threshold information, that is, by setting a certain call.
- the threshold of the number of times by reading the number of calls in the log information or other history information, filtering the calling service nodes that are mainly or need to be maintained, and deleting other infrequently called service nodes, thereby performing targeted data. Analysis and monitoring.
- the device 1 combines the call feedback information of the service node in the service call chain to perform aggregation processing on the service call chain to construct a corresponding service call model, wherein the service call model includes a Or multiple services invoke a topology, each service call topology being aggregated by one or more of the service call chain aggregations.
- the call feedback information refers to a return node after each service node is called to represent an execution result of the service node, and the call feedback information includes a certain execution result differently formed according to a certain preset rule. Information, such as successful or failed execution, and certain business scenarios.
- each service node corresponds to a number of call feedback information, and usually the call feedback information at the end of the service call link affects the call feedback information of the service call link front end, but in the service call.
- the link front end may be aggregated.
- the A service node shown in Figure 9 returns a system exception, which may be due to It is not possible for the C service node or the D service node network to be faulty, or it may be a database exception. Therefore, each service call link is a combination of call feedback information. Therefore, when the service invocation link with the same topology aggregates the service invocation model, different service invocation links record all the call feedback information combinations and use them for subsequent service invocation model-based data in order to clearly locate the problem. analysis.
- step S3 shows a flow chart of step S3 in a method for processing service call information in accordance with yet another preferred embodiment of the present application. Step S31 and step S32 are included.
- the device 1 performs statistical processing on the one or more service call chains corresponding to the service call topology in step S31 according to the call feedback information of the service node in each service call chain; in step S32 The device 1 monitors and processes the service call chain corresponding to the service calling topology according to the corresponding statistical result.
- step S31 the device 1 performs statistical processing on the one or more service call chains corresponding to the service call topology according to the call feedback information of the service node in each of the service call chains. That is, the call feedback information in the service call chain with the same service call topology corresponding to the service call model is analyzed and counted, for example, according to the topological relationship of the service call model generated by the service call link, and the same service call topology is used.
- the service invocation links are tagged with the service invocation model, that is, each service invocation model has a specific tag, and is combined with the invoking feedback information in each service invocation link to give each service invocation link
- the unique tag and then the call feedback information in the service call link, the call feedback information of the service node in each service call link is uniformly analyzed according to a fixed time ring ratio or year-on-year.
- step S32 the device 1 monitors and processes the service call chain corresponding to the service call topology according to the corresponding statistical result. That is, when the data samples are large enough, the call feedback information of the same node in the service call topology is compared at a fixed time, and the data is monitored, for example, the data is in a normal state in more than 95% of the statistical samples, then Once there is a 5 percent abnormality in the system, it will be monitored by the system, because the call feedback information is that each service call node has the service link corresponding to the specific service call model after monitoring the abnormal situation.
- the above example is based on the unique tag corresponding to each service link and is located on the specific service link and the service node it invokes.
- step S32 shows a flow chart of step S32 in a method for processing service call information in accordance with still another preferred embodiment of the present application. Step S321 and step S322 are included.
- step S321 the device 1 compares the statistical result with the service based on the predetermined time period comparison rule. Comparing the call feedback information of each service node in the service call chain corresponding to the service topology; in step S322, when the device 1 has the comparison difference value exceeding the predetermined fluctuation threshold information, generating corresponding information about the comparison difference.
- the alarm information of the service call chain wherein the alarm information is located at a service node corresponding to the comparison difference.
- the device 1 compares the corresponding statistical result with the call feedback information of each service node in the service call chain corresponding to the service calling topology based on the predetermined time period comparison rule. That is, according to a certain time comparison rule, the call feedback information of all service call links is analyzed based on the same service call topology, for example, the data of the service call link having the same service call topology is 8:00 am to 9:00 am and 9:00 am 10 points of call feedback information for ring analysis, for example, the service call link with the same service call topology, data from 8:00 am to 9:00 am on March 2, and call feedback information from 8:00 am to 9:00 am on March 3 Year-on-year analysis, so that the normal operation data interval of different scenarios can be obtained. For example, the probability of failure in daily payment is that there are one hundred outstanding balances after the payment has been completed, and then the state of the service call in the system is performed according to the analysis results. monitor.
- step S322 the device 1 generates alarm information about the service call chain corresponding to the comparison difference when the comparison difference exceeds a predetermined fluctuation threshold information, wherein the alarm information is located in the comparison.
- the service node corresponding to the difference After analyzing the service call chain with the same topology service model according to the call feedback information, it monitors the service call link data with the same topology in daily operation according to the normal operation data interval of obtaining different scenarios, and The case of the normal interval is set to a certain threshold.
- the threshold of the number of feedbacks of the service node error for checking the balance is less than or equal to One hundred or one hundred and twenty times, when the number of feedbacks of the service node error checking the balance every day in the system checks the set threshold, it will alarm, and the root service calls the link information and the call feedback information.
- the globally unique tag is traced to the error node.
- monitoring and early warning methods are merely examples, and other existing or future possible monitoring and early warning methods may be applied to the present application, and should also be included in the scope of protection of the present application. This is hereby incorporated by reference.
- FIG. 5 shows a schematic diagram of an apparatus for processing service call information in accordance with another aspect of the present application.
- the device 1 includes a service call chain acquisition device 11, a service call model construction device 12, and a processing device 13.
- the service call chain obtaining device 11 in the device 1 acquires one or more services in the distributed service system. a service call chain, wherein each service call chain includes one or more service nodes that are called sequentially; the service call model construction device 12 constructs a corresponding service call model according to the service call chain; the processing device 13 is invoked according to the service The model processes the service call chain.
- the service call chain obtaining 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 called in sequence.
- 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, such as a service node when the e-commerce platform performs product consumption, including calling a user name, calling a user association account, Get the payment page, get security verification, check account balance, and more.
- the service call chain refers to a service node involved in a service call completed in the distributed service system and its sequence. For example, the service call diagram shown in FIG.
- a 9 is a service call chain with an A service node as an entry.
- A, B, C, and D which are indicated by circles, all refer to a service node.
- the entry of the illustrated service call chain is service node A, and the completion of A needs to call B and then call C, and complete C to call D. Therefore, the service invocation node in the service call chain in the service call shown in FIG. 9 has a calling sequence, that is, the calling sequence of the service call chain shown is A ⁇ B ⁇ C ⁇ D, wherein, in order to facilitate the computer The language recognizes that the calling sequence of the service nodes in the service call chain shown in FIG.
- D 9 may mark the order of the initial entry nodes as A0 according to the called order of the service nodes, and then the called B is marked as B0.1, ie 0 represents A.
- the ".” is followed by the first service node that is called after A, and then the C is marked as C0.2, that is, 0 represents the second ".” followed by the second service node called after A, and then D needs to be called to complete D
- D is marked as D0.2.1, that is, 0 means A ".”, 2 is followed by C, and then ".” is followed by 1 to be the first node called after C.
- the calling link represented by the topology diagram in 9 can be expressed as A0, B0.1, C0.2, D0.2.1, wherein the labeling method for the order is only an example, and can represent the sequential topology when each node is called.
- the number is recorded in the log, for example, in the log, the record represents the field of the call is X, and several fields following the X field record the number and point indicating the calling sequence and topology of the service node, so as to serve according to the service call record in the log.
- Obtaining the service call chain containing the service nodes involved in the call and the order in which they are called can clearly show the process of the service call and obtain the topology and characteristics of each service call.
- the service invocation model building device 12 constructs a corresponding service invocation model according to the service invocation chain.
- the service invocation model refers to a node with the same node constructed according to the topology of the service invocation chain. Sequential service call chain, for example, if the sample of the acquired service call chain is large enough, the same service call chain will appear in the same service provider's platform or application system, for example, three of the national users in a day. Ten thousand service calls refer to the service node shown in Figure 9, and the calling sequence and topology are the same.
- the 30,000 service calls corresponding to the same service invocation model are A0, B0.1 as exemplified above.
- the service process model is a build process by summarizing several service call chains with the same topology and sequential service node calls. Constructing a service invocation model corresponding to the service call chain makes the analysis of the service call chain based on the big data sample clearer, and the constructed model can represent a service call, thereby facilitating subsequent data based on the pair of models. Analyze.
- the processing device 13 processes the service call chain according to the service invocation model. It refers to analyzing the service call chain data with the same service node call and topology order according to the service invocation model, and the calling data of each service node, such as the completion time of each node call, the success or failure of the call, etc. There will be differences in different situations, but the calling rules of each service node can be observed when the data samples are large enough.
- the calling time of a service node is normally completed within 0.1 seconds, and for example, the service node is If the feedback information fails normally within ten times, the call rule analyzed based on the service invocation model and the service call chain data with the same service node call and topology order can be used to monitor whether the call in the distributed system is normal.
- the problem location for example, the call time of a service node is normally completed within 0.1 seconds. In the 100 calls of a certain time period, the call time of the service node is more than 50 times and more than ten times more than 0.1 second. There is a problem detecting the call of the service node.
- the service call chain obtaining means 11 includes a call information acquiring unit 111 and a service call chain generating unit 112.
- the call information acquiring unit 111 acquires service call log information in the distributed system; the service call chain generating unit 112 extracts one or more service call chains from the service call log information, where each service call chain Includes one or more service nodes that are called in sequence.
- the call information acquiring unit 111 acquires service call log information in the distributed system.
- the service call log information records each time the service node is called, the sequence information, and other information that can determine the order and topology of each service call. For example, because a node is not only being used for a certain time range Called once, therefore, if the node is marked D0.2.1 in the service call shown in Figure 9 as in the above call sequence, there is a certain probability that it will be called by the starting point in two or more calls. After calling the first service node, it is called after the second service node and is marked as 0.2.1. Therefore, each service call needs to be marked and recorded in the log when each node is called, for example In the log, the field representing the call shown in FIG.
- X represents a service call marked X by a certain entry from A to D, so that the field of the tag call is read when the log information is acquired.
- the above example exemplifies that the number representing the sequential topology is recorded in the log when each node is called, so that when the log information is acquired, a field indicating the calling sequence and topology of the service node in the service call chain is read. Obtain the log information of the above service call, and associate the nodes in the service call to obtain the service call chain.
- the service call chain generation unit 112 extracts one or more service call chains from the service call log information, wherein each service call chain includes one or more service nodes that are called in sequence. That is, according to the mark, sequence information, and other information that can be determined in each log of each service node, as well as the order and topology of each service call, the relevant called sequence is extracted in units of each service call. And topology information and associations to generate a chain of service calls for each service call.
- the obtained call log information is: "alipay, com.alipay.chashier.xxx, 0x0boc123, 0.2.1, AE001"
- the comma is separated by the log, the first field is the system name alipay, the second The fields are interface methods, the third field is the token representing a service call, the fourth field is the order and topology when called, and the fifth field is the return code "AE001" representing the result of the call execution.
- Multi-fields are omitted with "", that is, the third field in all logs is searched according to the mark of the record service call, all service call nodes containing "0x0boc123" are searched, and the searched log records are searched.
- the corresponding node performs the ordering of the calling sequence and the topology according to the fields recorded in the fourth field recorded by the marking method exemplified above, and finally forms a service call such as A0, B0.1, C0.2, and D0.2.1 format. chain.
- the service invocation model building device 12 constructs a corresponding service invocation model by performing aggregation processing on the service invocation chain, wherein the service invocation model includes one or more service invocation topologies, each service The calling topology is derived from one or more of the service call chain aggregation processes.
- the service invocation models all include the same service invocation topology, that is, aggregated by service invocation chains with the same service invocation topology. For example, in the above example, there are 30,000 service call chains in the service call chain obtained as A0, B0.1, C0.2, D0.2.1, and 20,000 service call chains are A0, B0.1.
- service call chain is listed separately as a service call model 003. That is, the service invocation model is a representative of all service call chains that contain the same service node and the service node invocation topology and order, so that the service node call data in the service call chain can be analyzed and monitored by the service invocation model.
- the processing device 13 processes the corresponding service call chain according to the service call topology.
- the service invocation topology in the service invocation model to be aggregated is based on data analysis of the service invocation link with the same service invocation topology. For example, A0, B0.1, C0.2, D0.2.1
- the service invocation model analyzes the data of each of the 30,000 service call chains. For example, the probability of a call to one of the service call nodes is one ten thousandth of an hour, and then based on this analysis.
- the result is monitored for other service invocation links that have the same service invocation topology as the service invocation model, such that when the service invoking node displays an error probability of more than one ten thousandth per hour, an error is reported. Therefore, the service call chain is processed according to the service invocation topology, so that the system is effectively monitored in a large data sample, and the early warning performance and stability of the system are improved.
- the apparatus further includes a cleaning device 14 (not shown) that performs a cleaning operation on the service invocation topology.
- the cleaning operation is to filter out the information of the calling object that is not important.
- One of the service nodes C will additionally query some information when calling, for example, in the first service call link.
- the cache C1 is queried, the database C2 is queried after being acquired, and then the data is put into the cache C3, and the cache C1 is directly queried in the second service call link.
- the situation before the cleaning operation may be two different links, that is, C also calls the C1, C2, C3 nodes, because the nodes of these queries are usually performed in one system after the error, and the execution result is not fed back.
- the result of the call is usually fed back to the C node, so it can be cleaned and ignored.
- the nodes of the middleware routing query can be cleaned up without affecting the model, thus highlighting the call of the key service node. Make the service call topology more accurate.
- the processing device 13 calls the service call chain corresponding to the topology processing according to the service after the cleaning.
- the service call chain with the same service tune topology after the cleaning operation is aggregated according to its log information to construct a service invocation model, specifically the same as the method described above.
- the cleaning operation comprises at least one of the following:
- the predetermined service node in the service invocation topology is deleted, and the called node that is called, for example, the middleware service node routing query, is filtered.
- the service node in the service invocation topology that does not feed back the result information is deleted, that is, the invoked operation is performed in the system and the result of the service call without the execution result feedback is filtered, such as querying and calling the cache, calling the database, and the like.
- the occasional service node Deleting the occasional service node in the service invocation topology, wherein the occasional service node accumulates the number of occurrences less than or equal to the predetermined even-use threshold information in the service call chain corresponding to the service invocation topology, that is, Set a certain threshold for the number of times to be called.
- the predetermined even-use threshold information in the service call chain corresponding to the service invocation topology, that is, Set a certain threshold for the number of times to be called.
- the occasional service node in the service invocation topology Deleting the occasional service node in the service invocation topology, wherein the occasional service node accumulates the number of occurrences less than or equal to a predetermined even-use threshold information in the service call chain corresponding to the service invocation topology,
- the service node in the service call topology except for the occasional service node, the cumulative number of occurrences in the service call chain corresponding to the service call topology is greater than or equal to a predetermined common threshold information, that is, by setting a certain call.
- the threshold of the number of times by reading the number of calls in the log information or other history information, filtering the calling service nodes that are mainly or need to be maintained, and deleting other infrequently called service nodes, thereby performing targeted data. Analysis and monitoring.
- the service invocation model building device 12 performs aggregation processing on the service call chain in conjunction with call feedback information of the service node in the service call chain to construct a corresponding service invocation model, wherein the service invoking model Include one or more service invocation topologies, each service invocation topology being aggregated by one or more of the service invocation chain aggregations.
- the call feedback information refers to a return node after each service node is called to represent an execution result of the service node, and the call feedback information includes a certain execution result differently formed according to a certain preset rule. Information, such as successful or failed execution, and certain business scenarios.
- the call to the Node B is successful, the SUCC is fed back, the D node is called to call the feedback information AE00, and the call feedback information AE01 of the C node is used.
- Calling feedback information AE10 the call representing the A node needs to be called
- the C node is executed, and the call of the C node needs to execute the call of the D node first, and the call feedback information can be recorded in the log, so that the call can be queried when the service node calls the topology information for a certain time.
- the service node corresponds to a number of call feedback information, and usually the call feedback information at the end of the service call link affects the call feedback information of the service call link front end, but may be aggregated at the front end of the service call link, for example, as shown in FIG.
- the A service node returns a system exception, which may be because the C service node or the D service node network is unreachable or may be a database exception. Therefore, each service call link is a combination of call feedback information. Therefore, when the service invocation link with the same topology aggregates the service invocation model, different service invocation links record all the call feedback information combinations and use them for subsequent service invocation model-based data in order to clearly locate the problem. analysis.
- FIG. 7 shows a schematic diagram of a processing device in an apparatus for processing service call information according to still another preferred embodiment of the present application.
- the processing device 13 includes an information analysis unit 131 and a monitoring unit 132.
- the information analysis unit 131 performs statistical processing on the one or more service call chains corresponding to the service call topology according to the call feedback information of the service node in each of the service call chains; the monitoring unit 132 according to the corresponding The statistical result monitoring processes the service call chain corresponding to the service call topology.
- the information analysis unit 131 performs statistical processing on the one or more service call chains corresponding to the service call topology according to the call feedback information of the service node in each of the service call chains. That is, the call feedback information in the service call chain with the same service call topology corresponding to the service call model is analyzed and counted, for example, according to the topological relationship of the service call model generated by the service call link, and the same service call topology is used.
- the service invocation links are tagged with the service invocation model, that is, each service invocation model has a specific tag, and is combined with the invoking feedback information in each service invocation link to give each service invocation link
- the unique tag and then the call feedback information in the service call link, the call feedback information of the service node in each service call link is uniformly analyzed according to a fixed time ring ratio or year-on-year.
- the monitoring unit 132 monitors and processes the service call chain corresponding to the service calling topology according to the corresponding statistical result. That is, when the data samples are large enough, the call feedback information of the same node in the service call topology is compared at a fixed time, and the data is monitored, for example, the data is in the statistical sample of more than 95%.
- the call feedback information is that each service call node has the ability to monitor the abnormal situation and then locate the corresponding service call model.
- the service link is contiguous to the specific service link and the service node it invokes according to the unique tag corresponding to each service link.
- FIG. 8 shows a schematic diagram of a monitoring unit in an apparatus for processing service call information according to still another preferred embodiment of the present application.
- the monitoring unit 132 includes a comparison subunit 1321 and an alarm subunit 1322.
- the comparison subunit 1321 compares the corresponding statistical result with the call feedback information of each service node in the service call chain corresponding to the service call topology based on a predetermined time period comparison rule; the alarm subunit 1322 exists. When the comparison difference exceeds the predetermined fluctuation threshold information, generating alarm information about the service call chain corresponding to the comparison difference, wherein the alarm information is located at a service node corresponding to the comparison difference.
- the comparison subunit 1321 compares the corresponding statistical result with the call feedback information of each service node in the service call chain corresponding to the service calling topology based on a predetermined time period comparison rule. That is, according to a certain time comparison rule, the call feedback information of all service call links is analyzed based on the same service call topology, for example, the data of the service call link having the same service call topology is 8:00 am to 9:00 am and 9:00 am 10 points of call feedback information for ring analysis, for example, the service call link with the same service call topology, data from 8:00 am to 9:00 am on March 2, and call feedback information from 8:00 am to 9:00 am on March 3 Year-on-year analysis, so that the normal operation data interval of different scenarios can be obtained. For example, the probability of failure in daily payment is that there are one hundred outstanding balances after the payment has been completed, and then the state of the service call in the system is performed according to the analysis results. monitor.
- the alarm sub-unit 1322 After analyzing the service call chain with the same topology service model according to the call feedback information, it monitors the service call link data with the same topology in daily operation according to the normal operation data interval of obtaining different scenarios, and In the case of the normal interval, a certain threshold is set. For example, if the probability of the daily payment failure is the case that the completed payment has a shortage of one hundred occurrences, the service node that checks the balance is set.
- the threshold of the number of incorrect feedbacks is less than or equal to one hundred or one hundred and twenty times, then the number of feedbacks of the service node error checking the balance every day in the system is checked after the set threshold is checked, and the root service calls the link. The information and the globally unique token formed by the call feedback information are tracked to the faulty node.
- monitoring and early warning methods are merely examples, and other existing or future possible monitoring and early warning methods may be applied to the present application, and should also be included in the scope of protection of the present application. This is hereby incorporated by reference.
- the present application can be implemented in software and/or a combination of software and hardware, for example, using an application specific integrated circuit (ASIC), a general purpose computer, or any other similar hardware device.
- the software program of the present application can be executed by a processor to implement the steps or functions described above.
- the software programs (including related data structures) of the present application can be stored in a computer readable recording medium such as a RAM memory, a magnetic or optical drive or a floppy disk and the like.
- some of the steps or functions of the present application may be implemented in hardware, for example, as a circuit that cooperates with a processor to perform various steps or functions.
- a portion of the present application can be applied as a computer program product, such as computer program instructions, which, when executed by a computer, can invoke or provide a method and/or technical solution in accordance with the present application.
- the program instructions for invoking the method of the present application may be stored in a fixed or removable recording medium, and/or transmitted by a data stream in a broadcast or other signal bearing medium, and/or stored in a The working memory of the computer device in which the program instructions are run.
- an embodiment in accordance with the present application includes a device including a memory for storing computer program instructions and a processor for executing program instructions, wherein when the computer program instructions are executed by the processor, triggering
- the apparatus operates based on the aforementioned methods and/or technical solutions in accordance with various embodiments of the present application.
Abstract
Description
Claims (16)
- 一种用于处理服务调用信息的方法,其中,该方法包括:a获取分布式服务系统中的一个或多个服务调用链,其中,每个服务调用链包括被顺序调用的一个或多个服务节点;b根据所述服务调用链构建对应的服务调用模型;c根据所述服务调用模型处理所述服务调用链。
- 根据权利要求1所述的方法,其中,所述步骤a包括:获取分布式系统中的服务调用日志信息;从所述服务调用日志信息中抽取一个或多个服务调用链,其中,每个服务调用链包括被顺序调用的一个或多个服务节点。
- 根据权利要求1或2所述的方法,其中,所述步骤b包括:通过对所述服务调用链进行聚合处理构建对应的服务调用模型,其中,所述服务调用模型包括一个或多个服务调用拓扑,每个服务调用拓扑由一个或多个所述服务调用链聚合处理而得;其中,所述步骤c包括:根据所述服务调用拓扑处理对应的所述服务调用链。
- 根据权利要求3所述的方法,其中,所述方法还包括:对所述服务调用拓扑执行清洗操作;其中,所述步骤c包括:根据清洗后的所述服务调用拓扑处理对应的所述服务调用链。
- 根据权利要求4所述的方法,其中,所述清洗操作包括以下至少任一项:删除所述服务调用拓扑中的预定服务节点;删除所述服务调用拓扑中的未反馈调用结果信息的服务节点;删除所述服务调用拓扑中的偶用服务节点,其中,所述偶用服务节点在所述服务调用拓扑对应的所述服务调用链中累计出现次数小于或等于预定的偶用阈值信息;删除所述服务调用拓扑中的偶用服务节点,其中,所述偶用服务节点在所述服务调用拓扑对应的所述服务调用链中累计出现次数小于或等于预定的偶用阈值信息,所述服务调用拓扑中除所述偶用服务节点外的其他服务节点在所述服务调用拓扑对应的所述服务调用链中累计出现次数大于或等于预定的常用阈值信息。
- 根据权利要求3至5中任一项所述的方法,其中,所述步骤b包括:结合所述服务调用链中服务节点的调用反馈信息,对所述服务调用链进行聚合处理,以构建对应的服务调用模型,其中,所述服务调用模型包括一个或多个服务调用拓扑,每个服务调用拓扑由一个或多个所述服务调用链聚合处理而得。
- 根据权利要求6所述的方法,其中,所述步骤c包括:c1对于所述服务调用拓扑所对应的一个或多个所述服务调用链,根据每个所述服务调用链中服务节点的调用反馈信息进行统计处理;c2根据对应的统计结果监控处理所述服务调用拓扑所对应的所述服务调用链。
- 根据权利要求7所述的方法,其中,所述步骤c2包括:基于预定的时段比对规则,将对应的统计结果与所述服务调用拓扑所对应的所述服务调用链中各服务节点的调用反馈信息相比较;当存在比较差值超过预定的波动阈值信息时,生成关于所述比较差值对应的所述服务调用链的报警信息,其中,所述报警信息定位于所述比较差值对应的服务节点。
- 一种用于处理服务调用信息的设备,其中,该设备包括:服务调用链获取装置,用于获取分布式服务系统中的一个或多个服务调用链,其中,每个服务调用链包括被顺序调用的一个或多个服务节点;服务调用模型构建装置,用于根据所述服务调用链构建对应的服务调用模型;处理装置,用于根据所述服务调用模型处理所述服务调用链。
- 根据权利要求9所述的设备,其中,所述服务调用链获取装置包括:调用信息获取单元,用于获取分布式系统中的服务调用日志信息;服务调用链生成单元,用于从所述服务调用日志信息中抽取一个或多个服务调用链,其中,每个服务调用链包括被顺序调用的一个或多个服务节点。
- 根据权利要求9或10所述的设备,其中,所述服务调用模型构建装置用于:通过对所述服务调用链进行聚合处理构建对应的服务调用模型,其中,所述服务调用模型包括一个或多个服务调用拓扑,每个服务调用拓扑由一个或多个所述服务调用链聚合处理而得;其中,所述处理装置用于:根据所述服务调用拓扑处理对应的所述服务调用链。
- 根据权利要求11所述的设备,其中,所述设备还包括:清洗装置,用于对所述服务调用拓扑执行清洗操作;其中,所述处理装置用于:根据清洗后的所述服务调用拓扑处理对应的所述服务调用链。
- 根据权利要求12所述的设备,其中,所述清洗操作包括以下至少任一项:删除所述服务调用拓扑中的预定服务节点;删除所述服务调用拓扑中的未反馈调用结果信息的服务节点;删除所述服务调用拓扑中的偶用服务节点,其中,所述偶用服务节点在所述服务调用拓扑对应的所述服务调用链中累计出现次数小于或等于预定的偶用阈值信息;删除所述服务调用拓扑中的偶用服务节点,其中,所述偶用服务节点在所述服务调用拓扑对应的所述服务调用链中累计出现次数小于或等于预定的偶用阈值信息,所述服务调用拓扑中除所述偶用服务节点外的其他服务节点在所述服务调用拓扑对应的所述服务调用链中累计出现次数大于或等于预定的常用阈值信息。
- 根据权利要求11至13中任一项所述的设备,其中,所述服务调用模型构建装置用于:结合所述服务调用链中服务节点的调用反馈信息,对所述服务调用链进行聚合处理,以构建对应的服务调用模型,其中,所述服务调用模型包括一个或多个服务调用拓扑,每个服务调用拓扑由一个或多个所述服务调用链聚合处理而得。
- 根据权利要求14所述的设备,其中,所述处理装置包括:信息分析单元,用于对于所述服务调用拓扑所对应的一个或多个所述服务调用链,根据每个所述服务调用链中服务节点的调用反馈信息进行统计处理;监控单元,用于根据对应的统计结果监控处理所述服务调用拓扑所对应的所述服务调用链。
- 根据权利要求15所述的设备,其中,所述监控单元包括:比较子单元,用于基于预定的时段比对规则,将对应的统计结果与所述服务调用拓扑所对应的所述服务调用链中各服务节点的调用反馈信息相比较;报警子单元,用于当存在比较差值超过预定的波动阈值信息时,生成关于所述比较差值对应的所述服务调用链的报警信息,其中,所述报警信息定位于所述比较差值对应的服务节点。
Priority Applications (10)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
ES16861456T ES2808966T3 (es) | 2015-11-03 | 2016-10-25 | Método y dispositivo para procesar información de llamadas de servicio |
EP16861456.8A EP3373516B1 (en) | 2015-11-03 | 2016-10-25 | Method and device for processing service calling information |
KR1020187015528A KR102146173B1 (ko) | 2015-11-03 | 2016-10-25 | 서비스 호출 정보 처리 방법 및 디바이스 |
PL16861456T PL3373516T3 (pl) | 2015-11-03 | 2016-10-25 | Sposób i urządzenie do przetwarzania informacji o wywołaniu usługi |
JP2018522941A JP6706321B2 (ja) | 2015-11-03 | 2016-10-25 | サービス呼び出し情報処理の方法及びデバイス |
AU2016351091A AU2016351091B2 (en) | 2015-11-03 | 2016-10-25 | Method and device for processing service calling information |
MYPI2018701755A MY197612A (en) | 2015-11-03 | 2016-10-25 | Method and device for processing service calling information |
SG11201803696QA SG11201803696QA (en) | 2015-11-03 | 2016-10-25 | Service call information processing method and device |
US15/969,364 US10671474B2 (en) | 2015-11-03 | 2018-05-02 | Monitoring node usage in a distributed system |
PH12018500934A PH12018500934A1 (en) | 2015-11-03 | 2018-05-02 | Service call information processing method and device |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510734236.2 | 2015-11-03 | ||
CN201510734236.2A CN106656536B (zh) | 2015-11-03 | 2015-11-03 | 一种用于处理服务调用信息的方法与设备 |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/969,364 Continuation US10671474B2 (en) | 2015-11-03 | 2018-05-02 | Monitoring node usage in a distributed system |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2017076188A1 true WO2017076188A1 (zh) | 2017-05-11 |
Family
ID=58661593
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2016/103173 WO2017076188A1 (zh) | 2015-11-03 | 2016-10-25 | 一种用于处理服务调用信息的方法与设备 |
Country Status (12)
Country | Link |
---|---|
US (1) | US10671474B2 (zh) |
EP (1) | EP3373516B1 (zh) |
JP (1) | JP6706321B2 (zh) |
KR (1) | KR102146173B1 (zh) |
CN (1) | CN106656536B (zh) |
AU (1) | AU2016351091B2 (zh) |
ES (1) | ES2808966T3 (zh) |
MY (1) | MY197612A (zh) |
PH (1) | PH12018500934A1 (zh) |
PL (1) | PL3373516T3 (zh) |
SG (2) | SG11201803696QA (zh) |
WO (1) | WO2017076188A1 (zh) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114629768A (zh) * | 2022-02-17 | 2022-06-14 | 亚信科技(南京)有限公司 | 应用拓扑的处理方法、装置、电子设备、存储介质及产品 |
Families Citing this family (32)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105591821B (zh) * | 2016-01-06 | 2020-06-30 | 北京京东尚科信息技术有限公司 | 监控系统和业务系统 |
CN107301197B (zh) * | 2017-05-12 | 2020-12-01 | 上海瀚银信息技术有限公司 | 一种业务数据跟踪处理系统及方法 |
US10409708B2 (en) * | 2017-08-28 | 2019-09-10 | International Business Machines Corporation | Performance data collection for a distributed computing system |
CN107729210B (zh) * | 2017-09-29 | 2020-09-25 | 百度在线网络技术(北京)有限公司 | 分布式服务集群的异常诊断方法和装置 |
CN107741885B (zh) * | 2017-10-09 | 2020-12-01 | 用友网络科技股份有限公司 | 基于cs架构的事务与业务关联方法、关联系统 |
CN109995817A (zh) * | 2017-12-29 | 2019-07-09 | 中移信息技术有限公司 | 一种服务调度方法及装置 |
CN108809688A (zh) * | 2018-02-22 | 2018-11-13 | 阿里巴巴集团控股有限公司 | 故障信息识别方法、装置、服务器及系统 |
CN109120686A (zh) * | 2018-08-08 | 2019-01-01 | 联动优势电子商务有限公司 | 一种服务预验证的方法及装置 |
CN109254901B (zh) * | 2018-09-30 | 2019-11-29 | 北京九章云极科技有限公司 | 一种指标监测方法及系统 |
CN109582650B (zh) * | 2018-11-09 | 2021-05-25 | 金色熊猫有限公司 | 模块调用量处理方法、装置、电子设备、存储介质 |
CN113169900B (zh) * | 2018-11-29 | 2022-12-27 | 华为技术有限公司 | 分布式系统中追踪业务执行过程的方法和装置 |
CN111259275B (zh) * | 2018-12-03 | 2023-12-15 | 阿里巴巴集团控股有限公司 | 一种数据追踪方法、设备及存储介质 |
CN109684104B (zh) * | 2018-12-17 | 2021-03-26 | 广州方硅信息技术有限公司 | 一种服务间调用链的展示实现方法及设备 |
CN109710446A (zh) * | 2018-12-28 | 2019-05-03 | 江苏满运软件科技有限公司 | 支付调用过程校验方法、系统、设备以及介质 |
CN109981349B (zh) * | 2019-02-27 | 2022-02-25 | 华为云计算技术有限公司 | 调用链信息查询方法以及设备 |
KR102245718B1 (ko) * | 2019-05-22 | 2021-04-28 | 카페24 주식회사 | 이상치 발생 여부를 속성별로 시각화하는 방법, 컴퓨팅 디바이스 및 컴퓨터 판독 가능한 저장 매체 |
CN110674284A (zh) * | 2019-08-26 | 2020-01-10 | 四川新网银行股份有限公司 | 多系统的方法调用链路图的生成方法 |
CN110708212B (zh) * | 2019-09-10 | 2022-04-29 | 中国平安财产保险股份有限公司 | 分布式系统中调用链路的追踪方法及装置 |
CN112631880A (zh) * | 2019-10-08 | 2021-04-09 | 中国移动通信集团浙江有限公司 | 基于调用链的性能分析方法及装置 |
CN112737800B (zh) * | 2019-10-28 | 2023-04-28 | 顺丰科技有限公司 | 服务节点故障定位方法、调用链生成方法及服务器 |
CN111459766B (zh) * | 2019-11-14 | 2024-01-12 | 国网浙江省电力有限公司信息通信分公司 | 一种面向微服务系统的调用链跟踪与分析方法 |
CN111343242B (zh) * | 2020-02-13 | 2022-09-02 | 北京奇艺世纪科技有限公司 | 一种信息收集方法、装置、设备、存储介质及分布式系统 |
CN111913766B (zh) * | 2020-09-29 | 2021-01-15 | 北京东方通软件有限公司 | 一种微服务调用链的健康检测方法和健康检测系统 |
CN112366828A (zh) * | 2020-11-30 | 2021-02-12 | 深圳供电局有限公司 | 一种配电网重要用户的供电可靠性监视方法及系统 |
CN112887123A (zh) * | 2021-01-06 | 2021-06-01 | 新浪网技术(中国)有限公司 | 一种基于调用链的业务报警方法、系统及装置 |
CN112783629A (zh) * | 2021-02-01 | 2021-05-11 | 天津五八到家货运服务有限公司 | 服务调用方法、装置、电子设备及存储介质 |
CN113094157A (zh) * | 2021-02-25 | 2021-07-09 | 青岛海尔科技有限公司 | 调用拓扑图的生成方法和装置、存储介质及电子装置 |
CN113297076B (zh) * | 2021-05-21 | 2023-06-23 | 建信金融科技有限责任公司 | 基于调用链图的服务变更识别方法及装置 |
CN113434399B (zh) * | 2021-06-23 | 2023-06-16 | 青岛海尔科技有限公司 | 业务节点日志的处理方法和装置、存储介质及电子装置 |
CN114531338A (zh) * | 2022-04-24 | 2022-05-24 | 中邮消费金融有限公司 | 一种基于调用链数据的监控告警和溯源方法及系统 |
CN114844768A (zh) * | 2022-04-27 | 2022-08-02 | 广州亚信技术有限公司 | 信息分析方法、装置及电子设备 |
KR102528717B1 (ko) | 2022-10-07 | 2023-05-08 | 이데아텍(주) | 보안 기능을 지원하는 api 통합 처리를 위한 게이트웨이 장치 및 이의 동작 방법 |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2002015462A1 (en) * | 2000-08-17 | 2002-02-21 | Redback Networks Inc. | Methods and apparatus for deploying quality of service policies on a data communication network |
CN102594851A (zh) * | 2011-01-07 | 2012-07-18 | 中国科学院遥感应用研究所 | 一种海洋应用服务链动态构建的方法 |
CN103401944A (zh) * | 2013-08-14 | 2013-11-20 | 青岛大学 | 一种服务组合动态重构系统 |
Family Cites Families (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6597777B1 (en) | 1999-06-29 | 2003-07-22 | Lucent Technologies Inc. | Method and apparatus for detecting service anomalies in transaction-oriented networks |
CA2491419A1 (en) | 2002-06-28 | 2004-01-08 | Omniture, Inc. | Capturing and presenting site visitation path data |
JP4093483B2 (ja) * | 2003-12-26 | 2008-06-04 | インターナショナル・ビジネス・マシーンズ・コーポレーション | 解析システム、解析方法、解析プログラム、及び記録媒体 |
US20070027974A1 (en) * | 2005-08-01 | 2007-02-01 | Microsoft Corporation | Online service monitoring |
US8578017B2 (en) | 2006-05-11 | 2013-11-05 | Ca, Inc. | Automatic correlation of service level agreement and operating level agreement |
EP1879358A1 (en) * | 2006-07-12 | 2008-01-16 | Hewlett-Packard Development Company, L.P. | Method of providing composite services in a network and corresponding network element |
US8873402B2 (en) * | 2009-07-31 | 2014-10-28 | Telefonaktiebolaget L M Ericsson (Publ) | Service monitoring and service problem diagnosing in communications network |
CN102045182B (zh) | 2009-10-20 | 2012-08-08 | 华为技术有限公司 | 一种业务故障确定方法、装置和系统 |
US8635617B2 (en) * | 2010-09-30 | 2014-01-21 | Microsoft Corporation | Tracking requests that flow between subsystems using transaction identifiers for generating log data |
CN102360295A (zh) * | 2011-10-07 | 2012-02-22 | 彭志平 | 一种基于多Web服务链组合的服务匹配方法 |
CN103186417B (zh) * | 2011-12-30 | 2016-04-06 | 鼎捷软件股份有限公司 | 一种服务管理的方法 |
US8977909B2 (en) * | 2012-07-19 | 2015-03-10 | Dell Products L.P. | Large log file diagnostics system |
CN102945283B (zh) * | 2012-11-19 | 2016-09-28 | 武汉大学 | 一种语义Web服务组合方法 |
CN103269280B (zh) * | 2013-04-23 | 2017-12-15 | 华为技术有限公司 | 网络中开展业务的方法、装置及系统 |
US9444675B2 (en) * | 2013-06-07 | 2016-09-13 | Cisco Technology, Inc. | Determining the operations performed along a service path/service chain |
US20160117196A1 (en) * | 2013-07-31 | 2016-04-28 | Hewlett-Packard Development Company, L.P. | Log analysis |
US11245588B2 (en) * | 2013-10-30 | 2022-02-08 | Micro Focus Llc | Modifying realized topologies |
KR20150094260A (ko) * | 2014-02-11 | 2015-08-19 | 한국전자통신연구원 | 소프트웨어 정의 네트워킹 환경에서 네트워크 서비스 체인의 정형 검증을 위한 검증 지원 장치 및 방법과, 그 검증 지원 장치를 구비한 정형 검증 장치 |
US11159599B2 (en) * | 2014-10-10 | 2021-10-26 | Dynatrace Llc | Method and system for real-time modeling of communication, virtualization and transaction execution related topological aspects of monitored software applications and hardware entities |
WO2018137254A1 (zh) * | 2017-01-26 | 2018-08-02 | 华为技术有限公司 | 一种基于调用链的并发控制的方法、装置及控制节点 |
-
2015
- 2015-11-03 CN CN201510734236.2A patent/CN106656536B/zh active Active
-
2016
- 2016-10-25 ES ES16861456T patent/ES2808966T3/es active Active
- 2016-10-25 WO PCT/CN2016/103173 patent/WO2017076188A1/zh active Application Filing
- 2016-10-25 SG SG11201803696QA patent/SG11201803696QA/en unknown
- 2016-10-25 EP EP16861456.8A patent/EP3373516B1/en active Active
- 2016-10-25 SG SG10201909213P patent/SG10201909213PA/en unknown
- 2016-10-25 PL PL16861456T patent/PL3373516T3/pl unknown
- 2016-10-25 JP JP2018522941A patent/JP6706321B2/ja active Active
- 2016-10-25 KR KR1020187015528A patent/KR102146173B1/ko active IP Right Grant
- 2016-10-25 AU AU2016351091A patent/AU2016351091B2/en active Active
- 2016-10-25 MY MYPI2018701755A patent/MY197612A/en unknown
-
2018
- 2018-05-02 US US15/969,364 patent/US10671474B2/en active Active
- 2018-05-02 PH PH12018500934A patent/PH12018500934A1/en unknown
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2002015462A1 (en) * | 2000-08-17 | 2002-02-21 | Redback Networks Inc. | Methods and apparatus for deploying quality of service policies on a data communication network |
CN102594851A (zh) * | 2011-01-07 | 2012-07-18 | 中国科学院遥感应用研究所 | 一种海洋应用服务链动态构建的方法 |
CN103401944A (zh) * | 2013-08-14 | 2013-11-20 | 青岛大学 | 一种服务组合动态重构系统 |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114629768A (zh) * | 2022-02-17 | 2022-06-14 | 亚信科技(南京)有限公司 | 应用拓扑的处理方法、装置、电子设备、存储介质及产品 |
Also Published As
Publication number | Publication date |
---|---|
ES2808966T3 (es) | 2021-03-02 |
US20180253350A1 (en) | 2018-09-06 |
CN106656536A (zh) | 2017-05-10 |
SG10201909213PA (en) | 2019-11-28 |
US10671474B2 (en) | 2020-06-02 |
EP3373516A4 (en) | 2018-10-17 |
KR20180078296A (ko) | 2018-07-09 |
EP3373516A1 (en) | 2018-09-12 |
SG11201803696QA (en) | 2018-06-28 |
JP2019502191A (ja) | 2019-01-24 |
PL3373516T3 (pl) | 2020-11-30 |
MY197612A (en) | 2023-06-28 |
AU2016351091B2 (en) | 2019-10-10 |
AU2016351091A1 (en) | 2018-05-24 |
PH12018500934A1 (en) | 2018-11-12 |
JP6706321B2 (ja) | 2020-06-03 |
CN106656536B (zh) | 2020-02-18 |
EP3373516B1 (en) | 2020-05-20 |
KR102146173B1 (ko) | 2020-08-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2017076188A1 (zh) | 一种用于处理服务调用信息的方法与设备 | |
EP2871574B1 (en) | Analytics for application programming interfaces | |
US10956296B2 (en) | Event correlation | |
CN106657192B (zh) | 一种用于呈现服务调用信息的方法与设备 | |
US20170109657A1 (en) | Machine Learning-Based Model for Identifying Executions of a Business Process | |
US20170109668A1 (en) | Model for Linking Between Nonconsecutively Performed Steps in a Business Process | |
CN107741911A (zh) | 接口测试方法、装置、客户端及计算机可读存储介质 | |
US11860717B1 (en) | Graphical user interface for presenting crash data | |
US20170109667A1 (en) | Automaton-Based Identification of Executions of a Business Process | |
US20180046956A1 (en) | Warning About Steps That Lead to an Unsuccessful Execution of a Business Process | |
US20170109636A1 (en) | Crowd-Based Model for Identifying Executions of a Business Process | |
US20170109639A1 (en) | General Model for Linking Between Nonconsecutively Performed Steps in Business Processes | |
CN108038039B (zh) | 记录日志的方法及微服务系统 | |
US11113137B2 (en) | Error incident fingerprinting with unique static identifiers | |
US20170109638A1 (en) | Ensemble-Based Identification of Executions of a Business Process | |
US10248532B1 (en) | Sensitive data usage detection using static analysis | |
US20170109640A1 (en) | Generation of Candidate Sequences Using Crowd-Based Seeds of Commonly-Performed Steps of a Business Process | |
US20170109670A1 (en) | Crowd-Based Patterns for Identifying Executions of Business Processes | |
CN109684220A (zh) | 一种基于事件回放的浏览器兼容性分析方法 | |
US20230099325A1 (en) | Incident management system for enterprise operations and a method to operate the same | |
CN114880713B (zh) | 基于数据链路的用户行为分析方法、装置、设备及介质 | |
Ramakrishna et al. | A platform for end-to-end mobile application infrastructure analytics using system log correlation | |
US20240119385A1 (en) | Methods and systems for discovery and monitoring of business flows | |
US20230100418A1 (en) | Metadata-driven data ingestion | |
CN117540368A (zh) | 一种数据泄露检测方法、装置、设备及存储介质 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 16861456 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 12018500934 Country of ref document: PH |
|
WWE | Wipo information: entry into national phase |
Ref document number: 11201803696Q Country of ref document: SG |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2018522941 Country of ref document: JP |
|
ENP | Entry into the national phase |
Ref document number: 2016351091 Country of ref document: AU Date of ref document: 20161025 Kind code of ref document: A |
|
ENP | Entry into the national phase |
Ref document number: 20187015528 Country of ref document: KR Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2016861456 Country of ref document: EP |