ORDERING TELEMETRY MESSAGES

• US 20100023518A1
• Filed: 07/23/2008
• Published: 01/28/2010
• Est. Priority Date: 07/23/2008
• Status: Active Grant

• Current Assignee: Honeywell International Inc.
• Original Assignee: Honeywell International Inc.
• Inventors: Ghuman, Jetender, Pathakoti, Chandrashekar, Narayanaswamy, Prakash, Krishnan, Subramanian
• Granted Patent: US 8,041,720 B2
• Time in Patent Office: Days
• US Class Current: N/A
• CPC Class Codes: H04L 67/125 involving control of end-device applications over a network

Abstract

A method for ordering telemetry messages containing attributes individually not sufficient to establish total ordering is provided. An initial rank value is assigned for a first telemetry message. For a subsequent telemetry message, it is determined if an attribute of the subsequent telemetry message indicates an ordering of the subsequent telemetry message with respect to the first telemetry message. If the attribute indicates the ordering of the subsequent telemetry message, a subsequent rank value is assigned to the subsequent telemetry message one higher than a highest rank value already assigned, otherwise a correct slot of the subsequent message is determined by minimizing a distance from an S slot corresponding to the highest rank value already assigned to a first non-empty slot by application of a Lazy Walker algorithm.

Claims

1. A method for ordering telemetry messages containing attributes individually not sufficient to establish total ordering, comprising:

assigning an initial rank value for a first telemetry message; and

for a subsequent telemetry message, determining if an attribute of the subsequent telemetry message indicates an ordering of the subsequent telemetry message with respect to the first telemetry message, wherein if the attribute indicates the ordering of the subsequent telemetry message, assigning a subsequent rank value to the subsequent telemetry message one higher than a highest rank value already assigned, otherwise;

determining a correct slot for the subsequent telemetry message by minimizing a distance from an S slot corresponding to the highest rank value already assigned to a first non-empty slot by application of a Lazy Walker algorithm.

2. The method of claim 1, further including receiving the first and subsequent telemetry messages from a monitored asset.

3. The method of claim 1, further including recording the initial rank value for the first telemetry message and the subsequent rank value for the subsequent telemetry message in order to establish a total ordering relationship.

4. The method of claim 1, wherein determining a correct slot for the subsequent telemetry message includes determining if minimizing the distance results in a clockwise or counterclockwise walk from the S slot to the first non-empty slot.

5. The method of claim 4, wherein determining a correct slot for the subsequent telemetry message includes marking the subsequent telemetry message as a new message if a minimized distance results in a clockwise walk to the first non-empty slot.

6. The method of claim 5, wherein determining a correct slot for the subsequent telemetry message includes marking the subsequent telemetry message as a delayed message if the minimized distance results in a counterclockwise walk to the first non-empty slot.

7. The method of claim 6, further including assigning the subsequent rank value as a mean of rank values of left and right neighbors of the first non-empty slot if the minimized distance results in a counterclockwise walk to the first non-empty slot.

8. A system for ordering telemetry messages containing attributes individually not sufficient to establish total ordering, comprising:

an ordering module in communication with a monitored asset, wherein the ordering module is adapted for;

assigning an initial rank value for a first telemetry message,

for a subsequent telemetry message, determining if an attribute of the subsequent telemetry message indicates an ordering of the subsequent telemetry message with respect to the first telemetry message, wherein if the attribute indicates the ordering of the subsequent telemetry message, assigning a subsequent rank value to the subsequent telemetry message one higher than a highest rank value already assigned, otherwise;

determining a correct slot for the subsequent message by minimizing a distance from an S slot corresponding to the highest rank value already assigned to a first non-empty slot by application of a Lazy Walker algorithm.

9. The system of claim 8, wherein the ordering module is further adapted for receiving the first and subsequent telemetry messages from a monitored asset.

10. The system of claim 8, wherein the ordering module is further adapted for recording the initial rank value for the first telemetry message and the subsequent rank value for the subsequent telemetry message in order to establish a total ordering relationship.

11. The system of claim 8, wherein the ordering module is further adapted for determining if minimizing the distance results in a clockwise or counterclockwise walk from the S slot to the first non-empty slot.

12. The system of claim 11, wherein the ordering module is further adapted for at least one of:

marking the subsequent telemetry message as a new message if a minimized distance results in a clockwise walk from the S slot to the first non-empty slot, and

marking the subsequent telemetry message as a delayed message if the minimized distance results in a counterclockwise walk to the first non-empty slot.

13. The system of claim 12, wherein the ordering module is further adapted for assigning the subsequent rank value as a mean of rank values of left and right neighbors of the first non-empty slot if the minimized distance results in a counterclockwise walk to the first non-empty slot.

14. A computer program product for ordering telemetry messages containing attributes individually not sufficient to establish total ordering, the computer program product comprising a computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:

a first executable portion adapted for assigning an initial rank value for a first telemetry message; and

a second executable portion adapted for, for a subsequent telemetry message, determining if an attribute of the subsequent telemetry message indicates an ordering of the subsequent telemetry message with respect to the first telemetry message, wherein if the attribute indicates the ordering of the subsequent telemetry message, assigning a subsequent rank value to the subsequent telemetry message one higher than a highest rank value already assigned, otherwise;

determining a correct slot of the subsequent message by minimizing a distance from an S slot corresponding to the highest rank value already assigned to a first non-empty slot by application of a Lazy Walker algorithm.

15. The computer program product of claim 14, further including a third executable portion adapted for receiving the first and subsequent telemetry messages from a monitored asset.

16. The computer program product of claim 14, further including a third executable portion for recording the initial rank value for the first telemetry message and the subsequent rank value for the subsequent telemetry message in order to establish a total ordering relationship.

17. The computer program product of claim 14, wherein the second executable portion adapted for determining a correct slot of the subsequent message further includes a third executable portion for determining if minimizing the distance results in a clockwise or counterclockwise walk from the S slot to the first non-empty slot.

18. The computer program product of claim 17, wherein the second executable portion adapted for determining a correct slot for the subsequent telemetry message includes a fourth executable portion for marking the subsequent telemetry message as a new message if the minimized distance results in a clockwise walk from the S slot to the first non-empty slot.

19. The computer program product of claim 18, wherein the second executable portion adapted for determining a correct slot for the subsequent telemetry message includes a fifth executable portion for marking the subsequent telemetry message as a delayed message if the minimized distance results in a counterclockwise walk to the first non-empty slot.

20. The computer program product of claim 19, wherein the second executable portion adapted for determining a correct slot for the subsequent telemetry message includes a sixth executable portion for assigning the subsequent rank value as a mean of rank values of left and right neighbors of the first non-empty slot if the minimized distance results in a counterclockwise walk to the first non-empty slot.