High integrity data propagation in a braided ring

• US 7,606,179 B2
• Filed: 11/19/2004
• Issued: 10/20/2009
• Est. Priority Date: 11/19/2003
• Status: Active Grant

• Current Assignee: Honeywell International Inc.
• Original Assignee: Honeywell International Inc.
• Inventors: Paulitsch, Michael, Driscoll, Kevin, Hall, Brendan
• Primary Examiner(s): Cho; Hong
• Assistant Examiner(s): Tsegaye; Saba
• Application Number:
  US10/993,933
• Publication Number:
  US 20050135278A1
• Time in Patent Office: 1,796 Days
• Field of Search: 370/216, 370221-228, 370/254, 370/255, 370/258, 370/389, 370/390, 370/400, 370/404, 370/498, 709/239
• US Class Current: 370/258
• CPC Class Codes: H04L 12/43 with synchronous transmission, e.g. time division multiplex [TDM], slotted rings
• CPC Class Codes: H04L 12/437 Ring fault isolation or reconfiguration for SDH/SONET ring networks H04J3/085

Abstract

In one embodiment, a node comprises an interface to communicatively couple the node to a channel. The channel communicatively couples the node to a first neighbor node and a first neighbor'"'"'s neighbor node in a first direction. When the node relays relayed data along the channel, the node compares data received from the first neighbor node with data received from the first neighbor'"'"'s neighbor node. The relayed data comprises: at least one of: the data received from the first neighbor node and the data received from the first neighbor'"'"'s neighbor node; and information indicative of the results of the comparison.

Claims

1. A node comprising:

an interface to communicatively couple the node to a channel;

wherein the channel communicatively couples the node to a first neighbor node and a first neighbor'"'"'s neighbor node in a first direction;

wherein when the node relays along the channel, the node compares at least a portion of a first frame received from the first neighbor node with at least a portion of a second frame received from the first neighbor'"'"'s neighbor node; and

wherein the node relays;

at least one of;

the first frame received from the first neighbor node and the second frame received from the first neighbor'"'"'s neighbor node; and

information indicative of the results of the comparison, wherein the information indicative of the results of the comparison is relayed with the at least one of the first frame and the second frame.

2. The node of claim 1, wherein the channel communicatively couples the node to a second neighbor node and to a second neighbor'"'"'s neighbor node in a second direction.

3. The node of claim 2, wherein the channel comprises:

a first direct link that communicatively couples the node to the first neighbor node via the channel;

a first skip link the communicatively couples the node to the first neighbor'"'"'s neighbor node via the channel;

a second direct link that communicatively couples the node to the second neighbor node via the channel; and

a second skip link the communicatively couples the node to the second neighbor'"'"'s neighbor node via the channel.

4. The node of claim 2, wherein the node relays along the channel by relaying, to the second neighbor node and the second neighbor'"'"'s neighbor node, at least one of:

the first frame received from the first neighbor node and the second frame received from the first neighbor'"'"'s neighbor node, with the information indicative of the results of the comparison.

5. The node of claim 2, further comprising an interface to communicatively couple the node to a second channel, wherein the second channel communicatively couples the node to the second neighbor node and the second neighbor'"'"'s neighbor in the second direction and to the first neighbor node and the first neighbor'"'"'s neighbor in the first direction.

6. The node of claim 5, wherein when the node relays along the second channel, the node compares at least a third frame received from the second neighbor node with at least a portion of a fourth frame received from the second neighbor'"'"'s neighbor node;

and

wherein the node relays along the second channel;

at least one of;

the third frame received from the second neighbor node and the fourth frame received from the second neighbor'"'"'s neighbor node; and

information indicative of the results of the comparison, wherein the information indicative of the results of the comparison is relayed with the at least one of the third frame and the fourth frame.

7. The node of claim 5, wherein the second channel comprises a second ring.

8. The node of claim 6, wherein the node relays along the second channel by relaying to the first neighbor node and the first neighbor'"'"'s neighbor node the at least one of:

the third frame and the fourth frame with the information indicative of the results of the comparison.

9. The node of claim 1, wherein the channel comprises a ring.

10. The node of claim 1, wherein the comparison is a bit-by-bit comparison.

11. The node of claim 1, wherein the information indicative of the results of the comparison comprises a field appended to at least one of the first and second frames of data.

12. The node of claim 1, wherein:

each of the respective first and second frames of data comprises a shared field;

when the comparison indicates that the first and second frames are not identical, the node sets the comparison status field of the at least one of the first and second frames to a first value; and

the first value indicates that the frames are not identical.

13. A network comprising:

a plurality of nodes that are communicatively coupled to one another over a channel;

wherein the channel communicatively couples each node to a first neighbor node and a first neighbor'"'"'s neighbor node in a first direction;

wherein when each node relays along the channel, that node compares at least a portion of a first frame received from the first neighbor node of that node with at least a portion of a second frame received from the first neighbor'"'"'s neighbor node of that node; and

wherein that node relays;

at least one of;

the first frame received from the first neighbor node and the second frame received from the first neighbor'"'"'s neighbor node; and

