Method and apparatus for disambiguating transmit-by-exception telemetry from a multi-path, multi-tier network

• US 7,386,612 B2
• Filed: 06/18/2003
• Issued: 06/10/2008
• Est. Priority Date: 06/18/2003
• Status: Expired due to Fees

• Current Assignee: Honeywell International Inc.
• Original Assignee: Honeywell International Inc.
• Inventors: Rachlin, Elliott H.
• Primary Examiner(s): Lim; Krisna
• Assistant Examiner(s): Higa; Brendan Y.
• Application Number:
  US10/465,415
• Publication Number:
  US 20050021632A1
• Time in Patent Office: 1,819 Days
• Field of Search: 709220-226, 370/248, 370/252, 370/254, 370/400
• US Class Current: 709/224
• CPC Class Codes: H04L 41/00 Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 43/0811 by checking connectivity

Abstract

An apparatus and methods for disambiguating data elements transmitted by exception over a multi-path, multi-tiered communications network of nodes from at least one originating node to a destination node. A method includes the steps of receiving counter data from each node operable to originate data elements, receiving a data element name, evaluating counter data from nodes forming at least one possible path between the named data element'"'"'s originating node and said destination node; and indicating as unambiguous data associated with the data element name if each of the nodes forming the possible path are transmitting counter data to the destination node. The apparatus includes a processor coupled to the destination node and to a source of data element names, a memory containing a path database and instructions for searching the database for paths of the named data element and to update the database with data relating to counter data reception.

Claims

1. A method of disambiguating data elements, comprising the steps of:

transmitting by exception said data elements over at least one linear path of linked nodes in a multi-path, multi-tiered communications network of linked nodes from at least one originating node of the network to a destination node, each properly functioning network node operable to transmit unique counter data and a data element having a unique identifier;

receiving said unique counter data from each said properly functioning network node;

receiving at least one said unique identifier from a user;

detecting for said received unique counter data from each said network node forming at least one possible said linear path to said destination node from a particular network node intended to originate said data element having said unique identifier; and

indicating as unambiguous said data element having said unique identifier if said counter data has been received from each said network node forming said at least one possible path within an interval of time greater than or equal to the period of a highest frequency counter in said at least one possible path and less than or equal to the period of a lowest frequency counter in said at least one possible path.

2. The method of claim 1, wherein the step of detecting for said received unique counter data further comprises the step of searching a data structure associating each designed said linear path with each said network node included in said linear path.

3. The method of claim 2, wherein the step of searching said data structure comprises the step of searching a data structure autocoded from machine-readable data relating to said network.

4. The method of claim 2, wherein the step of detecting for said received unique counter data further comprises the step of producing an indicator of reception of said unique counter data.

5. The method of claim 4, wherein the step of producing an indicator of reception of said unique counter data comprises storing said indicator in said data structure autocoded from machine-readable data relating to said network.

6. The method of claim 5, wherein the step of storing said indicator comprises associating said indicator of reception of said unique counter data with data relating to a particular node originating said unique counter data.

7. The method of claim 6, wherein said network further comprises a properly functioning node inoperable to transmit said unique counter data, further comprising the step of setting to a constant said indicator of reception of said unique counter data for said node inoperable to transmit said unique counter data.

8. The method of claim 1, further comprising the step of indicating as ambiguous said data element having said unique identifier if said step of detecting determines there is no said linear path for which said unique counter data has been received from each said network node forming said linear path.

9. The method of claim 1, wherein the step of indicating comprises the step of supplying only unambiguous data to said user.

10. The method of claim 1, wherein the step of indicating comprises the step of supplying to said user a particular indicator of ambiguity associated with a particular data element.

11. The method of claim 1, further comprising designating a particular data element to be said counter.

12. A method of conditioning data including at least one data element to be transmitted by exception over at least one linear path of linked nodes in a multi-path, multi-tiered communications network of linked nodes to a destination node from a particular linked node operable to originate said at least one data element, said linked nodes each including a counter for producing unique counter data indicative of successful operation of said node, the method comprising the steps of:

determining from said unique counter data whether said at least one complete path from said particular linked node to said destination node exists; and

associating a first indicator with said at least one particular data element for which said at least one complete path exists within an interval of time greater than or equal to the period of a highest frequency counter in said at least one complete path and less than or equal to the period of a lowest frequency counter in said at least one complete path.

13. The method of claim 12, further comprising the step of associating a second indicator with said at least one particular data element for which no complete path exists.

