DYNAMIC ADAPTATIONS FOR NETWORK DELAYS DURING COMPLEX EVENT PROCESSING

• US 20130132560A1
• Filed: 11/22/2011
• Published: 05/23/2013
• Est. Priority Date: 11/22/2011
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP AG (SAP SE)
• Inventors: Hudzia, Benoit, Dawson, Stephen, Hay, Alan
• Granted Patent: US 9,059,935 B2
• Time in Patent Office: Days
• US Class Current: 709/224
• CPC Class Codes: H04L 41/064 involving time analysis
• CPC Class Codes: H04L 47/283 in response to processing delays, e.g. caused by jitter or round trip time [RTT]

Abstract

A message handler may receive a plurality of messages associated with a plurality of events, the events having a temporal relationship to one another. A header inspector may extract latency information from the plurality of messages, the latency information characterizing a transmission duration experienced by each message in traveling from the one or more source nodes through the network. A window manager may correct a disruption in the temporal relationship between at least two events of the plurality of events, the disruption including relative differences in the transmission duration experienced by the at least two events, including relating the at least two events to a time window for processing the at least two events. An event processor may process the at least two events relative to the time window.

Claims

1. A system including instructions recorded on a computer-readable medium and executable by at least one processor, the system comprising:

a message handler configured to cause the at least one processor to receive a plurality of messages associated with a plurality of events, the events having a temporal relationship to one another;

a header inspector configured to cause the at least one processor to extract latency information from the plurality of messages, the latency information characterizing a transmission duration experienced by each message in traveling from the one or more source nodes through the network;

a window manager configured to cause the at least one processor to correct a disruption in the temporal relationship between at least two events of the plurality of events, the disruption including relative differences in the transmission duration experienced by the at least two events, including relating the at least two events to a time window for processing the at least two events; and

an event processor configured to cause the at least one processor to process the at least two events relative to the time window.

2. The system of claim 1, wherein the latency information includes aggregated latency information having been added incrementally at each node traversed by each message on its way from a corresponding source node.

3. The system of claim 1, wherein the latency information extracted from each message includes an aggregation of average transmission times between each pair of nodes traversed by the message on its way from a corresponding source node, the average transmission times having been added incrementally to the aggregation at each traversed node.

4. The system of claim 1, wherein the latency information extracted from each message includes an aggregation of a total number of hops experienced by the message on its way from a corresponding source node, each hop of the total number of hops having been added incrementally at each traversed node.

5. The system of claim 1, comprising:

a transmission time calculator configured to maintain a transmission time table which characterizing average transmission times between a node hosting the system and other network nodes connected by a single hop

6. The system of claim 1, comprising:

a header manager configured to update, within a header of each message received at the node hosting the system from a transmitting node one hop away therefrom, latency information including the average transmission time between the hosting node and the transmitting node.

7. The system of claim 1, wherein the network of nodes includes a peer-to-peer network.

8. The system of claim 1, wherein the window manager is configured to detect the disruption including comparing the latency information of each message with expected latency information for the corresponding message.

9. The system of claim 8, comprising a table manager configured to maintain the expected latency information including a latency table characterizing recent latency information determined with respect to previous messages traversing the network of nodes from a corresponding source node.

10. The system of claim 1, wherein the window manager comprises a view generator configured to display the latency information and/or the relation of the at least two events to the time window.

11. The system of claim 1, wherein the window manager comprises a delay adjuster configured to correct the disruption including delaying processing of at least one of the at least two events within a queue, in order to relate the at least two events relative to the time window in an order corresponding to an actual order of occurrence thereof.

12. The system of claim 1, wherein the window manager comprises a size manager configured to correct the disruption including adjusting a relative size of the time window in order to relate the at least two events within the adjusted time window in a manner corresponding to an actual occurrence thereof within the time window.

13. A computer-implemented method for executing instructions stored on a computer readable storage medium, the method comprising:

receiving a plurality of messages associated with a plurality of events, the events having a temporal relationship to one another;

extracting latency information from the plurality of messages, the latency information characterizing a transmission duration experienced by each message in traveling from the one or more source nodes through the network;

correcting a disruption in the temporal relationship between at least two events of the plurality of events, the disruption including relative differences in the transmission duration experienced by the at least two events, including relating the at least two events to a time window for processing the at least two events; and

processing the at least two events relative to the time window.

14. The method of claim 13, wherein the latency information includes aggregated latency information having been added incrementally at each node traversed by each message on its way from a corresponding source node.

15. The method of claim 13, wherein the correcting the disruption includes detecting the disruption including comparing the latency information of each message with expected latency information for the corresponding message.

16. A computer program product, the computer program product being tangibly embodied on a computer-readable storage medium and comprising instructions that, when executed, are configured to:

receive a plurality of messages associated with a plurality of events, the events having a temporal relationship to one another;

extract latency information from the plurality of messages, the latency information characterizing a transmission duration experienced by each message in traveling from the one or more source nodes through the network;

correct a disruption in the temporal relationship between at least two events of the plurality of events, the disruption including relative differences in the transmission duration experienced by the at least two events, including relating the at least two events to a time window for processing the at least two events; and

process the at least two events relative to the time window.

17. The computer program product of claim 16, wherein the latency information includes aggregated latency information having been added incrementally at each node traversed by each message on its way from a corresponding source node.

18. The computer program product of claim 16, wherein the disruption is corrected including comparing the latency information of each message with expected latency information for the corresponding message.

19. The computer program product of claim 16, wherein the instructions, when executed, are configured to correct the disruption including delaying processing of at least one of the at least two events within a queue, in order to relate the at least two events relative to the time window in an order corresponding to an actual order of occurrence thereof.

20. The computer program product of claim 16, wherein the instructions, when executed, are configured to correct the disruption including adjusting a relative size of the time window in order to relate the at least two events within the adjusted time window in a manner corresponding to an actual occurrence thereof within the time window.