information indicative of the results of the comparison, wherein the information indicative of the results of the comparison is relayed with the at least one of the first frame and the second frame.

14. The network of claim 13, wherein the first channel comprises a ring.

15. The network of claim 13, wherein the channel communicatively couples each node to a second neighbor node and to a second neighbor'"'"'s neighbor node in a second direction

16. The network of claim 15, wherein, when each node relays along the channel, that node relays the at least one of:

the first frame and the second frame with the information indicative of the results of the comparison to the second neighbor node of that node and the second neighbor'"'"'s neighbor node of that node.

17. The network of claim 15, further comprising a second channel, wherein the second channel communicatively couples each node to the second neighbor node of that node and the second neighbor'"'"'s neighbor of that node in the second direction and to the first neighbor node of that node and the first neighbor'"'"'s neighbor of that node in the first direction.

18. The network of claim 17, wherein when each node relays along the second channel, that node compares at least a portion of a third frame received from the second neighbor node of that node with at least a portion of a fourth frame received from the second neighbor'"'"'s neighbor node of that node;

wherein that node relays along the second channel;

at least one of;

the third frame received from the second neighbor node and the fourth frame received from the second neighbor'"'"'s neighbor node; and

information indicative of the results of the comparison, wherein the information indicative of the results of the comparison is relayed with the at least one of the third frame and the fourth frame.

19. The network of claim 17, wherein the second channel comprises a second ring.

20. The network of claim 17, wherein each node relays along the second channel by relaying to the first neighbor node of that and the first neighbor'"'"'s neighbor node of that node the at least one of:

the third frame and the fourth frame with the information indicative of the results of the comparison.

21. The network of claim 13, wherein the comparison is a bit-by-bit comparison.

22. A method of communicating in a network comprising a plurality of nodes that are communicatively coupled to one another over a channel, the method comprising:

comparing at least a portion of a first frame received at a node from a first neighbor node of the node via the channel with at least a portion of a second frame received at the node from a first neighbor'"'"'s neighbor node of the node via the channel;

relaying along the channel

at least one of;

the first frame and the second frame; and

information indicative of the results of the comparison, wherein the information indicative of the results of the comparison is relayed with the at least one of first frame and the second frame.

23. The method of claim 22, wherein the channel comprises a ring.

24. The method of claim 22, wherein the plurality of nodes is communicatively coupled to one another over a second channel and wherein the method further comprises:

comparing at least a portion of a third frame received at the node from a second neighbor node of the node via the second channel with at least a portion of a fourth frame received at the node from a second neighbor'"'"'s neighbor node of the node via the second channel;

relaying along the second channel;

at least one of;

the third frame and the fourth frame; and

information indicative of the results of the comparison, wherein the information indicative of the results of the comparison is relayed with the at least one of the third frame and fourth frame.

25. The method of claim 24, where the second channel comprises a second ring.

26. The method of claim 22, further comprising determining when the first neighbor node is scheduled to transmit and, when the first neighbor node is scheduled to transmit, receiving data transmitted by the first neighbor node and determining if the data transmitted by the first neighbor node complies with a policy.

27. A node comprising:

means for communicatively coupling the node to a channel, where the channel communicatively couples the node to a first neighbor node and a first neighbor'"'"'s neighbor node in a first direction;

means for comparing at least a portion of a first frame received at the node from the first neighbor node of the node via the channel with at least a portion of a second frame received at the node from the first neighbor'"'"'s neighbor node of the node via the channel; and

means for relaying along the channel;

at least one of;

the first frame and the second frame; and

information indicative of the results of the comparison, wherein the information indicative of the results of the comparison is relayed with the at least one of the first frame and the second frame.

28. A node comprising:

an interface to communicatively couple the node to a channel, wherein the channel communicatively couples the node to a plurality of receive-from nodes from which the node receives data on the channel; and

wherein when the node relays along the channel, the node compares at least a portion of a first frame received from a first one of the plurality of receive-from nodes to at least a portion of a second frame received from a second one of the plurality of receive-from nodes;

wherein the node relays along the channel;

at least one of;

the first frame and the second frame; and

information indicative of the results of the comparison, wherein the information indicative of the results of the comparison is relayed with the at least one of the first frame and the second frame.

29. The node of claim 28, wherein the channel communicatively couples the node to a plurality of transmit-to nodes and wherein, when the node relays along the channel, the node relays the at least one of:

the first frame and the second frame with the information indicative of the results of the comparison to the plurality of transmit-to nodes.

30. The node of claim 28, wherein, when the node compares the portion of the first frame received from the first one of the plurality of receive-from nodes to the portion of the second frame received from the second one of plurality the receive-from nodes, the node performs a bit-by-bit comparison.

31. The node of claim 28, wherein the information indicative of the results of the comparison comprises a field appended to the the at least one of the first frame and the second frame.

32. The node of claim 28, wherein the information indicative of the results is stored in a shared field.

33. The node of claim 28, wherein the interface couples the node to a plurality of channels.

34. The node of claim 28, wherein the channel is formed in at least one of a mesh and a ring.