14. The method of claim 12, further comprising the step of finding each designed path from each said linked node to said destination node in machine-readable data representing said network.

15. The method of claim 14, wherein the step of finding said each designed path further comprises the step of storing data representing said designed paths in a machine-searchable data structure.

16. The method of claim 12, wherein said step of determining comprises the step of, for said particular data element, finding at least one possible linear path to said destination node from said particular linked node originating said particular data element, inclusive.

17. The method of claim 16, wherein the step of finding at least one possible linear path further comprises the step of searching a data structure containing each designed path.

18. The method of claim 17, wherein the step of searching said data structure containing said each designed path comprises the step of searching a data structure auto-coded from data related to said network.

19. The method of claim 18, wherein the step of searching said data structure further comprises the step of searching a data structure compiled together with a data disambiguation computer program.

20. The method of claim 19, wherein the step of searching said data structure compiled together with said data disambiguation computer program comprises the step of searching a data structure auto-coded together with said data disambiguation computer program.

21. The method of claim 16, wherein said step of determining further comprises the step of, for each possible path, searching for said counter data associated with each said node comprising each said possible path.

22. The method of claim 21, wherein said step of searching for said counter data comprises the step of updating said data structure with indicators of reception of counter data based on counter data received at said destination node.

23. A method of disambiguating data in a multi-path, multi-tier communications network, comprising the steps of:

transmitting by exception at least one data element from at least one data source node toward a destination node over at least one path of said multi-path network, said path including a combination of said data source node, at least one relay node, and said destination node, said at least one data element having a value associated with a data element name, wherein each said node has a counter, each said counter operable to produce a counter data stream having a frequency when said each node is functioning properly;

transmitting a counter data stream from each properly functioning node of said at least one path towards said destination node; and

associating an unchanging data element with a first indicator when any of said counter data streams originating from said nodes comprising said at least one path are not received at said destination node within an interval of time greater than or equal to the period of a highest frequency counter in said at least one path and less than or equal to the period of a lowest frequency counter in said at least one path.

24. The method of claim 23, further comprising the step of associating an unchanging data element with a second indicator when said counter data streams originating from each of said nodes comprising said at least one path are received at said destination node.

25. The method of claim 23, wherein said properly functioning node originates a plurality of data streams and said counter data stream comprises a data stream selected from among said plurality of data streams and transmitted regardless of changes in said data stream.

26. The method of claim 23, further comprising the step of determining a plurality of possible paths in said multi-path network.

27. The method of claim 26, wherein the step of determining comprises using processor instructions auto-coded from a machine-readable representation of said multi-path, multi-tier communications network.

28. The method of claim 26, further comprising the step of examining each said counter data stream from each said node in at least one said possible path of said plurality of possible paths to determine whether a complete path exists.

29. The method of claim 23, wherein the step of associating comprises the step of associating within an average time less than the period of the lowest frequency counter in said at least one path.

30. An apparatus for improving the actions taken by an integrated vehicle health management system (IVHMS) by resolving ambiguities in vehicle telemetry data caused by communications network anomalies in a multi-path, multi-tier communications network having a plurality of source nodes linked to a plurality of relay nodes and a linked destination node, wherein said telemetry data includes at least one telemetry data element transmitted over the network through at least one linked relay node of said plurality of linked relay nodes, each said node having a counter, each counter operable to produce counter data when said node is operable, the apparatus comprising:

a processor;

a memory coupled to said processor;

a telemetry disambiguation program residing in said memory and executable in said processor to;

periodically update indicators relating to said counter data received from each said operable node based upon whether each related stream of said counter data received at said destination node is currently changing;

receive a telemetry data name from a user; and

respond to said telemetry data name and to said indicators relating to said changing counter data to disambiguate said telemetry data element within an interval of time greater than or equal to the period of a highest frequency counter in each of said related stream of said counter data and less than or equal to the period of a lowest frequency counter in each of said related stream of said counter data.

31. The apparatus of claim 30, wherein said user is said IVHMS.

32. The apparatus of claim 31, wherein said IVHMS is operable to change a vehicle state vector in response to said disambiguated telemetry.

33. The apparatus of claim 30, wherein said processor comprises a processor coupled to said destination node.

34. The apparatus of claim 30, further comprising network data structures residing in said memory, said data structures configured to associate each said indicator with a particular node originating said counter data to which said indicator relates.

35. The apparatus of claim 30, wherein said telemetry disambiguation program further comprises instructions executable to find in said network data structures, responsive to said telemetry data element name, at least one said indicator relating to said counter data from each said node.