PROVIDING DYNAMIC LATENCY IN AN INTEGRATION FLOW

• US 20170149641A1
• Filed: 11/20/2015
• Published: 05/25/2017
• Est. Priority Date: 11/20/2015
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Hosie, John, Ross, Martin A., Stirling, Craig H., Storey, Dominic J.
• Granted Patent: US 10,164,854 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 9/5033 considering data affinity
• CPC Class Codes: H04L 41/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]
• CPC Class Codes: H04L 43/0852 Delays

Abstract

Providing dynamic latency in an integration flow. An integration flow connecting multiple integration nodes and including at least one repeat node is managed, wherein a repeat node repeats by sending a message, a variation of a message, or an element of a message to multiple paths or to a single path multiple times. A repeat node is registered with a workload manager component for monitoring. Data relating to the effect on performance by the integration flow including the monitored repeat node is collected. Required latencies or variations of latencies between firing of repeats of the repeat node based on the collected data are determined. The latencies or variations of latencies between firing of the repeats of the repeat node are instructed to influence dynamically a flow of elements through the repeat node.

Claims

1. A computer-implemented method of providing dynamic latency in an integration flow, comprising:

managing an integration flow connecting multiple integration nodes and including at least one repeat node, wherein a repeat node repeats by sending one of a message, a variation of a message, or an element of a message to multiple paths or to a single path multiple times;

registering one repeat node of the at least one repeat node for monitoring with a workload manager component;

collecting data relating to an effect on performance by the integration flow including the one repeat node;

determining one of latencies or variations of latencies between firing of repeats of the one repeat node based on the collected data; and

instructing the one of the latencies or variations of latencies between firing of the repeats of the one repeat node to influence dynamically a flow of elements through the one repeat node.

2. The computer-implemented method as claimed in claim 1, further including:

determining a priority of a repeat of a selected repeat node based on a priority of an incoming message; and

weighting the latency for the repeats for the message based on the priority.

3. The computer-implemented method as claimed in claim 1, wherein the determining one of latencies or variations of latencies is based on an impact of repeats of the one repeat node on applications as determined by the collected data.

4. The computer-implemented method as claimed in claim 1, wherein the determining one of latencies or variations of latencies is based on an impact of repeats of the repeat node on components downstream of the integration flow as determined by the collected data.

5. The computer-implemented method as claimed in claim 1, wherein the collecting data relating to the effect on performance collects data from one or more of:

system resources, including applications or resources in the integration flow and in other integration flows, and applications or resources in systems effected by the one repeat node;

service level agreement components; and

application metrics.

6. The computer-implemented method as claimed in claim 1, wherein the workload manager component is an external component and the instructing provides additional code to the repeat node.

7. The computer-implemented method as claimed in claim 1, wherein the collecting data and the determining latencies between firing of repeats of the repeat node based on the collected data, includes:

determining whether one or more applications in a system or downstream of the system is reaching a predefined threshold of performance; and

instructing latencies in repeats of the repeat node for one or more applications.

8. The computer-implemented method as claimed in claim 7, further including learning correlations between instructed latencies in a particular repeat node and the effect on performance of applications.

9. The computer-implemented method as claimed in claim 7, wherein the applications are real time traffic serving applications and thresholds are set in service level agreements.

10. The computer-implemented method as claimed in claim 1, wherein the integration flow is an aggregation pattern and the one repeat node is an aggregation node with branching or iterating repeats.

11. The computer-implemented method as claimed in claim 1, wherein the instructing the latencies interrupts repeats of a chosen repeat node to throttle batch processing to provide a regulated flow of elements.

12. A computer system for providing dynamic latency in an integration flow, comprising:

a memory; and

a processor in communications with the memory, wherein the computer system is configured to perform a method, said method comprising;

managing an integration flow connecting multiple integration nodes and including at least one repeat node, wherein a repeat node repeats by sending one of a message, a variation of a message, or an element of a message to multiple paths or to a single path multiple times;

registering one repeat node of the at least one repeat node for monitoring with a workload manager component;

collecting data relating to an effect on performance by the integration flow including the one repeat node;

determining one of latencies or variations of latencies between firing of repeats of the one repeat node based on the collected data; and

instructing the one of the latencies or variations of latencies between firing of the repeats of the one repeat node to influence dynamically a flow of elements through the one repeat node.

13. The computer system as claimed in claim 12, wherein the method further includes:

determining a priority of a repeat of a selected repeat node based on a priority of an incoming message; and

weighting the latency for the repeats for the message based on the priority.

14. The computer system as claimed in claim 12, wherein the determining one of latencies or variations of latencies is based on an impact of repeats of the one repeat node on applications as determined by the collected data.

15. The computer system as claimed in claim 12, wherein the collecting data and the determining latencies between firing of repeats of the repeat node based on the collected data, includes:

determining whether one or more applications in a system or downstream of the system is reaching a predefined threshold of performance; and

instructing latencies in repeats of the repeat node for one or more applications.

16. The computer system as claimed in claim 12, wherein the integration flow is an aggregation pattern and the one repeat node is an aggregation node with branching or iterating repeats.

17. A computer program product for providing dynamic latency in an integration flow, comprising:

a computer readable storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising;

managing an integration flow connecting multiple integration nodes and including at least one repeat node, wherein a repeat node repeats by sending one of a message, a variation of a message, or an element of a message to multiple paths or to a single path multiple times;

registering one repeat node of the at least one repeat node for monitoring with a workload manager component;

collecting data relating to an effect on performance by the integration flow including the one repeat node;

determining one of latencies or variations of latencies between firing of repeats of the one repeat node based on the collected data; and

instructing the one of the latencies or variations of latencies between firing of the repeats of the one repeat node to influence dynamically a flow of elements through the one repeat node.

18. The computer program product as claimed in claim 17, wherein the method further includes:

determining a priority of a repeat of a selected repeat node based on a priority of an incoming message; and

weighting the latency for the repeats for the message based on the priority.

19. The computer program product as claimed in claim 17, wherein the determining one of latencies or variations of latencies is based on an impact of repeats of the one repeat node on applications as determined by the collected data.

20. The computer program product as claimed in claim 17, wherein the collecting data and the determining latencies between firing of repeats of the repeat node based on the collected data, includes:

determining whether one or more applications in a system or downstream of the system is reaching a predefined threshold of performance; and

instructing latencies in repeats of the repeat node for one or more applications.