US7606179B2 - High integrity data propagation in a braided ring - Google Patents

High integrity data propagation in a braided ring Download PDF

Info

Publication number
US7606179B2
US7606179B2 US10/993,933 US99393304A US7606179B2 US 7606179 B2 US7606179 B2 US 7606179B2 US 99393304 A US99393304 A US 99393304A US 7606179 B2 US7606179 B2 US 7606179B2
Authority
US
United States
Prior art keywords
node
neighbor
channel
frame
comparison
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active, expires
Application number
US10/993,933
Other languages
English (en)
Other versions
US20050135278A1 (en
Inventor
Brendan Hall
Kevin Driscoll
Michael Paulitsch
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Honeywell International Inc
Original Assignee
Honeywell International Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Honeywell International Inc filed Critical Honeywell International Inc
Priority to US10/993,933 priority Critical patent/US7606179B2/en
Priority to US11/010,249 priority patent/US7372859B2/en
Assigned to HONEYWELL INTERNATIONAL INC. reassignment HONEYWELL INTERNATIONAL INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: DRISCOLL, KEVIN R., HALL, BRENDAN, PAULITSCH, MICHAEL
Publication of US20050135278A1 publication Critical patent/US20050135278A1/en
Application granted granted Critical
Publication of US7606179B2 publication Critical patent/US7606179B2/en
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/42—Loop networks
    • H04L12/427—Loop networks with decentralised control
    • H04L12/43—Loop networks with decentralised control with synchronous transmission, e.g. time division multiplex [TDM], slotted rings
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/42—Loop networks
    • H04L12/437—Ring fault isolation or reconfiguration

Definitions

  • the following description relates to communication systems in general and to distributed, fault-tolerant communication systems in particular.
  • TTA Time-Triggered Architecture
  • TTP/C Time Triggered Protocol/C
  • FLEXRAY FLEXRAY protocol
  • at least one of the nodes in such a TTA system is coupled to one or more sensors and/or actuators over two replicated, low-speed serial communication channels using, for example, the Time Triggered Protocol/A (TTP/A).
  • TTP/A Time Triggered Protocol/A
  • each channel includes an independent, centralized bus guardian.
  • Each such centralized bus guardian represents a single point of failure for the respective channel.
  • another configuration of a TTA system is implemented using a linear bus topology in which various nodes communicate with one another over two, replicated communication channels and where each node includes a separate, independent bus guardian for each communication channel to which that node is coupled.
  • each node includes two independent bus guardians. Providing multiple independent bus guardians within each node, however, may not be suitable for some applications (for example, due to the increased cost associated with providing multiple bus guardians within each node).
  • 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.
  • 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.
  • a network comprises a plurality of nodes that are communicatively coupled to one another over a channel.
  • the channel communicatively couples each node to a first neighbor node and a first neighbor's neighbor node in a first direction.
  • that node compares data received from the first neighbor node of that node with data received from the first neighbor's neighbor node of that 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.
  • Another embodiment comprises a method of communicating in a network comprising a plurality of nodes that are communicatively coupled to one another over a channel.
  • the method comprises comparing data received at a node from a first neighbor node of the node via the channel with data received at the node from a first neighbor's neighbor node of the node via the channel.
  • the method further comprises relaying relayed data along the channel.
  • 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.
  • a node comprises an interface to communicatively couple the node to a channel.
  • the channel communicatively couples the node to a plurality of receive-from nodes from which the node receives data on the channel.
  • the node compares data received from a first one of the plurality of receive-from nodes to data received from a second one of the plurality of receive-from nodes.
  • the relayed data comprises: at least one of: the data received from the first one of the plurality of receive-from nodes and the data received from the second one of the plurality of receive-from nodes, and information indicative of the results of the comparison.
  • FIG. 1 is a block diagram of one embodiment of a communication network.
  • FIG. 2 is flow diagram of one embodiment of a method of transmitting data in the network of FIG. 1 .
  • FIG. 3A is flow diagram of an embodiment of a method of relaying data in the network of FIG. 1 .
  • FIG. 3B is flow diagram of an embodiment of a method of relaying data in the network of FIG. 1 .
  • FIGS. 4A-4B are flow diagrams of an embodiment of a method of relaying data in the network of FIG. 1 .
  • FIG. 5 is a block diagram illustrating logical components of a node that are used to implement, in one example, the comparison and relaying processing of the methods and shown in FIGS. 3 and 4 A- 4 B.
  • FIG. 6 is block diagram illustrating one example of a babbling idiot fault occurring in the network of FIG. 1 while such nodes are operating in a synchronized mode.
  • FIGS. 7A-7B are flow diagrams of one embodiment of a method of communicating in the network of FIG. 1 while operating in an unsynchronized mode.
  • FIG. 8 illustrates an exemplary scenario in which two cliques form in the network of FIG. 1 .
  • FIG. 9 is flow diagram of one embodiment of a method of resolving cliques in a network of FIG. 1 .
  • FIG. 10 is a block diagram illustrating one example of the operation of the method of FIG. 9 using an a priori ordering of the nodes of the network of FIG. 1 .
  • FIG. 11 is a block diagram of one embodiment of a node that is suitable for implementing each node of the network shown in FIG. 1 .
  • FIG. 12 is a flow diagram of one embodiment of a method of detecting directional integrity in the network of FIG. 1 .
  • FIG. 13 is a flow diagram of one embodiment of a method of reconstituting integrity in the network of FIG. 1 .
  • FIG. 14 is a flow diagram of one embodiment of a method of reconstituting integrity in the network of FIG. 1 .
  • FIG. 1 is a block diagram of one embodiment of a communication network 100 .
  • Communication network 100 includes multiple nodes 102 .
  • Each node 102 of the network 100 is communicatively coupled to at least one channel 106 .
  • the channel 106 communicatively directly couples (that is, with only one hop) each node 102 to at least two other nodes 102 from which that node 102 receives data (also referred to here as “receive-from nodes”) and to at least two other nodes 102 to which that node 102 transmits data (also referred to here as the “transmit-to nodes”).
  • one of the received-from nodes 102 is designated as a “primary” receive-from node 102 and the other receive-from nodes 102 are designated as “secondary” receive-from nodes 102 .
  • a node 102 “relays” data on a channel 106 in a given direction, that node 102 receives data from the primary receive-from node 102 for that channel 106 and direction and forwards the receive data onto each of the transmit-to nodes designated for that node 102 for that channel 106 and direction.
  • Data received by a node from the secondary receive-from nodes 102 is used for the various comparison operations described below and/or is relayed in the event that suitable data is not received from the primary receive-from node.
  • a given node 102 When a given node 102 “transmits” data (that is, when the given node 102 is the source of data communicated on the network 100 ) along a channel 106 in a given direction, that node 102 transmits the data to each of the transmit-to nodes 102 designated for that node 102 for that channel 102 and direction.
  • the nodes 102 are arranged in a ring 104 having a “braided ring” topology in which the nodes 102 communicate with one another over multiple communication channels 106 .
  • eight nodes 102 communicate with one another over two replicated communication channels 106 .
  • a different number and/or type of nodes 102 and/or channels 106 and/or a different network topology are used.
  • Embodiments of network 100 are implemented using various media access schemes.
  • the embodiment shown in FIG. 1 is described here as being implemented using time division multiple access (TDMA) media access scheme (for example, the media access scheme implemented in the TTP/C or FLEXRAY protocols).
  • TDMA time division multiple access
  • other media access schemes are used.
  • the eight nodes 102 shown in FIG. 1 are also individually labeled in FIG. 1 with the letters A through H and are referred to here individually as “node A,” “node B,” and so forth.
  • a “neighbor node” (or just “neighbor”) is a node that is immediately next to a given node 102 in the ring 104 .
  • Each node 102 has two “neighbor nodes 102 , one in the clockwise direction (also referred to here as the “clockwise neighbor node” or “clockwise neighbor”) and one in the counter-clockwise direction (also referred to here as the “counter-clockwise neighbor node” or “counter-clockwise neighbor”).
  • the neighbor nodes 102 for node A are node H in the clockwise direction and node B in the counter-clockwise direction.
  • a “neighbor's neighbor node” (or just “neighbor's neighbor”) for a given node 102 is the neighbor node 102 of the neighbor node 102 of the given node 102 .
  • Each node 102 has two neighbor's neighbor nodes 102 , one in the clockwise direction (also referred to here as the “clockwise neighbor's neighbor node” or “clockwise neighbor's neighbor”) and one in the counter-clockwise direction (also referred to here as the “counter-clockwise neighbor's neighbor node” or “counter-clockwise neighbor's neighbor”).
  • the two neighbor's neighbor nodes for node A are node G in the clockwise direction and node C in the counter-clockwise direction.
  • the two communication channels 106 are individually labeled in FIG. 1 (and are also referred to here) as “channel 0 ” and “channel 1 ” respectively.
  • each of the channels 106 is formed using multiple point-to-point, unidirectional serial links 108 .
  • Channel 0 interconnects the node 102 in the clockwise direction around the ring 104
  • channel 1 interconnects the nodes 102 in the counter-clockwise direction around the ring 104 .
  • other types of links are used.
  • bidirectional links are used and the devices, systems, and techniques described here are performed for each direction in which communications occur.
  • the link 108 when a link 108 is described as being connected “from” a first node 102 “to” a second node 102 , the link 108 provides a communication path for the first node 102 to send data to the second node 102 over the link 108 . That is, the direction of that unidirectional link 108 is from the first node 102 to the second node 102 .
  • a link 108 is connected from each node 102 to that node's clockwise neighbor node 102 .
  • a link 108 is also connected from each node 102 to that node's clockwise neighbor's neighbor node 102 .
  • a link 108 is connected from node A to node H and a link 108 is connected from node A to node G.
  • These clockwise links 108 make up channel 0 and are shown in FIG. 1 using solid lines.
  • a link 108 is connected from each node 102 to that node's counter-clockwise neighbor node 102 .
  • a link 108 is also connected from each node 102 to that node's counter-clockwise neighbor's neighbor node 102 .
  • a link 108 is connected from node A to node B and a link 108 is connected from node A to node C.
  • These counter-clockwise links 108 make up channel 1 and are shown in FIG. 1 using dashed lines.
  • the links 108 that connect a given node 102 to that node's respective clockwise and counter-clockwise neighbor nodes are also referred to here as “direct” links 108 .
  • the links 108 that connect a given node 102 to that node's respective clockwise and counter-clockwise neighbor's neighbors are referred to here as “skip” links 108 .
  • the receive-from nodes for each node 102 are that node's counter-clockwise neighbor and counter-clockwise neighbor's neighbor and the transmit-to nodes for each node 102 are that node's clockwise neighbor and clockwise neighbor's neighbor.
  • the primary receive-from node is node's counter-clockwise neighbor (though in other embodiments, the primary receive-from node is the node's counter-clockwise neighbor's neighbor). In the particular embodiment shown in FIG.
  • the receive-from nodes for each node 102 are that node's clockwise neighbor and clockwise neighbor's neighbor and the transmit-to nodes for each node 102 are that node's counter-clockwise neighbor and counter-clockwise neighbor's neighbor.
  • the primary receive-from node is node's clockwise neighbor.
  • the network 100 is implemented as a peer-to-peer network in which each transmission is intended to be received by each node 102 of the network 100 .
  • each transmission is intended for a particular destination node.
  • data are communicated in the network 100 in the form of frames of data though it is to be understood that, in other embodiments, other units of data are communicated over the network 100 .
  • the nodes 102 in the network 100 operate in at least two modes—an unsynchronized mode and a synchronized mode.
  • the nodes 102 When operating in a synchronized mode, the nodes 102 are synchronized to a global time base and transmit in accordance with a TDMA media access scheme.
  • a schedule is used to determine when the nodes 102 in the network 100 transmit during a given schedule period or round.
  • various nodes 102 in the network 100 are assigned a respective time slot in which to transmit.
  • the node 102 assigned to that time slot is allowed to transmit during that time slot (also referred to here as the “scheduled node” 102 ).
  • the scheduled node performs the processing described below in connection with FIG. 2 .
  • the other nodes 102 in the network 100 perform the relay processing described below in connection with FIGS. 3A-3B and 4 A- 4 B.
  • FIGS. 7A-7B illustrate at least a portion of the processing performed, in one embodiment, by the nodes 102 of the network 100 while operating in an unsynchronized mode.
  • FIG. 2 is flow diagram of one embodiment of a method 200 of transmitting data in the network 100 of FIG. 1 .
  • the embodiment of method 200 shown in FIG. 2 is described here as being implemented in the embodiment described here in connection with FIGS. 1-5 .
  • Method 200 is performed by a node 102 that is operating in a synchronized mode in accordance with a TDMA schedule.
  • Each node 102 performs the processing of method 200 when that node 102 is the scheduled node 102 (that is, when the current time slot is assigned to that node 102 by the TDMA schedule).
  • the node 102 that is performing the processing of method 200 is referred to here as the “current” node 102 .
  • at least a portion of the functionality described here as being performed by the current node 102 is implemented in a controller included in the node 102 .
  • Other embodiments of method 200 are implemented in other ways.
  • the current node 102 performs the processing of method 200 when the current node 102 determines that that node 102 , in accordance with the TDMA schedule, is allowed to transmit on the network 100 (block 202 ).
  • Each node 102 in the network 100 maintains information necessary to make such a determination. In the embodiment of FIGS. 1-5 , such information includes information related to the TDMA schedule and the global time base to which the nodes 102 are synchronized.
  • the current node 102 When the current node 102 is allowed to transmit and the node 102 has data to transmit (checked in block 204 ), the current node 102 transmits a frame of data, along channel 0 , to the current node's clockwise neighbor and clockwise neighbor's neighbor (block 206 ) and, along channel 1 , to the current node's counter-clockwise neighbor and counter-clockwise neighbor's neighbor (block 208 ).
  • the current node 102 transmits the frame to the current node's clockwise and counter-clockwise neighbors using the respective direct links 108 .
  • the current node 102 transmits the frame to the current node's clockwise and counter-clockwise neighbor's neighbors using the respective skip links 108 .
  • the current node 102 includes a first transceiver that transmits the frame on channel 0 to the current node's clockwise neighbor and clockwise neighbor's neighbor and a second transceiver that transmits the frame on channel 1 to the current node's counter-clockwise neighbor and counter-clockwise neighbor's neighbor.
  • FIG. 3A is flow diagram of one embodiment of a method 300 of relaying data in the network 100 of FIG. 1 .
  • the node 102 receives data from one or more receive-from nodes and forwards the received data onto the one or more transmit-to nodes. That is, when a node 102 is relaying data, the node 102 is not the source of the data that the node 102 is forwarding onto other nodes.
  • the embodiment of method 300 shown in FIG. 3A is described here as being implemented in the braided-ring embodiment described here in connection with FIGS. 1-5 . In other embodiments, method 300 is implemented using other network topologies.
  • One example of an alternative network topology in which method 300 can be implemented is a network topology that comprises two “simplex” ring channels.
  • the network uses a topology similar to the one shown in FIG. 1 except that there are no skip links that communicatively couple each node to its clockwise and counter-clockwise neighbor's neighbors.
  • Method 300 is performed by a node 102 that is operating in a synchronized mode in accordance with a TDMA schedule. Each node 102 , in such an embodiment, performs the processing of method 300 when one of that node's neighbors is the scheduled node 102 for the current time slot.
  • the node 102 performing the processing of method 300 is referred to here as the “current” node 102 .
  • the functionality described here as being performed by the current node 102 is implemented in a controller included in the node 102 .
  • Other embodiments of method 300 are implemented in other ways.
  • the current node 102 performs the processing of method 300 when the current node 102 determines that one of the neighbors of the current node 102 is scheduled to transmit during the current time slot (checked in block 302 ). Such a neighbor is also referred to here in the context of FIG. 3A as the “scheduled neighbor.” In the embodiment of FIGS. 1-5 , the current node 102 makes this determination based on information including the TDMA schedule and the global time base to which the nodes 102 are synchronized.
  • the current node 102 When the current node 102 determines that one of its neighbors is the scheduled node for the current time slot, the current node 102 only relays frames sourced from the scheduled neighbor that are received by the current node 102 from the scheduled neighbor via the direct link 108 that couples the scheduled neighbor to the current node 102 . That is, if the current node 102 receives a frame that is sourced from a node 102 other than the scheduled neighbor, the current node 102 does not relay that frame.
  • the current node 102 checks if the transmission complies with one or more policies that are implemented in the network 100 .
  • the current node 102 checks if the transmission complies with a temporal policy that specifies, for example, a particular window in which a transmission must start (checked in block 306 ).
  • the current node 102 checks if the transmission complies with the temporal transmission requirements of the supported protocol. In the embodiment shown in FIG.
  • the current node 102 if the transmission fails to comply with the temporal policy (for example, where a slightly-off-specification (SOS) fault occurs), the current node 102 does not relay the current frame (block 308 ). In an alternative embodiment (illustrated using dotted lines in FIG. 3A ), if the transmission fails to comply with the temporal policy, the current node 102 relays the current frame along with the information (for example, an appended or shared integrity field) indicating that the transmission has failed to comply with the temporal policy (block 309 ).
  • the information for example, an appended or shared integrity field
  • the current node 102 if the transmission fails to comply with a first aspect of the temporal policy, the current node 102 does not relay the transmission and if the transmission fails to comply with a different aspect of the temporal policy (while complying with the first aspect), the current node 102 relays the current frame along with information indicating that the transmission has failed to comply with that aspect of the policy.
  • the current node 102 checks if the transmission complies with one or more other policies (block 310 ). For example, in one embodiment, the current node 102 checks if the transmission complies with one or more semantic policies (for example, policies implementing semantic protocol state filtering). In another embodiment, where each frame includes a cyclic redundancy check (CRC) field that is calculated based on the contents of the frame, the current node 102 checks the CRC field to determine if any errors have been introduced into the frame in the course of transmitting the frame from the scheduled node to the current node 102 . Another example of such a policy is an encoding layer enforcement policy.
  • CRC cyclic redundancy check
  • a frame-length policy is used and the current node 102 checks the length of the current frame (in such an example, failures to comply with the frame-length policy would, for example, be processed as described in connection with block 309 of FIG. 3A ).
  • the current node 102 relays the current frame to the current node's next neighbor and next neighbor's neighbor along the channel from which the current frame is being received (block 312 ). For example, where the scheduled node is node A and the current node is node B, the current node relays the current frame to node C (node B's next neighbor along channel 1 ) and to node D (node B's next neighbor's neighbor along channel 1 ).
  • the current node 102 checks if the transmission complies with other policies instead of or in addition to the ones described above. For example, in one such other embodiment, the current node 102 checks the directional integrity of the transmission by the scheduled node (for example, in the manner described below in connection with FIG. 12 ) and appends to the frame a field indicating whether the frame was transmitted with directional integrity.
  • Method 350 is performed by a node 102 that is operating in a synchronized mode in accordance with a TDMA schedule. Each node 102 , in such an embodiment, performs the processing of method 350 when one of that node's neighbors is the scheduled node 102 for the current time slot. In the context of FIG. 3B , the node 102 performing the processing of method 350 is referred to here as the “current” node 102 . In one embodiment, at least a portion of the functionality described here as being performed by the current node 102 is implemented in a controller included in the node 102 . Other embodiments of method 350 are implemented in other ways.
  • the current node 102 performs the processing of method 350 when the current node 102 determines that one of the neighbors of the current node 102 is scheduled to transmit during the current time slot (checked in block 352 ). Such a neighbor is also referred to here in the context of FIG. 3B as the “scheduled neighbor.” In the embodiment of FIGS. 1-5 , the current node 102 makes this determination based on information including the TDMA schedule and the global time base to which the nodes 102 are synchronized.
  • method 350 when the current node 102 determines that one of its neighbors is the scheduled node for the current time slot, the current node 102 only relays frames sourced from the scheduled neighbor that are received by the current node 102 from the scheduled neighbor via the direct link 108 that couples the scheduled neighbor to the current node 102 . That is, if the current node 102 receives a frame that is sourced from a node 102 other than the scheduled neighbor, the current node 102 does not relay that frame. However, unlink in method 300 of FIG. 3A , in method 350 of FIG. 3B , the current node 102 does not perform the “bus guardian” processing associated with blocks 308 - 310 .
  • the current node 102 When the current node 102 start receiving a frame from the scheduled neighbor (checked in block 354 ), the current node 102 relays the received frame to the current node's next neighbor and next neighbor's neighbor along the channel from which that frame is being received (block 356 ). For example, where the scheduled node is node A and the current node is node B, the current node relays the frame received from node A to node C (node B's next neighbor along channel 1 ) and to node D (node B's next neighbor's neighbor along channel 1 ).
  • FIGS. 4A-4B are flow diagrams of one embodiment of a method 400 of relaying data in the network 100 of FIG. 1 .
  • the embodiment of method 400 shown in FIGS. 4A-4B is described here as being implemented in the embodiment described here in connection with FIGS. 1-5 .
  • Method 400 is performed by a node 102 that is operating in a synchronized mode in accordance with a TDMA schedule.
  • Each node 102 performs the processing of method 400 when that node 102 is not scheduled to transmit during the current time slot and neither of that node's neighbors are scheduled to transmit during the current time slot.
  • the current node 102 performs the processing of method 400 when the current node 102 is not scheduled to transmit during the current time slot and neither of the current node's neighbors are scheduled to transmit during the current time slot (checked in block 402 of FIG. 4A ). In the embodiment of FIGS. 1-5 , the current node 102 makes this determination based on information including the TDMA schedule and the global time base to which the nodes 102 are synchronized.
  • the current node 102 determines that the current node 102 is not scheduled to transmit during the current time slot and neither of the current node's neighbors are scheduled to transmit during the current time slot and the current node 102 starts to receive a frame from the current node's counter-clockwise neighbor on channel 0 (checked in block 404 ).
  • the current node 102 compares the frame being received from the current node's counter-clockwise neighbor on channel 0 to any frame that is being received from the current node's counter-clockwise neighbor's neighbor on channel 0 (block 406 ). In the embodiment shown in FIG. 4 , a bit-by-bit comparison is performed. Moreover, as described below in connection FIG.
  • de-skew functionality is used to de-skew the received frames.
  • the current node 102 relays the frame that is being received from the current node's counter-clockwise neighbor on channel 0 to the current node's clockwise neighbor and clockwise neighbor's neighbor along the channel 0 (block 408 ).
  • the current node 102 relays information indicative of the results of the comparison in or after the frame received from the current node's counter-clockwise neighbor (block 410 ).
  • the current node 102 relays the information indicative of the results of the comparison to the current node's clockwise neighbor and clockwise neighbor's neighbor along the channel 0 .
  • the information indicative of the results of the comparison comprises a one-bit, appended integrity field that the current node 102 appends to the frame received from the current node's counter-clockwise neighbor.
  • a shared integrity field is included at the end of each frame.
  • the current node 102 sets the shared integrity field to a “negative” value (for example, a value of “0”) if the comparison indicates that the two frames are not identical and, otherwise, does not alter the shared integrity field if the comparison indicates that the two frames are identical.
  • the current node 102 If the current node 102 does not receive a frame from the current node's counter-clockwise neighbor on channel 0 (for example, after a predetermined time-out period has elapsed) but starts to receive a frame from the current node's counter-clockwise neighbor's neighbor on channel 0 (checked in block 412 ), the current node 102 relays the frame that is being received from the current node's counter-clockwise neighbor's neighbor on to the current node's clockwise neighbor and clockwise neighbor's neighbor along the channel 0 (block 414 ).
  • the current node 102 relays in or after that frame information indicating that there was a “mismatch” at the current node 102 for channel 0 (block 416 ).
  • the current node 102 relays this information to the current node's clockwise neighbor and clockwise neighbor's neighbor along the channel 0 . Because no frame was received from the counter-clockwise neighbor of the current node 102 , it is not the case that a frame received from the counter-clockwise neighbor is identical to the frame received from the counter-clockwise neighbor's neighbor of the current node 102 .
  • the current node 102 does not receive a frame from the current node's counter-clockwise neighbor on channel 0 or from the current node's counter-clockwise neighbor's neighbor on channel 0 , the current node 102 does not relay any data along channel 0 for the current time slot (block 418 ).
  • the current node 102 performs the same processing for frames received from channel 1 .
  • the current node 102 determines that the current node 102 is not scheduled to transmit during the current time slot and neither of the current node's neighbors are scheduled to transmit during the current time slot and the current node 102 starts to receive a frame from the current node's clockwise neighbor on channel 1 (checked in block 420 of FIG. 4B )
  • the current node 102 compares the frame being received from the current node's clockwise neighbor on channel 1 to any frame that is being received from the current node's clockwise neighbor's neighbor on channel 1 (block 422 ). In the embodiment shown in FIG. 4 , a bit-by-bit comparison is performed.
  • de-skew functionality is used to de-skew the received frames.
  • the current node 102 relays the frame that is being received from the current node's clockwise neighbor on channel 1 to the current node's counter-clockwise neighbor and counter-clockwise neighbor's neighbor along the channel 1 (block 424 ). After the current frame has been relayed and the comparison is complete, the current node 102 relays information indicative of the results of the comparison in or after the frame received from the current node's clockwise neighbor (block 426 ).
  • the current node 102 If the current node 102 does not receive a frame from the current node's clockwise neighbor on channel 1 (for example, after a predetermined time-out period has elapsed) but starts to receive a frame from the current node's clockwise neighbor's neighbor on channel 1 (checked in block 428 ), the current node 102 relays the frame that is being received from the current node's clockwise neighbor's neighbor on to the current node's counter-clockwise neighbor and counter-clockwise neighbor's neighbor along the channel 1 (block 430 ). After that frame has been relayed, the current node 102 relays in or after that frame information indicating that there was a “mismatch” at the current node 102 for channel 1 (block 432 ).
  • the current node 102 relays this information to the current node's counter-clockwise neighbor and counter-clockwise neighbor's neighbor along the channel 1 . Because no frame was received from the clockwise neighbor of the current node 102 , it is not the case that a frame received from the clockwise neighbor is identical to the frame received from the clockwise neighbor's neighbor of the current node 102 .
  • the current node 102 does not receive a frame from the current node's clockwise neighbor on channel 1 or from the current node's clockwise neighbor's neighbor on channel 1 , the current node 102 does not relay any data along channel 1 for the current time slot (block 434 ).
  • the current node 102 is node A and node E is the node that is scheduled to transmit during the current time slot.
  • node A receives a frame from node B (node A's counter-clockwise neighbor) via the respective direct link 108 of channel 0 and compares this frame to any frame node A receives from node C (node A's counter-clockwise neighbor's neighbor) via the respective skip link 108 of channel 0 .
  • Node A relays the frame that is being received from node B and the information indicative of the results of the comparison to node H (node A's next neighbor along channel 0 ) and to node G (node A's next neighbor's neighbor along channel 0 ).
  • node A also receives a frame from node H (node A's clockwise neighbor) via the respective direct link 108 of channel 1 and compares this frame to any frame node A receives from node G (node A's clockwise neighbor's neighbor) via the respective skip link 108 of channel 1 .
  • Node A relays the frame received from node H and the information indicative of the results of the comparison to node B (node A's next neighbor along channel 1 ) and to node C (node A's next neighbor's neighbor along channel 1 ).
  • the current node 102 if frames are received by the current node 102 on both the direct link 108 and the skip link 108 , the current node 102 relays the frame received on the direct link 108 . In other embodiments, if frames are received by the current node 102 on both the direct link 108 and the skip link 108 , the current node 102 relays the frame received on the skip link 108 .
  • FIG. 5 is a block diagram illustrating logical components of a node 102 that are used to implement, in one example, the comparison and relaying processing of methods 300 and 400 of FIGS. 3 and 4 A- 4 B, respectively.
  • the node 102 that is performing the particular comparison and relaying processing is referred to, in the context of FIG. 5 , as the current node 102 .
  • the logical components of the current node 102 used to the perform comparison and relaying processing for frames received on channel 0 are shown in FIG. 5 . It is to be understood the comparison and relaying processing for frames received on channel 1 are performed using logical components similar to those shown in FIG. 5 .
  • the current node 102 includes a first direct link interface 502 that communicatively couples the current node 102 to the counter-clockwise direct link 108 of channel 0 , which is connected to the current node's counter-clockwise neighbor.
  • the current node 102 also includes a first skip link interface 504 that communicatively couples the current node 102 to the counter-clockwise skip link 108 of channel 0 , which is connected to the current node's counter-clockwise neighbor's neighbor.
  • a direct link first-in-first-out (FIFO) buffer 506 is coupled to the first direct link interface 502 and a skip link FIFO buffer 508 is coupled to the first skip link interface 504 .
  • the first direct link interface 502 and the first skip link interface 504 receive data from the direct link 108 and the skip link 108 , respectively, and store the received data in the direct link FIFO buffer 506 and the skip link FIFO buffer 508 , respectively.
  • the current node 102 includes a second direct link interface 510 that communicatively couples the current node 102 to the clockwise direct link 108 of channel 0 , which is connected to the current node's clockwise neighbor.
  • the current node 102 also includes a second skip link interface 512 that communicatively couples the current node 102 to the clockwise skip link 108 of channel 0 , which is connected to the current node's clockwise neighbor's neighbor.
  • the current node 102 includes a de-skew and compare module 514 that “de-skews” and compares the frames received from the current node's counter-clockwise neighbor and counter-clockwise neighbor's neighbor.
  • the current node 102 includes a single transmitter 516 that is used to transmit data to both the current node's clockwise neighbor and the current node's clockwise neighbor's neighbor.
  • the output of the transmitter 516 is coupled to both the second direct link interface 510 and the second skip link interface 512 in order to transmit to the current node's clockwise neighbor and the current node's clockwise neighbor's neighbor, respectively.
  • the current node 102 For given transmission during a given time slot, the current node 102 will typically receive start receiving respective frames on the first direct link interface 502 and the first skip link interface 504 at different times. For example, where the comparison and relaying processing is performed in connection with blocks 406 - 410 and 414 - 418 of FIG. 4 , the current node 102 , for a given transmission, will typically start receiving a frame on the first skip link interface 504 before the current node 102 starts receiving a corresponding frame on the first direct link interface 502 .
  • the frame received at the first skip link interface 504 travels through one less hop than the frame received on the first direct link interface 502 (that is, the frame received on the first skip link interface 504 “skips” the current node's counter-clockwise neighbor).
  • a bit-by-bit comparison of the two received frames is performed by the de-skew and compare module 514 .
  • the received data is written into the input end of the direct link FIFO buffer 506 .
  • the received data is written into the input end of the skip link FIFO buffer 508 .
  • the determination as to whether a frame is being received on the first direct link interface 502 is made by detecting a start-of-frame delimiter in the data received from that interface 502 .
  • the determination as to whether a frame is being received on the first skip link interface 504 is made by detecting a start-of-frame delimiter in the data received from that interface 504 .
  • the de-skew and compare module 514 starts receiving bits from the respective outputs ends of the first and second FIFO buffers 506 and 508 and the transmitter 516 start receiving bits from the output end of the FIFO buffer 506 .
  • the de-skew and compare module 514 as it receives bits from the first and second FIFO buffers 506 and 508 , performs the bit-by-bit comparison of the two received frames.
  • the transmitter 516 as it receives bits from the first FIFO buffer 506 , relays the received bits along channel 0 to the counter-clockwise neighbor and counter-clockwise neighbor's neighbor.
  • the de-skew and compare module 514 outputs, to the transmitter 516 , a bit that indicates whether the two frames were or were not identical.
  • the transmitter 516 receives the bit output by the de-skew and compare module 514 and “appends” the bit to the end of the relayed frame by transmitting the bit after the relayed frame.
  • the de-skew and compare module 514 and the transmitter 516 start receiving bits from the output end of the first FIFO buffer 506 .
  • the de-skew and compare module 514 outputs, to the transmitter 516 , a bit that indicates that a mismatch has occurred for channel 0 at the current node 102 .
  • the transmitter 516 as it receives bits from the first FIFO buffer 506 , relays the received bits along channel 0 to the counter-clockwise neighbor and counter-clockwise neighbor's neighbor.
  • the transmitter 516 receives the bit output by the de-skew and compare module 514 and “appends” the bit to the end of the relayed frame by transmitting the bit after the relayed frame.
  • the de-skew and compare module 514 and the transmitter 516 start receiving bits from the output end of the second FIFO buffer 508 .
  • the de-skew and compare module 514 outputs, to the transmitter 516 , a bit that indicates that a mismatch has occurred for channel 0 at the current node 102 .
  • the transmitter 516 as it receives bits from the second FIFO buffer 508 , relays the received bits along channel 0 to the counter-clockwise neighbor and counter-clockwise neighbor's neighbor.
  • the transmitter 516 receives the bit output by the de-skew and compare module 514 and “appends” the bit to the end of the relayed frame by transmitting the bit after the relayed frame.
  • Embodiments of network 100 provide improved fault tolerance while the nodes 102 of the network 100 are operating in a synchronous mode.
  • embodiments of network 100 provide improved transport availability and improved transport integrity. Improved transport availability is provided by, for example, the use of the two, independent opposing communication channels 0 and 1 .
  • Data that is transmitted by a node 102 in the network 100 travels to each of the other nodes 102 in the network 100 via two independent communication paths.
  • data transmitted by node A of the network 100 travels to node E via a first path traveling counter-clockwise on channel 0 from node A to nodes B, C, D, and E and via a second path traveling clockwise on channel 1 from node A to nodes H, G, F, and E.
  • a CRC protocol field is included in each frame that is transmitted around the network 100 .
  • Such CRC fields are well-suited for addressing random errors. Errors resulting from noise on the direct links 108 between a transmitting node and the transmitting node's clockwise neighbor and counter-clockwise neighbor have such a random nature.
  • errors introduced by an active inter-stage may be correlated in nature, such that a CRC field may not be well-suited for addressing such errors.
  • the bit-by-bit comparison performed by a node 102 when performing the processing of method 400 will detect any errors introduced by a previous node, thereby addressing such active inter-stage induced errors. Relaying in this manner improves transport integrity in the network 100 .
  • FIG. 6 is block diagram illustrating one example of a babbling idiot fault occurring in the network 100 of FIG. 1 while such nodes 102 are operating in a synchronized mode.
  • each node 102 in the network 100 implements the methods 200 , 300 , and 400 of FIGS. 2-4 .
  • node A has a babbling idiot fault during the time slot in which node E is scheduled to transmit. The fault causes node A to transmit to node A's clockwise neighbor node H along channel 0 and to node A's counter-clockwise neighbor node B along channel 1 .
  • node H When node H receives from channel 0 the frame transmitted by node A, the comparison that node H performs between the frame received from node A (node H's counter-clockwise neighbor) and the frame received from node B (node H's counter-clockwise neighbor's neighbor) will indicate that the two frames are not identical. As result, node H relays on channel 0 the frame received from node A along with information indicating that a mismatch occurred at node H.
  • the links 108 of channel 0 and channel 1 that are affected by node A's transmission are shown in FIG. 6 using dashed lines.
  • the direct link 108 in channel 0 from node A to node H and the direct and skip links 108 in channel 0 from nodes H to node G, from node G to node F, and from node F to node E are affected by the faulty transmission by node A.
  • the direct link 108 in channel 1 from node A to node B and the direct and skip links 108 in channel 1 from node B to node C, from node C to node D, and from node D to node E are affected by the faulty transmission by node A.
  • a SOS failure occurs in node A.
  • faulty node A transmits at a point in time that would (if node A's transmissions were relayed fully around the ring 104 ) result in nodes B, C, H and G receiving the transmission as correct and nodes D, E, and F receiving the transmission as incorrect.
  • Nodes B and H as neighbors of node A, will check if the transmission by node A complies with the temporal policy implemented in the network 100 .
  • node B will determine that the frame received from node A on channel 1 does not comply with the temporal policy and, therefore, will not relay the frame any further along channel 1 .
  • node H will determine that the frame received from node A on channel 0 does not comply with the temporal policy and, therefore, will not relay the frame any further along channel 0 . In this way, the impact of such SOS failures is reduced.
  • the particular embodiment of method 700 shown in FIGS. 7A-7B performed by the current node 102 when that node “wakes up” (checked in block 702 of FIG. 7 ).
  • the current node 102 wakes up when that node 102 is initially powered-on or after the node 102 has been reset.
  • the current node 102 does not relay any data that the current node 102 receives from any of the links 108 for a predetermined period of time (block 704 ). That is, the current node 102 “blocks” any transmissions made by other nodes 102 in the network 100 by not relaying the data from such transmissions any further along the channels 0 and 1 of the network 100 .
  • the current node 102 relays that data along channel 0 to the current node's clockwise neighbor node and clockwise neighbor's neighbor (block 710 ).
  • the relay period When the relay period has elapsed (checked in block 714 ), the current node 102 does not relay, for a predetermined period of time, data received on channel 0 that was sourced by the counter-clockwise neighbor. This predetermined period of time is also referred to here as the “second block period.” In one implementation of such an embodiment where the TTP/C protocol is used, the relay period is at least long enough for another node 102 in the network 100 to initiate the transmission of a cold start message.
  • the current node 102 After the second block period elapses (checked in block 718 ), the current node 102 ceases blocking data received on channel 0 that was sourced by the counter-clockwise neighbor (looping back to 706 ).
  • Similar processing is performed for channel 1 after the first block period has elapsed.
  • the current node 102 checks if the clockwise neighbor sourced the received data (block 722 ). In one embodiment, the current node 102 makes this determination by checking, for a predetermined period of time, if the current node 102 is receiving the same data from the current node's clockwise neighbor's neighbor on channel 1 as the current node 102 is receiving from the clockwise neighbor on channel 1 .
  • the current node 102 determines that it is not receiving the same data from the current node's clockwise neighbor's neighbor on channel 1 , the current node 102 concludes that the clockwise neighbor is the source of the data being received from that neighbor. If the current node 102 determines that it is receiving the same data from the current node's clockwise neighbor's neighbor on channel 1 , the current node 102 concludes that the clockwise neighbor is not the source of the data being received from that neighbor.
  • the current node 102 relays that data along channel 1 to the current node's counter-clockwise neighbor node and counter-clockwise neighbor's neighbor (block 724 ).
  • the current node 102 If the clockwise neighbor sourced the data being received from that neighbor, the current node 102 , for the relay period, relays data received on channel 1 that was sourced by the clockwise neighbor (block 726 ). The current node 102 relays such data along channel 1 to the current node's counter-clockwise neighbor node and counter-clockwise neighbor's neighbor. During the relay period, the current node 102 does not relay any data received on channel 1 that was sourced by a node other than the current node's clockwise neighbor.
  • the current node 102 does not relay, for the second block period, data received on channel 1 that was sourced by the clockwise neighbor.
  • the current node 102 if the current node 102 receives data on channel 1 that was not sourced by the clockwise neighbor, the current node 102 relays the received data along channel 1 to the current node's counter-clockwise neighbor node and counter-clockwise neighbor's neighbor (block 730 ). In the embodiment shown in FIGS.
  • the current node 102 determines if data received on channel 1 was sourced by the clockwise neighbor by comparing the data received from the clockwise neighbor to any corresponding data received from the current node's clockwise neighbor's neighbor on channel 1 . After the second block period has elapsed (checked in block 732 ), the current node 102 ceases blocking data received on channel 1 that was sourced by the clockwise neighbor (looping back to 720 ).
  • the current node 102 is node A and the nodes 102 in the network 100 are operating in an unsynchronized mode (for example, during initial system startup).
  • node A When node A first powers on and wakes up, node A does not relay any data it receives for the first block period. After the first block period has elapsed, node A receives data from node B on channel 0 (that is, from node A's counter-clockwise neighbor).
  • node B sourced the received data because node A did not receive, within the predetermined comparison period, the same data from node C (node A's counter-clockwise neighbor's neighbor).
  • Node A (the current node 102 in this example) relays data received from node B for the relay period. During the relay period, node A does not relay any data received by node A that was sourced by nodes other than node B. After the relay period elapses, for the second block period, node A does not relay data received on channel 0 that was sourced by node B and relays data received on channel 0 that was sourced from a node other than node B. After the second block period has elapsed, node B ceases blocking data receiving on channel 0 that was sourced by node B.
  • node B has a babbling idiot fault that causes node B to source data continuously
  • the current node 102 node A
  • the current node 102 will limit the impact of node B's fault by blocking node B's transmission during the second block period and instead relaying data sourced by other nodes in the network 100 .
  • one or more of the first and second block periods and the relay period are configurable.
  • the current node 102 instead of blocking or relaying data received at the current node 102 based on whether that data was sourced from a respective neighbor, the current node 102 relays the data regardless of whether such data was sourced from a respective neighbor and includes, with the relayed data, information indicating whether the relayed data was or was not sourced by the respective neighbor of the current node 102 .
  • the comparison functionality described above in connection with FIGS. 2-5 is used to generate such information.
  • a one-bit field is appended to the relayed data that indicates whether or not the respective neighbor of the current node 102 sourced the relayed data. These appended fields can be used, for example, as a “hop count” in source identification processing.
  • the current node 102 upon detecting that data received at the current node 102 was sourced by a neighbor, determines if the transmission complies with one or more policies implemented in the network 100 and, if such transmission does not comply with one or more such policies, either does not relay the received data or relays the data along with the information indicating non-compliance with such policies (for example, by appending a one-bit integrity field or by altering a shared integrity field included in the data).
  • FIG. 8 illustrates an exemplary scenario in which two cliques form in the network 100 of FIG. 1 .
  • Each of the cliques has a separate TDMA schedule 802 or 804 according to which the nodes 102 in the respective clique transmit.
  • the time slots in the both schedules 802 and 804 are the same size and the schedules 802 and 804 are almost 180 degrees out of phase with each other.
  • Schedule 802 is associated with a clique that includes nodes A, H, G, and F (also referred to here as the “clique 1 ”) and schedule 804 is associated with a clique that includes nodes E, B, C, and D (also referred to here as the “clique 2 ”).
  • the order in which the nodes 102 in the network transmit is node A, node E, node H, node B, node G, node C, node F, and node D, with each of the nodes E, B, C, and D starting its transmission one-half slot behind each of nodes A, H, G, and F, respectively.
  • FIG. 9 is flow diagram of one embodiment of a method 900 of resolving cliques in a network 100 of FIG. 1 .
  • the embodiment of method 900 shown in FIG. 9 is suitable for resolving the cliques formed in the example shown in FIG. 8 .
  • Method 900 is suitable for use when the nodes 102 in the ring 104 are operating in a synchronized mode in which two or more cliques have formed.
  • the node 102 that is performing the processing of method 900 is referred to here as the “current” node 102 .
  • at least a portion of the functionality described here as being performed by the current node 102 is implemented in a controller included in the node 102 .
  • Other embodiments of method 900 are implemented in other ways.
  • the functionality of method 900 is used when the current node 102 is operating in a synchronous mode (that is, when the nodes 102 in each clique are transmitting according to a TDMA schedule). While operating in synchronous mode, the current node 102 listens in a synchronous manner for data from the both of the current node's neighbor (block 902 ). That is, the current node 102 listens for frames from its clockwise neighbor on channel 1 and for frames from its counter-clockwise neighbor on channel 0 during the time slots defined by the current transmission schedule recognized by the current node 102 . The current node 102 determines if it has not received a valid frame from either of the current node's neighbors for a predetermined period of time (checked in block 904 ).
  • a neighbor from which the current node 102 has not received a valid frame for the given period of time is referred to here as a “silent neighbor.”
  • a “valid” frame is a frame that is syntactically correct and that is in agreement with the current node's schedule position.
  • the validity of schedule alignment may be validated by explicit schedule data transmitted within the contents of a frame.
  • the schedule position data may be sent implicitly in the contents of a frame (for example, as described in the H0005061 Application).
  • the current node 102 listens asynchronously for data from the silent neighbor's neighbor for the given period of time (block 906 ).
  • the given period of time is equal to one TDMA round. In another embodiment, this time period is zero (that is, the current node 102 continuously listens in an asynchronous mode for valid frames from the current node's neighbor's neighbors on the skip links 108 ).
  • the current node 102 When the current node 102 listens asynchronously for data from such a silent neighbor's neighbor, the current node 102 will be able to receive any syntactically valid frame sent from the silent neighbor's neighbor irrespective of transmission time or phase. As result, the current node 102 will be able receive messages from a clique of which the current node 102 is not a member. If the current node 102 does not receive a valid frame from the silent neighbor's neighbor within the given period of time while listening asynchronously, the current node 102 remains in the clique of the current node 102 is currently a member (also referred to here as the “current clique”) (block 920 ).
  • the current node 102 When the current node 102 receives a valid frame from the silent neighbor's neighbor while listening asynchronously (checked in block 908 ), the current node 102 asynchronously listens for a second valid frame from the silent neighbor for the given period of time (block 910 ). If the current node 102 does not receive a valid from the silent neighbor within the given period of time while listening asynchronously (checked in block 912 ), the current node 102 remains in the current clique (block 920 ). If the current node 102 receives a valid frame from the silent neighbor while listening asynchronously, the current node 102 checks if the two asynchronous frames indicate that they were transmitted from the same clique (block 914 ).
  • the current node 102 checks if the two asynchronous frames were transmitted from nodes that are members of the same clique. In another embodiment, the current node 102 checks if the time observed between the two asynchronous receptions of the two asynchronous frames is in agreement with the expected time between the respective scheduled transmissions as indicated, for example, by frame schedule position data embedded within the two asynchronous frames. In other embodiments, other frame coherency checks may be performed in addition to or instead of these checks.
  • the current node 102 does not receive two asynchronous frames that indicate that they were transmitted from the same clique, the current node 102 remains in the current clique (block 920 ).
  • the current node 102 determines if the current node 102 should defect from the current clique towards the other clique (block 916 ). If the current node 102 determines that it should defect, the current node 102 defects from the current clique with a bias towards the other clique (block 918 ). Otherwise, the current node 102 remains in the current clique (block 920 ).
  • the current node 102 determines if it should defect from the current clique towards the other clique by comparing the size of the current clique (that is, the number of nodes that are members of the current clique) to the size of the other clique (that is, the number of nodes that are members of the other clique). If the other clique is larger than the current clique, the current node 102 defects from the current clique towards the other clique. If the other clique is not larger than the current clique, the current node 102 remains in the current clique. In one implementation of such an embodiment, the size of the other clique is determined using explicit clique-size information included in the two asynchronous frames.
  • the size of the other clique size is determined using information that is implicitly sent with the two asynchronous frames (for example, as described in the H0005061 Application).
  • the size of the other clique is derived from other information sent within the two asynchronous frames (for example, a membership vector).
  • the current node 102 listens asynchronously for transmission from the other clique for an entire TDMA round and thereafter derives the size of the other clique based on the number of transmission the current node 102 received during the TDMA round.
  • the current node 102 determines if it should defect from the current clique towards the other clique based on an a priori ordering of the nodes 102 in the network 100 .
  • the current node 102 determines if it should defect by determining which member node of the current clique comes first in the assigned order and by determining which member node of the other clique comes first in the assigned order.
  • the current node 102 defects from the current clique towards the other clique if the first node of the other clique comes before the first node of the current clique in the order assigned to the nodes 102 of the network 100 .
  • FIG. 10 is a block diagram illustrating one example of the operation of such an implementation. In the example shown in FIG.
  • the nodes 102 of network 100 are ordered in the following order: node A, node B, node C, node D, node E, node F, node G, and node H.
  • the other clique includes the nodes that are members of clique 1 shown in FIG. 8 and the current clique includes the nodes that are members of clique 2 shown in FIG. 8 .
  • the first node of the other clique comes before the first node of the current clique (node B) and, therefore, the current node 102 would defect from the current clique towards the other clique in this example.
  • the current node 102 uses such an a prior ordering to determine if the current node 102 should defect from the current clique towards the other clique only when the current clique and other clique are of the same size (that is, have the same number of member nodes).
  • FIG. 11 is a block diagram of one exemplary embodiment of a node 1100 that is suitable for implementing each node 102 of the network 100 shown in FIG. 1 .
  • the node 1100 shown in FIG. 11 implements the TTP/C protocol (though it is to be understood that the systems, devices, methods and techniques described here can be implemented using other protocols instead of or in addition to the TTP/C protocol).
  • Each node 1100 includes a host 1110 and a TTP/C controller 1112 .
  • the host 1110 executes application software 1114 that provides the data that is communicated over the network 100 .
  • the host 1110 is a computer executing a safety-critical control application.
  • the host 1110 communicates with the other nodes 102 in the communication network 100 using the TTP/C controller 1112 .
  • the TTP/C controller 1112 implements the functionality of the TTP/C protocol.
  • the TTP/C protocol provides three basic services to the application software 1114 executing on the host 1110 .
  • the TTP/C protocol provides deterministic message sending, a global time base, and membership service so that each node 1100 knows which node is currently transmitting.
  • the TTP/C controller 1112 includes a communication network interface (CNI) 1116 that serves as an interface between the host 1110 and the other components of the TTP/C controller 1112 .
  • the CNI 1116 is implemented using a dual-ported memory 1118 (also referred to here as the “CNI memory 1118 ).
  • the CNI memory 1118 is accessed by the host 1110 and by a TTP/C controller unit 1120 included in the TTP/C controller 1112 .
  • the CNI memory 1118 is implemented using a static random access memory (SRAM).
  • a bus interface 1122 couples the CNI memory 1118 to buses 1124 (for example, data, address, and/or control buses) over which the host 1110 reads and writes data from and to the CNI memory 1118 .
  • the CNI memory 1118 is accessed in other ways (for example, using a serial interface).
  • the TTP/C controller unit 1120 provides functionality necessary to implement the TTP/C protocol.
  • the TTP/C controller unit 1120 is implemented using a programmable processor (for example, a microprocessor) that is programmed with instructions to carry out the functionality performed by the TTP/C controller unit 1120 .
  • instruction memory 1126 is coupled to the TTP/C controller unit 1120 .
  • Program instructions that are executed by the TTP/C controller unit 1120 are stored in the program instruction memory 1126 .
  • the program memory 1126 is implemented using a read only memory device or a non-volatile memory device such as a flash memory device.
  • the TTP/C controller 1112 also includes message descriptor list (MEDL) memory 1128 in which configuration information for a time-division multiple access (TDMA) schedule, operating modes, and clock synchronization parameters are stored.
  • the MEDL memory 1128 is typically implemented using, for example, a flash memory device and/or static random access memory (SRAM) device. Both the size of the CNI memory 1118 , the program memory 1126 , and the MEDL memory 1128 are selected based on the specific needs of the application software 1114 executing on the host 1110 , the program instructions executing on the TTP/controller unit 1120 , and/or a bus guardian 1132 (described below).
  • CNI memory 1118 the program memory 1126 , and the MEDL memory 1128 are shown in FIG. 11 as separate components, in some embodiments the CNI memory 1118 , the program memory 1126 , and/or the MEDL memory 1128 are combined into one or more memory devices.
  • a single bus guardian 1132 servers as an interface between the TTP/C controller 1112 and the links 1108 .
  • the bus guardian 1132 includes, for example, one or more universal asynchronous receiver/transmitter (UART) devices that are used to receive data from and transmit and relay data over the serial, unidirectional point-to-point, unidirectional links 108 shown in FIG. 1 .
  • UART universal asynchronous receiver/transmitter
  • Data received by the bus guardian 1132 from the links 108 is passed to the TTP/C controller 1112 for processing thereby in accordance with the TTP/C protocol.
  • Data that is to be transmitted by the TTP/C controller 1112 is passed by the TTP/C controller unit 1120 to the bus guardian 1132 .
  • the bus guardian 1132 determines when the TTP/C controller 1112 is allowed to transmit on the links 108 and when to relay data received from the links 108 .
  • the bus guardian 1112 implements at least a portion of the functionality described above in connection with FIGS. 2 and 3 .
  • the bus guardian 1132 accesses the MEDL information stored in the MEDL memory 1128 of the TTP/C controller 1120 in order to determine when to transmit and relay data.
  • the bus guardian 1132 included in each node 102 serves as a bus guardian 1132 for that node 102 and for each of that node's neighbors. In this way, fault-tolerance associated with multiple bus guardians can be achieved for the nodes 102 in the network 100 while only using a single bus guardian 1132 in each node 102 .
  • TTP/C controller 1112 and the bus guardian 1132 are shown as separate components in FIG. 11 , it is to be understood that in one implementation of such an embodiment, the functionality provided by the TTP/C controller 1112 and the bus guardian 1132 are integrated into a single integrated circuit device. In such an implementation, additional resource savings (for example, cost, space, and power) can be achieved.
  • a programmable processor is programmed with appropriate program instructions that, when executed by the programmable processor, carry out at least a portion of the functionality described here as being performed by the TTP/C controller 1112 and the bus guardian 1132 .
  • the TTP/C controller 1112 (or one or more components thereof) and the bus guardian 1132 (or one or more components thereof) are implemented using separate components.
  • FIG. 12 is a flow diagram of one embodiment of a method of detecting directional integrity in the network 100 of FIG. 1 .
  • the embodiment of method 1200 shown in FIG. 12 is described here as being implemented using the network 100 shown in FIG. 1 , other embodiments are implemented in other networks and in other ways.
  • the node 102 that is performing the processing of method 1200 is referred to here as the “current” node 102 .
  • the functionality described here as being performed by the current node 102 is implemented in a controller included in the node 102 .
  • Other embodiments of method 1200 are implemented in other ways.
  • each of the neighbor nodes of the transmitting node 102 perform method 1200 in order to determine if the transmitting node 102 is transmitting the same data on both channels 0 and 1 of the network 100 (that is, whether there the transmitting node 102 is transmitting with directional integrity).
  • Method 1200 can be performed, for example, when the nodes 102 in the network 100 are operating in a synchronized mode in which the nodes transmit in accordance with a TDMA schedule. In such an embodiment, method 1200 can be performed by the neighbor nodes in addition to the processing described above in connection with FIG. 3A or FIG. 3B .
  • Method 1200 can also be performed, for example, when the nodes 102 in the network 100 are operating in an unsynchronized mode (for example, during system startup). In such an embodiment, method 1200 can be performed in addition to the processing described above in connection with FIGS. 7A-7B .
  • both neighbors of the transmitting node exchange the respective frames they receive from the transmitting node over the skip links 108 that communicatively couple the neighbors to one another.
  • the current node 102 when the current node 102 receives a frame sourced from one of its neighbors (checked in block 1202 ), the current node 102 forwards the frame it is receiving from that neighbor (that is, from the transmitting node) to the other neighbor of the transmitting node (block 1204 ).
  • the current node 102 receives the frame from the transmitting node 102 from the direct link 108 that communicatively couples the current node 102 to the transmitting node.
  • the channel on which the current node 102 receives the frame from the transmitting node 102 is referred to here as the “current channel.”
  • the current node 102 forwards the frame it receives from the transmitting node to the other neighbor of the transmitting node 102 over the skip link 108 that communicatively couples the current node 102 to the other neighbor in channel other than the current channel.
  • the other neighbor of the transmitting node forwards the frame it receives from the transmitting node to the current node 102 over the other skip link 108 that communicatively couples the other neighbor to the current node 102 in the current channel.
  • the frame forwarded to the current node 102 by the other neighbor of the transmitting node is also referred to here as the “other frame.”
  • the current node 102 receives the other frame (block 1206 ).
  • the current node 102 compares the frame it is receiving from the transmitting node to the other frame it is receiving from the other neighbor (block 1208 ). In one embodiment, this comparison is a bit-for-bit comparison.
  • the current node 102 relays the frame it is receiving from the transmitting node 102 along the current channel (block 1210 ). For example, when the transmitting node 102 is the clockwise neighbor of the current node 102 , the current node 102 receives the frame from the transmitting node 102 via channel 1 and relays the received frame along channel 1 to the counter-clockwise neighbor and neighbor's neighbor of the current node 102 . When the transmitting node 102 is the counter-clockwise neighbor of the current node 102 , the current node 102 receives the frame from the transmitting node 102 via channel 0 and relays the received frame along channel 0 to the clockwise neighbor and neighbor's neighbor of the current node 102 .
  • the current node 102 relays information indicative of the results of that comparison in or after the frame received from the transmitting neighbor along the current channel (block 1212 ).
  • the information indicative of the results of the comparison comprises a one-bit, appended integrity field that the current node 102 appends to the frame received from the transmitting node in the manner described above in connection with FIGS. 4A-4B and 5 .
  • a shared integrity field is included at the end of each frame in the manner described above in connection with FIGS. 4A-4B and 5 .
  • the other neighbor of the transmitting node is node H.
  • the current node (node B) forwards the frame it receives from node A to the other neighbor (node H) over the skip link 108 of channel 0 , which communicatively couples node B to node H.
  • the other neighbor (node H) forwards the frame it receives from node A to the current node (node B) over the skip link 108 of channel 1 , which communicatively couples node H to node B.
  • Node B compares the frame it receives from node A to the frame it receives from node H.
  • Node B relays the frame received from node A along channel 1 to node C (the counter-clockwise neighbor of node B) and to node D (the counter-clockwise neighbor's neighbor of node B).
  • node B appends (in this example) a one-bit field to the relayed frame.
  • FIG. 13 is a flow diagram of one embodiment of a method of reconstituting integrity in the network 100 of FIG. 1 .
  • the embodiment of method 1300 shown in FIG. 13 is described here as being implemented using the network 100 shown in FIG. 1 , other embodiments are implemented in other networks and in other ways.
  • the node 102 that is performing the processing of method 1300 is referred to here as the “current” node 102 .
  • the functionality described here as being performed by the current node 102 is implemented in a controller included in the node 102 .
  • Other embodiments of method 1300 are implemented in other ways.
  • Method 1300 is performed, in one embodiment, by those nodes 102 other than the transmitting node 102 and the transmitting node's clockwise and counter-clockwise neighbor nodes 102 while the nodes 102 are operating in a synchronized mode.
  • the current node 102 is able to perform the processing of method 1300 when the current node 102 happens to receive four frames from the two channels (that is, frames from the counter-clockwise neighbor and the counter-clockwise neighbor's neighbor via channel 0 and from the clockwise neighbor and clockwise neighbor's neighbor via channel 1 ) within a predetermined “comparison” window. When this happens, the current node 102 is able to compare the four frames to one another in a “voting” operation.
  • the current node 102 When the current node 102 receives frames (referred to here as the “first frames”) at the current node 102 from a first neighbor and a first neighbor's neighbor of the current node 102 (block 1302 ), the current node 102 relays one of the first frames (also referred to here as the “relayed first frame”) along the that first channel and performs the two-way comparison between the two first frames in the same general manner described above in connection with FIGS. 4A-4B (block 1304 ).
  • first frames also referred to here as the “relayed first frame”
  • the current node 102 receives frames (referred to here as the “latter” or “second” frames) at the current node 102 from the current node's other neighbor and other neighbor's neighbor (block 1306 ), the current node 102 relays one of the second frames (also referred to here as the “relayed second frame”) along the second channel and performs the two-way comparison between the two second frames in the same general manner described above in connection with FIGS. 4A-4B (block 1308 ).
  • the second frames also referred to here as the “relayed second frame”
  • the current node 102 If the current node 102 receives the second frames from the second channel within the compare window (checked in block 1310 ), the current node 102 performs a voting operation using the four frames (that is, the first frames and the second frames) it is receiving (block 1312 ). In one embodiment, the voting operation compares each of the four frames to the other four frames in a bit-by-bit comparison. If the comparisons indicate that there is a mis-compare between the two second frames (checked in block 1314 ) but the first frames are identical to each other and to one of the second frames (that is, there is a “majority”) (block 1316 ), the current node 102 “overrides” the normal relay/two-way comparison processing described above (block 1318 ).
  • the current node 102 instead of performing the normal relay and two-way comparison processing described above, relays the second frame that matched the two first frames and relays along with the relayed second frame information indicating that the relayed second frame was received at the current node 102 with integrity. That is, the integrity field that would otherwise be appended to or included in the relayed second frame in accordance with the normal relay/two-war comparison processing of method 400 is replaced with a “positive” value indicating to subsequent nodes 102 that the current node 102 had a “match” (that is, received the relayed second frame with integrity) irrespective of the normal relay/two-way comparison processing performed at the current node 102 . It is to be understood that in other embodiments, other voting rules and/or override processing is performed.
  • the current node 102 does not override the normal relay/two-compare processing of the second frames (block 1320 ).
  • FIG. 14 is a flow diagram of one embodiment of a method 1400 of voting at a node 102 of the network 100 shown in FIG. 1 .
  • the embodiment of method 1400 shown in FIG. 14 is described here as being implemented using the network 100 shown in FIG. 1 , other embodiments are implemented in other networks and in other ways. In the context of FIG.
  • the node 102 that is performing the processing of method 1400 is referred to here as the “current” node 102 .
  • the functionality described here as being performed by the current node 102 is implemented in a “voter” that serves as an interface between the functionality that perform the transmit/relay functionality described above in connection with FIGS. 2-4B and an application executing on the node 102 that uses the data communicated over the network 100 .
  • Other embodiments of method 1400 are implemented in other ways.
  • Method 1400 is performed by the current node 102 when the node 102 is operating in synchronized mode and after the current node 102 has received four frames from the network 100 for a given time slot.
  • the current node 102 determines if any of the four frames have been received at the current node 102 with integrity (block 1402 ).
  • a frame is received with integrity if the appended or shared integrity fields included with the frame indicate that no mismatch has occurred in the process of transmitting and relaying the frame to the current node 102 . If a frame has been received at the current node 102 with integrity, that frame is used for subsequent processing (for example, by the application executing on the current node 102 ) (block 1404 ).
  • the current node 102 performs a voting operation using the four received frames (block 1406 ).
  • the voting operation performs a bit-by-bit comparison of each frame to the other two frames received on the other channel. If any of the bit-by-bit comparisons indicate that the two compared frames are identical (that is, there is a “majority”) (checked in block 1408 ), those frames are used (for example, by the application executing on the current node 102 ) as if they had been received by the current node 102 with integrity (block 1410 ).
  • the voter within the current node 102 provides a single frame to the application executing on the current node 102 for use thereby.
  • the frame that is provided to the application is a frame that is received with integrity at the current node or that is considered to have been received with integrity after voting. In this way, even if the relay and/or directional integrity processing described above results in four frames being received by the current node 102 without integrity, the integrity of those frames can be “reconstituted” by the voting operation.
  • the systems, devices, methods, and techniques described here may be implemented in networks having network topologies other than the particular braided-ring topology illustrated in FIG. 1 .
  • at least some of the systems, devices, methods, and techniques described here may be implemented in networks in which additional inter-node connections are provided between the various nodes of the network.
  • One example of such a network is a “mesh” network.
  • each node is communicatively coupled to all the other nodes in the network 100 (in the case of a “full” mesh network topology) or a subset of the other nodes in the network (in the case of a “partial” mesh network topology).
  • At least a subset of the nodes to which that node is coupled are designated as receive-from nodes for that node and at least a subset of the nodes to which that node is coupled are designated as transmit-to nodes.
  • At least some of the systems, devices, methods, and techniques described here may be implemented in networks in which fewer inter-node connections are provided between the various nodes of the network.
  • a network that comprises two “simplex” ring channels.
  • One such embodiment is implemented in a manner to that shown in FIG. 1 except that there are no skip links that communicatively couple each node to its clockwise and counter-clockwise neighbor's neighbors).
  • an embodiment of method 300 is suitable for use in such a simplex ring network.
  • the methods and techniques described here may be implemented in digital electronic circuitry, or with a programmable processor (for example, a special-purpose processor or a general-purpose processor such as a computer) firmware, software, or in combinations of them.
  • Apparatus embodying these techniques may include appropriate input and output devices, a programmable processor, and a storage medium tangibly embodying program instructions for execution by the programmable processor.
  • a process embodying these techniques may be performed by a programmable processor executing a program of instructions to perform desired functions by operating on input data and generating appropriate output.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Small-Scale Networks (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)
US10/993,933 2003-11-19 2004-11-19 High integrity data propagation in a braided ring Active 2028-04-16 US7606179B2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US10/993,933 US7606179B2 (en) 2003-11-19 2004-11-19 High integrity data propagation in a braided ring
US11/010,249 US7372859B2 (en) 2003-11-19 2004-12-10 Self-checking pair on a braided ring network

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US52386503P 2003-11-19 2003-11-19
US52389203P 2003-11-19 2003-11-19
US10/993,933 US7606179B2 (en) 2003-11-19 2004-11-19 High integrity data propagation in a braided ring

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US10/993,932 Continuation-In-Part US7502334B2 (en) 2003-11-19 2004-11-19 Directional integrity enforcement in a bi-directional braided ring network

Related Child Applications (2)

Application Number Title Priority Date Filing Date
US10/993,936 Continuation-In-Part US7729297B2 (en) 2003-11-19 2004-11-19 Neighbor node bus guardian scheme for a ring or mesh network
US11/010,249 Continuation-In-Part US7372859B2 (en) 2003-11-19 2004-12-10 Self-checking pair on a braided ring network

Publications (2)

Publication Number Publication Date
US20050135278A1 US20050135278A1 (en) 2005-06-23
US7606179B2 true US7606179B2 (en) 2009-10-20

Family

ID=34636494

Family Applications (5)

Application Number Title Priority Date Filing Date
US10/993,932 Active 2026-12-22 US7502334B2 (en) 2003-11-19 2004-11-19 Directional integrity enforcement in a bi-directional braided ring network
US10/993,931 Expired - Fee Related US7649835B2 (en) 2003-11-19 2004-11-19 Unsynchronous mode brother's keeper bus guardian for a ring networks
US10/994,209 Active 2027-02-13 US7505470B2 (en) 2003-11-19 2004-11-19 Clique aggregation in TDMA networks
US10/993,933 Active 2028-04-16 US7606179B2 (en) 2003-11-19 2004-11-19 High integrity data propagation in a braided ring
US10/993,936 Active 2028-08-08 US7729297B2 (en) 2003-11-19 2004-11-19 Neighbor node bus guardian scheme for a ring or mesh network

Family Applications Before (3)

Application Number Title Priority Date Filing Date
US10/993,932 Active 2026-12-22 US7502334B2 (en) 2003-11-19 2004-11-19 Directional integrity enforcement in a bi-directional braided ring network
US10/993,931 Expired - Fee Related US7649835B2 (en) 2003-11-19 2004-11-19 Unsynchronous mode brother's keeper bus guardian for a ring networks
US10/994,209 Active 2027-02-13 US7505470B2 (en) 2003-11-19 2004-11-19 Clique aggregation in TDMA networks

Family Applications After (1)

Application Number Title Priority Date Filing Date
US10/993,936 Active 2028-08-08 US7729297B2 (en) 2003-11-19 2004-11-19 Neighbor node bus guardian scheme for a ring or mesh network

Country Status (4)

Country Link
US (5) US7502334B2 (ja)
EP (4) EP1692823A1 (ja)
JP (4) JP2007511986A (ja)
WO (4) WO2005053237A1 (ja)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090323704A1 (en) * 2008-06-25 2009-12-31 Honeywell International Inc. Hybrid topology ethernet architecture
US8767767B2 (en) 2012-02-21 2014-07-01 Honeywell International Inc. System and method for out-of-band signaling
US8908675B2 (en) 2012-01-13 2014-12-09 Honeywell International Inc. Virtual pairing for consistent data broadcast
US8949983B2 (en) 2012-02-21 2015-02-03 Honeywell International Inc. System and method for integrity reconstitution
EP3668020A1 (en) 2018-12-13 2020-06-17 Honeywell International Inc. Efficient self-checking redundancy comparison in a network
US10992516B2 (en) 2018-12-13 2021-04-27 Honeywell International Inc. Efficient self-checking redundancy comparison in a network
EP3965376A1 (en) 2020-09-02 2022-03-09 Honeywell International Inc. Compressed and efficient byzantine agreement
US11652663B1 (en) 2022-01-28 2023-05-16 Honeywell International Inc. Controller area network braided ring
US11665112B2 (en) 2020-09-02 2023-05-30 Honeywell International Inc. Self-checking node

Families Citing this family (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB0411991D0 (en) * 2004-05-28 2004-06-30 New Transducers Ltd Communication network for servo systems and the like
US8660131B2 (en) * 2005-06-09 2014-02-25 Nxp B.V. Storage unit for communication system node, method for data storage and communication system node
EP1739890A3 (en) * 2005-06-28 2007-07-18 Tttech Computertechnik AG Processing of data frames exchanged over a communication controller in a time-triggered system
JP4871687B2 (ja) * 2005-10-03 2012-02-08 日立オートモティブシステムズ株式会社 車両制御システム
DE102005048595A1 (de) * 2005-10-06 2007-04-12 Robert Bosch Gmbh Verfahren zur Anbindung eines FlexRay-Teilnehmers mit einem Mikrocontroller an eine FlexRay-Kommunikationsverbindung über eine FlexRay-Kommunikationssteuereinrichtung, und FlexRay-Kommunikationssteuereinrichtung, FlexRay-Teilnehmer und FlexRay-Kommunikationssystem zur Realisierung dieses Verfahrens
JP4946646B2 (ja) * 2006-07-10 2012-06-06 日産自動車株式会社 通信ネットワークシステム及び未ウェイクアップノードのウェイクアップ方法
CN101512987A (zh) * 2006-09-06 2009-08-19 Nxp股份有限公司 时间触发网络中的集群耦合器
US7668084B2 (en) * 2006-09-29 2010-02-23 Honeywell International Inc. Systems and methods for fault-tolerant high integrity data propagation using a half-duplex braided ring network
US7596153B2 (en) * 2006-10-13 2009-09-29 Honeywell International Inc. Clock-state correction and/or clock-rate correction using relative drift-rate measurements
US7889683B2 (en) * 2006-11-03 2011-02-15 Honeywell International Inc. Non-destructive media access resolution for asynchronous traffic in a half-duplex braided-ring
US7912094B2 (en) * 2006-12-13 2011-03-22 Honeywell International Inc. Self-checking pair-based master/follower clock synchronization
US7656881B2 (en) * 2006-12-13 2010-02-02 Honeywell International Inc. Methods for expedited start-up and clique aggregation using self-checking node pairs on a ring network
US8204037B2 (en) * 2007-08-28 2012-06-19 Honeywell International Inc. Autocratic low complexity gateway/ guardian strategy and/or simple local guardian strategy for flexray or other distributed time-triggered protocol
US7778159B2 (en) * 2007-09-27 2010-08-17 Honeywell International Inc. High-integrity self-test in a network having a braided-ring topology
US8817597B2 (en) * 2007-11-05 2014-08-26 Honeywell International Inc. Efficient triple modular redundancy on a braided ring
JP5014362B2 (ja) 2009-02-25 2012-08-29 キヤノン株式会社 情報処理装置及びその制御方法、コンピュータプログラム
US8498276B2 (en) 2011-05-27 2013-07-30 Honeywell International Inc. Guardian scrubbing strategy for distributed time-triggered protocols
TWI462521B (zh) * 2011-11-03 2014-11-21 Realtek Semiconductor Corp 適用於多種應用層協定程序的高精確性具彈性化的低功耗遠端喚醒機制的網路存取裝置
US9215031B2 (en) * 2012-09-21 2015-12-15 Verizon Patent And Licensing Inc. Determining least-latency paths across a provider network utilizing available capacity
JP6471021B2 (ja) * 2015-03-30 2019-02-13 本田技研工業株式会社 通信システム

Citations (74)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2028062A (en) 1979-08-17 1980-02-27 Standard Telephones Cables Ltd Data transmission system
GB1581803A (en) 1978-03-21 1980-12-17 Standard Telephones Cables Ltd Data transmission system
US4417334A (en) 1981-04-16 1983-11-22 Ncr Corporation Data processing system having dual-channel system bus
US4428046A (en) 1980-05-05 1984-01-24 Ncr Corporation Data processing system having a star coupler with contention circuitry
DE3238692A1 (de) 1982-10-19 1984-04-19 Siemens AG, 1000 Berlin und 8000 München Datenuebertragungssystem
GB2175775A (en) 1985-05-28 1986-12-03 Stc Plc Data transmission system
US4630254A (en) 1984-10-26 1986-12-16 Trw Inc. Controlled star network
US4631718A (en) 1984-01-20 1986-12-23 Fuji Xerox Co., Ltd. Method and device for synchronization of system timing
US4733391A (en) 1983-10-22 1988-03-22 The General Electric Company Plc Communication networks
US4740958A (en) 1985-11-23 1988-04-26 International Computers Limited Data transmission system
US4856023A (en) 1986-07-23 1989-08-08 Ncr Corporation System for maintaining low bit error rate in a starcoupled network of direct coupled stations
US4866606A (en) 1984-06-22 1989-09-12 Austria Miktosystem International Gmbh Loosely coupled distributed computer system with node synchronization for precision in real time applications
US4905230A (en) 1987-04-24 1990-02-27 Madge Networks Limited Token ring expander and/or hub
EP0405706A1 (en) 1989-05-31 1991-01-02 Gpt Limited Processor unit networks
US5132962A (en) 1990-12-20 1992-07-21 International Business Machines Corporation Fault isolation and bypass reconfiguration unit
US5161153A (en) 1989-10-17 1992-11-03 Stc Plc Synchronous network
US5235595A (en) 1987-05-06 1993-08-10 Fischer & Porter Company Packet switching
US5257266A (en) 1991-02-27 1993-10-26 General Dynamics Corporation, Space Systems Division Computer and communications systems employing universal direct spherics processing architectures
US5307409A (en) 1992-12-22 1994-04-26 Honeywell Inc Apparatus and method for fault detection on redundant signal lines via encryption
US5341232A (en) 1989-02-20 1994-08-23 Licentia Patent-Verwaltung-Gmbh Star-shaped network for data communication between stations
US5383191A (en) 1990-12-20 1995-01-17 International Business Machines Corporation Dual ring reconfiguration switching unit
US5386424A (en) 1993-03-31 1995-01-31 Honeywell, Inc. Apparatus and method for transmitting information between dual redundant components utilizing four signal paths
US5394401A (en) 1993-04-14 1995-02-28 Digital Equipment Corporation Arrangement for a token ring communications network
US5463634A (en) 1991-12-23 1995-10-31 International Business Machines Corporation Dual ring fault isolation
US5557778A (en) 1994-11-07 1996-09-17 Network Devices, Inc. Star hub connection device for an information display system
US5687356A (en) 1992-06-22 1997-11-11 International Business Machines Corporation Hub and interface for isochronous token ring
US5715391A (en) * 1991-11-15 1998-02-03 International Business Machines Corporation Modular and infinitely extendable three dimensional torus packaging scheme for parallel processing
DE19633744A1 (de) 1996-08-22 1998-02-26 Baumueller Anlagen Systemtech Ringgraph in einem elektrischen Antriebssystem
US5896508A (en) 1995-02-23 1999-04-20 Advanced Micro Devices, Inc. Hub-network adapter device for a file server personal computer
US5903565A (en) 1994-08-24 1999-05-11 Wabco Gmbh Serial bus system using bitwise arbitration for independently communicating with and controlling individual bus systems
US5920267A (en) * 1994-05-09 1999-07-06 Europlex Research Limited Ring network system
US5937414A (en) 1997-02-28 1999-08-10 Oracle Corporation Method and apparatus for providing database system replication in a mixed propagation environment
US5940367A (en) 1996-11-06 1999-08-17 Pluris, Inc. Fault-tolerant butterfly switch
US6052753A (en) 1997-01-21 2000-04-18 Alliedsignal Inc. Fault tolerant data bus
WO2000064122A1 (en) 1999-04-15 2000-10-26 Gilian Technologies, Ltd. Monitoring integrity of transmitted data
US6172984B1 (en) 1997-06-19 2001-01-09 Siemens Information And Communication Networks, Inc. System and method for reducing the latency for time sensitive data over CSMA/CD networks
US6175553B1 (en) 1997-06-20 2001-01-16 Nortel Networks Corporation Method and apparatus for locating and isolating a fault within a token ring network
AT407582B (de) 1999-08-13 2001-04-25 Fts Computertechnik Gmbh Nachrichtenverteilereinheit mit integriertem guardian zur verhinderung von ''babbling idiot'' fehlern
US6226676B1 (en) 1998-10-07 2001-05-01 Nortel Networks Corporation Connection establishment and termination in a mixed protocol network
US20020027877A1 (en) 2000-09-02 2002-03-07 Agency For Defense Development Packet processing method using multiple fault tolerant network structure
US6374078B1 (en) 1998-04-17 2002-04-16 Direct Wireless Corporation Wireless communication system with multiple external communication links
US6414953B1 (en) 1996-12-23 2002-07-02 Tech Laboratories Incorporated Multi-protocol cross connect switch
US20020087763A1 (en) 1999-05-12 2002-07-04 Wendorff Wilhard Von Communication sytem with a communication bus
US20020118636A1 (en) 2000-12-20 2002-08-29 Phelps Peter W. Mesh network protection using dynamic ring
US6513092B1 (en) 2000-04-18 2003-01-28 Nec Eluminant Technologies, Inc. 1:N protection switching architecture for common processing units
EP1280312A2 (en) 2001-06-28 2003-01-29 Hitachi, Ltd. Methods, systems and computer program products for checking the validity of data
EP1280024A1 (en) 2001-07-26 2003-01-29 Motorola Inc. Clock synchronization in a distributed system
US20030067867A1 (en) 2001-04-04 2003-04-10 Alcatel Fast restoration mechanism and method of determining minimum restoration capacity in a transmission networks
US20030128984A1 (en) * 2001-04-11 2003-07-10 Magnus Oberg Low loss wdm add drop node
US6594802B1 (en) 2000-03-23 2003-07-15 Intellitech Corporation Method and apparatus for providing optimized access to circuits for debug, programming, and test
US6618359B1 (en) 1998-10-07 2003-09-09 Nortel Networks Limited Error recovery in a mixed protocol networks
DE20220280U1 (de) 2002-05-22 2003-10-02 Robert Bosch Gmbh, 70469 Stuttgart Vorrichtung zur Übertragung von Information in einem Netzwerk sowie entsprechendes Netzwerk
EP1365543A2 (de) 2002-05-22 2003-11-26 Robert Bosch Gmbh Verfahren und Vorrichtung zur Übertragung von Information und Fehlererkennung in einem ringförmigen Netzwerk
US6707913B1 (en) 2000-04-11 2004-03-16 Verizon Laboratories Inc. Network interface
EP1398710A2 (en) 2002-09-13 2004-03-17 Hitachi, Ltd. Network system
US6741559B1 (en) 1999-12-23 2004-05-25 Nortel Networks Limited Method and device for providing priority access to a shared access network
US6760768B2 (en) 1996-07-30 2004-07-06 Micron Technology, Inc. Method and system for establishing a security perimeter in computer networks
EP1469627A1 (de) 2003-04-14 2004-10-20 Alcatel Verfahren zur signaltechnisch sicheren Datenübertragung
US20040223515A1 (en) 2003-01-14 2004-11-11 Rygielski Ronald E. Method and apparatus for the synchronization of a system time of a communications network with a clock reference
US20040258097A1 (en) 2001-09-26 2004-12-23 Johann Arnold Method for synchronizing nodes of a communications system
US20050002332A1 (en) 2003-07-01 2005-01-06 Hwa-Seok Oh Method, apparatus and computer program for performing a frame flow control, and method, apparatus and computer program for transmitting a frame
US20050132105A1 (en) 2003-11-19 2005-06-16 Honeywell International, Inc. Mobius time-triggered communication
US6925497B1 (en) 2000-09-26 2005-08-02 Microsoft Corporation Systems and methods for controlling the number of clients that access a server
US20050169296A1 (en) 2004-02-03 2005-08-04 Srinivas Katar Temporary priority promotion for network communications in which access to a shared medium depends on a priority level
US6956461B2 (en) 2000-12-13 2005-10-18 Lg Electronics Inc. Apparatus and method for remotely controlling household appliances
US20060077981A1 (en) 2004-10-13 2006-04-13 Rivulet Communications, Inc. Network connection device
US7035539B2 (en) 2002-01-09 2006-04-25 Fujitsu Limited Interconnecting nodes in an optical communication system
US7050395B1 (en) 2001-11-30 2006-05-23 Redback Networks Inc. Method and apparatus for disabling an interface between network element data processing units
US7085560B2 (en) 2000-05-31 2006-08-01 Wahoo Communications Corporation Wireless communications device with artificial intelligence-based distributive call routing
US7088921B1 (en) 1999-06-11 2006-08-08 Lucent Technologies Inc. System for operating an Ethernet data network over a passive optical network access system
US20060203851A1 (en) 2005-03-14 2006-09-14 Eidson John C Applications of multiple time synchronization domains
US7269177B2 (en) 2002-11-18 2007-09-11 Lucent Technologies Inc. Logical star topologies for non-star networks
US7349414B2 (en) 2001-08-24 2008-03-25 Optimum Communications Services, Inc. System and method for maximizing the traffic delivery capacity of packet transport networks via real-time traffic pattern based optimization of transport capacity allocation
US7457303B2 (en) 2003-06-06 2008-11-25 International Business Machines Corporation One-bounce network

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3491102A (en) 1967-05-17 1970-01-20 Uniroyal Inc 2-hydroxy - 3,5 - dihydrocarbylbenzyl 3-hydrocarbyl - 4 - hydroxy-5-(dialkylaminomethyl) phenyl sulfide
US5742646A (en) * 1995-05-05 1998-04-21 Harris Corporation Method of selecting and switching signal paths in a digital communication system
US5719868A (en) * 1995-10-05 1998-02-17 Rockwell International Dynamic distributed, multi-channel time division multiple access slot assignment method for a network of nodes
US5949760A (en) * 1997-03-21 1999-09-07 Rockwell International Corporation Simultaneous channel access transmission method for a multi-hop communications radio network
US6219528B1 (en) * 1998-06-29 2001-04-17 Hughes Electronics Corporation Dynamic power control with adaptive reference level
US6950418B1 (en) * 1999-04-30 2005-09-27 Rockwell Collins, Inc. Clique activation multiple access (CAMA)
US6765924B1 (en) * 1999-08-19 2004-07-20 Intel Corporation Networking method and apparatus using silent slots to facilitate transmission collision detection
GB2377035B (en) * 2001-06-29 2005-05-04 Motorola Inc A fault tolerant shared transceiver apparatus and system

Patent Citations (76)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB1581803A (en) 1978-03-21 1980-12-17 Standard Telephones Cables Ltd Data transmission system
GB2028062A (en) 1979-08-17 1980-02-27 Standard Telephones Cables Ltd Data transmission system
US4428046A (en) 1980-05-05 1984-01-24 Ncr Corporation Data processing system having a star coupler with contention circuitry
US4417334A (en) 1981-04-16 1983-11-22 Ncr Corporation Data processing system having dual-channel system bus
DE3238692A1 (de) 1982-10-19 1984-04-19 Siemens AG, 1000 Berlin und 8000 München Datenuebertragungssystem
US4733391A (en) 1983-10-22 1988-03-22 The General Electric Company Plc Communication networks
US4631718A (en) 1984-01-20 1986-12-23 Fuji Xerox Co., Ltd. Method and device for synchronization of system timing
US4866606A (en) 1984-06-22 1989-09-12 Austria Miktosystem International Gmbh Loosely coupled distributed computer system with node synchronization for precision in real time applications
US4630254A (en) 1984-10-26 1986-12-16 Trw Inc. Controlled star network
GB2175775A (en) 1985-05-28 1986-12-03 Stc Plc Data transmission system
US4740958A (en) 1985-11-23 1988-04-26 International Computers Limited Data transmission system
US4856023A (en) 1986-07-23 1989-08-08 Ncr Corporation System for maintaining low bit error rate in a starcoupled network of direct coupled stations
US4905230A (en) 1987-04-24 1990-02-27 Madge Networks Limited Token ring expander and/or hub
US5235595A (en) 1987-05-06 1993-08-10 Fischer & Porter Company Packet switching
US5341232A (en) 1989-02-20 1994-08-23 Licentia Patent-Verwaltung-Gmbh Star-shaped network for data communication between stations
EP0405706A1 (en) 1989-05-31 1991-01-02 Gpt Limited Processor unit networks
US5161153A (en) 1989-10-17 1992-11-03 Stc Plc Synchronous network
US5132962A (en) 1990-12-20 1992-07-21 International Business Machines Corporation Fault isolation and bypass reconfiguration unit
US5383191A (en) 1990-12-20 1995-01-17 International Business Machines Corporation Dual ring reconfiguration switching unit
US5257266A (en) 1991-02-27 1993-10-26 General Dynamics Corporation, Space Systems Division Computer and communications systems employing universal direct spherics processing architectures
US5715391A (en) * 1991-11-15 1998-02-03 International Business Machines Corporation Modular and infinitely extendable three dimensional torus packaging scheme for parallel processing
US5463634A (en) 1991-12-23 1995-10-31 International Business Machines Corporation Dual ring fault isolation
US5687356A (en) 1992-06-22 1997-11-11 International Business Machines Corporation Hub and interface for isochronous token ring
US5307409A (en) 1992-12-22 1994-04-26 Honeywell Inc Apparatus and method for fault detection on redundant signal lines via encryption
US5386424A (en) 1993-03-31 1995-01-31 Honeywell, Inc. Apparatus and method for transmitting information between dual redundant components utilizing four signal paths
US5394401A (en) 1993-04-14 1995-02-28 Digital Equipment Corporation Arrangement for a token ring communications network
US5920267A (en) * 1994-05-09 1999-07-06 Europlex Research Limited Ring network system
US5903565A (en) 1994-08-24 1999-05-11 Wabco Gmbh Serial bus system using bitwise arbitration for independently communicating with and controlling individual bus systems
US5557778A (en) 1994-11-07 1996-09-17 Network Devices, Inc. Star hub connection device for an information display system
US5896508A (en) 1995-02-23 1999-04-20 Advanced Micro Devices, Inc. Hub-network adapter device for a file server personal computer
US6760768B2 (en) 1996-07-30 2004-07-06 Micron Technology, Inc. Method and system for establishing a security perimeter in computer networks
DE19633744A1 (de) 1996-08-22 1998-02-26 Baumueller Anlagen Systemtech Ringgraph in einem elektrischen Antriebssystem
US5940367A (en) 1996-11-06 1999-08-17 Pluris, Inc. Fault-tolerant butterfly switch
US6414953B1 (en) 1996-12-23 2002-07-02 Tech Laboratories Incorporated Multi-protocol cross connect switch
US6052753A (en) 1997-01-21 2000-04-18 Alliedsignal Inc. Fault tolerant data bus
US5937414A (en) 1997-02-28 1999-08-10 Oracle Corporation Method and apparatus for providing database system replication in a mixed propagation environment
US6172984B1 (en) 1997-06-19 2001-01-09 Siemens Information And Communication Networks, Inc. System and method for reducing the latency for time sensitive data over CSMA/CD networks
US6175553B1 (en) 1997-06-20 2001-01-16 Nortel Networks Corporation Method and apparatus for locating and isolating a fault within a token ring network
US6374078B1 (en) 1998-04-17 2002-04-16 Direct Wireless Corporation Wireless communication system with multiple external communication links
US6226676B1 (en) 1998-10-07 2001-05-01 Nortel Networks Corporation Connection establishment and termination in a mixed protocol network
US6618359B1 (en) 1998-10-07 2003-09-09 Nortel Networks Limited Error recovery in a mixed protocol networks
WO2000064122A1 (en) 1999-04-15 2000-10-26 Gilian Technologies, Ltd. Monitoring integrity of transmitted data
US20020087763A1 (en) 1999-05-12 2002-07-04 Wendorff Wilhard Von Communication sytem with a communication bus
US7088921B1 (en) 1999-06-11 2006-08-08 Lucent Technologies Inc. System for operating an Ethernet data network over a passive optical network access system
AT407582B (de) 1999-08-13 2001-04-25 Fts Computertechnik Gmbh Nachrichtenverteilereinheit mit integriertem guardian zur verhinderung von ''babbling idiot'' fehlern
US6741559B1 (en) 1999-12-23 2004-05-25 Nortel Networks Limited Method and device for providing priority access to a shared access network
US6594802B1 (en) 2000-03-23 2003-07-15 Intellitech Corporation Method and apparatus for providing optimized access to circuits for debug, programming, and test
US6707913B1 (en) 2000-04-11 2004-03-16 Verizon Laboratories Inc. Network interface
US6513092B1 (en) 2000-04-18 2003-01-28 Nec Eluminant Technologies, Inc. 1:N protection switching architecture for common processing units
US6842617B2 (en) 2000-05-31 2005-01-11 Wahoo Communications Corporation Wireless communication device with multiple external communication links
US7085560B2 (en) 2000-05-31 2006-08-01 Wahoo Communications Corporation Wireless communications device with artificial intelligence-based distributive call routing
US20020027877A1 (en) 2000-09-02 2002-03-07 Agency For Defense Development Packet processing method using multiple fault tolerant network structure
US6925497B1 (en) 2000-09-26 2005-08-02 Microsoft Corporation Systems and methods for controlling the number of clients that access a server
US6956461B2 (en) 2000-12-13 2005-10-18 Lg Electronics Inc. Apparatus and method for remotely controlling household appliances
US20020118636A1 (en) 2000-12-20 2002-08-29 Phelps Peter W. Mesh network protection using dynamic ring
US20030067867A1 (en) 2001-04-04 2003-04-10 Alcatel Fast restoration mechanism and method of determining minimum restoration capacity in a transmission networks
US20030128984A1 (en) * 2001-04-11 2003-07-10 Magnus Oberg Low loss wdm add drop node
EP1280312A2 (en) 2001-06-28 2003-01-29 Hitachi, Ltd. Methods, systems and computer program products for checking the validity of data
EP1280024A1 (en) 2001-07-26 2003-01-29 Motorola Inc. Clock synchronization in a distributed system
US7349414B2 (en) 2001-08-24 2008-03-25 Optimum Communications Services, Inc. System and method for maximizing the traffic delivery capacity of packet transport networks via real-time traffic pattern based optimization of transport capacity allocation
US20040258097A1 (en) 2001-09-26 2004-12-23 Johann Arnold Method for synchronizing nodes of a communications system
US7050395B1 (en) 2001-11-30 2006-05-23 Redback Networks Inc. Method and apparatus for disabling an interface between network element data processing units
US7035539B2 (en) 2002-01-09 2006-04-25 Fujitsu Limited Interconnecting nodes in an optical communication system
EP1365543A2 (de) 2002-05-22 2003-11-26 Robert Bosch Gmbh Verfahren und Vorrichtung zur Übertragung von Information und Fehlererkennung in einem ringförmigen Netzwerk
US20040073698A1 (en) * 2002-05-22 2004-04-15 Werner Harter Method and device for transmitting information in a network, as well as a corresponding network
DE20220280U1 (de) 2002-05-22 2003-10-02 Robert Bosch Gmbh, 70469 Stuttgart Vorrichtung zur Übertragung von Information in einem Netzwerk sowie entsprechendes Netzwerk
EP1398710A2 (en) 2002-09-13 2004-03-17 Hitachi, Ltd. Network system
US7269177B2 (en) 2002-11-18 2007-09-11 Lucent Technologies Inc. Logical star topologies for non-star networks
US20040223515A1 (en) 2003-01-14 2004-11-11 Rygielski Ronald E. Method and apparatus for the synchronization of a system time of a communications network with a clock reference
EP1469627A1 (de) 2003-04-14 2004-10-20 Alcatel Verfahren zur signaltechnisch sicheren Datenübertragung
US7457303B2 (en) 2003-06-06 2008-11-25 International Business Machines Corporation One-bounce network
US20050002332A1 (en) 2003-07-01 2005-01-06 Hwa-Seok Oh Method, apparatus and computer program for performing a frame flow control, and method, apparatus and computer program for transmitting a frame
US20050132105A1 (en) 2003-11-19 2005-06-16 Honeywell International, Inc. Mobius time-triggered communication
US20050169296A1 (en) 2004-02-03 2005-08-04 Srinivas Katar Temporary priority promotion for network communications in which access to a shared medium depends on a priority level
US20060077981A1 (en) 2004-10-13 2006-04-13 Rivulet Communications, Inc. Network connection device
US20060203851A1 (en) 2005-03-14 2006-09-14 Eidson John C Applications of multiple time synchronization domains

Non-Patent Citations (46)

* Cited by examiner, † Cited by third party
Title
"Backplane Data Bus ARINC Specification 659", Dec. 1993, pp. 1-132, Publisher: ARINC.
"Flexray Communication System: Protocol Specification Version 2.1 Revision A", "www.flexray-group.com", Mar. 2006, pp. 1-8, Publisher: Flexray Consortium.
"Internet Content Adaptation", "Network Appliance", Jul. 2001, pp. 1-13.
"Preliminary Central Bus Guardian Specification Version 2.0.9", Dec. 2005, pp. 1-38, Publisher: Flexray Consortium.
"Preliminary Node-Local Bus Guardian Specification Version 2.0.9", Dec. 2005, pp. 1-75, Publisher: Flexray Consortium.
"Software Considerations in Airborne Systems and Equipment Certification", "http://www.rtca.org", Dec. 1992, pp. 1-112, Publisher: RTCA.DO-178b.
"Time-Triggered Protocol TTP/C", 2004, Publisher: TTTech Computertechnik GmbH, Published in: Austria.
Al-Rousan et al., "The Two-Processor Reliability of Hierarchical Larg-Scale Ring-Based Networks", "Proceedings of the 29th Hawaii International Conference on System Sciences", 1996, pp. 63-71.
Avizienis, "A Fault Tolerance Infrastructure for Dependable Computing With High-Performance Cots Componenets", "Conference Proceedings on Dependable Systems and Networks", Jun. 2000, pp. 492-500, Publisher: IEEE, Publisher: IEEE, New York, NY.
Bauer et al., "Assumption Coverage Under Different Failure Modes in the Time-Triggered Architecture", "8th IEEE International Conference on Emerging Technologies and Factory Automation", October 2001, pp. 333-341, Publisher: IEEE.
Bauer et al., "The Central Guardian Approach to Enforce Fault Isolation in a Time-Triggered System", "Proceedings of Symposium on Autonomous Decentralized Systems", Apr. 2003, pp. 37-44, Publisher: IEEE.
Bauer et al., "Transparent Redundancy in the Time-Triggered Architecture", "Proceedings of the Conference on Dependable Systems and Networks", 2000, pp. 5-13, Publisher: IEEE.
Bosch, "Can Specification Version 2.0", "SAE Handbook-Parts and Components", 1998, pp. 1-72, vol. 2, Publisher: Society of Automotive Engineers.
Brinkmeyer, "Flexray International Workshop Slides", "www.flexray-group.com", Apr. 2002, pp. 1-356, Publisher: Flexray.
D'Luna, "A Single-Chip Universal Cable Set-Top Box/Modern Transceiver", "Journal of Sold-State Circuits", Nov. 1998, pp. 1647-1660, vol. 34, No. 11, Publisher: IEEE.
Driscoll et al., "The Real Byzantine Generals", "Proceedings of Digital Avionics System Conference", Oct. 2004, pp. 6.D.4-1-6.D.4-11, Publisher: IEEE.
Grnarov et al., "A Highly Reliable Distributed Loop Network Architecture", "Proceedings of Fault-Tolerant Computing Symposium", Jun. 1980, pp. 319-324, Publisher: IEEE.
Gruenbacher, "Fault Injection for TTA", 1999, Publisher: Information Society Technologies.
Hall et al., "Ringing Out Fault Tolerance a New Ring Network for Superior Low-Dost Dependabilitiy", "International Conference on Dependable Systems and Networks (DSN'05)", 2005, pp. 298-307.
Hammett et al., "Achieving 10-9 Dependability With Drive-By-Wire Systems", "SAE World Congress", 2003, pp. 534-547, vol. 112, No. 7, Publisher: Society of Automotive Engineers.
Hopper et al., "Design and Use of an Integrated Cambridge Ring", "Journal on Selected Areas in Communications", Nov. 2003, pp. 775-784, vol. 1, No. 5, Publisher: IEEE.
Hoyme et al., "Safebus", "IEEE Aerospce and Electronics Systems Magazine", Mar. 1993, pp. 34-39, vol. 8, No. 3, Publisher: IEEE.
Hoyme et al., "SAFEbus", "Proceedings of the Digital Avionics Systems Conference", Oct. 1992, pp. 68-73, Publisher: IEEE.
Huber et al., "Silk: an Implementation of a Buffer Insertion Ring", "Journal on Selected Areas in Communications", Nov. 1983, pp. 766-774, vol. 1, No. 5, Publisher: IEEE.
Hwang et al., "Survival Reliability of Some Double-Loop Networks and Chordal Rings", "Transactions on Computers", 1995, pp. 1468-1471, vol. 44, No. 12, Publisher: IEEE.
IEEE Computer Society, "1149.6 IEEE Standard for Boundary-Scan Testing of Advanced Digital Networks", Apr. 17, 2003, pp. 1-139, Publisher: IEEE, Published in: New York, NY.
Johansson et al., "On Communication Requirements for Control-By-Wire Applications", "Proceedings of System Safety Conference", Aug. 2003, pp. 1123-1132.
Kanoun et al., "Dependability Evalucation of Bus and Ring Communication Topologies for the Delta-4 Distr Fault-Tolerant Architecture", "Proceedings of the Symposium on Reliable Distributed Systems", 1991, pp. 130-141, Publisher: IEEE.
Kieckhafer et al., "The Maft Architecture for Distributed Fault Tolerance", "Transactions on Computers", 1988, pp. 398-405, vol. 37, No. 4, Publisher: IEEE.
Kopetz et al., "TTP-A Protocol for Fault-Tolerant Real-Time Systems", "Computer", Jan. 11, 1994, pp. 14-23, vol. 27, No. 1, Publisher: IEEE Computer Society, Published in: Long Beach, CA.
Liu et al., "The Distributed Double-Loop Computer Network (DDLCN)", "ACM '80 Proceedings of the ACM 1980 Annual Conference", 1980, pp. 164-178, Publisher: ACM.
Lonn, "Initialsynchronization of TDMA Communication in Distributed Real-Time Systems", "Conference on Distributed Computing Systems", 1999, pp. 370-379, Publisher: IEEE.
Nayak et al., "Ring Reconfiguration in Presence of Close Fault Cuts", "Proceedings of Hawaii International Conference on System Science", 1996, pp. 422-428, Publisher: IEEE.
Paulitsch et al., "Cverage and the Use of Cyclic Redundancy Codes in Ultra-Dependable Systems", "2005 International Conference on Dependable Systems and Networks (DSN'05)", 2005, pp. 346-355.
Poledna et al., "Replica Determinism and Flexible Scheduling in Hard Real-Time Dependable Systms", "IEEE Transactions on Computers", Feb. 2000, pp. 100-111, vol. 49, No. 2, Publisher: IEEE
Poledna, "Replica Determinism in Distributed Real-Time Systems: A Brief Survey", "Real-Time Systems", 1994, pp. 289-316, vol. 6.
Rushby, "Bus Architectures for Safety-Critical Embedded Systems, Embedded Software", "Proceedings of 1st International Workshop on Embedded Software, Notes in Computer Science", Oct. 2001, pp. 306-323, vol. 2211, Publisher: Springer-Verlag, Published in: Germany.
Saltzer et al., "Why a Ring", "Proceedings of Symposium on Data Communications", 1981, pp. 211-217, Publisher: IEEE.
Sivencrona et al., "Protocol Membership Agreement in Distributed Communicaiton System-A Question of Brittleness", "SAE World Congress, Paper No. 2003-01-0108", 2003, pp. 1-6, Publisher: Society of Automotive Engineers Inc.
Steiner et al., "The Startup Problem in Fault-Tolerant Time-Triggered Communication", "International Conference on Dependable Systems and Networks (DSN'06)", 2006, pp. 35-44.
Steiner et al., "The Transition From Asynchronous to Synchronous System Operation: An Approach From Distributed Fault-Tolerant Systems", "Proceedings of Conference on Distributed Computing Systems", Jul. 2002, pp. 329-336, Publisher: IEEE.
Sundaram et al., "Controller Integrity in Automotive Failsafe System Architectures", "2006 SAE World Congress", 2006, pp. 1-10, Publisher: SAE International.
Tomlinson et al., "Extensible Proxy Services Framework", Jul. 2000, pp. 1-13, Publisher: Internet Society.
Wensley et al., "The Design, Analysis, and Verification of the Sift Fault Tolerant System", "Proceedings of Conference on Software Engineering", 1976, pp. 458-469, Publisher: IEEE Computer Society Press.
Yeh, "Design Condiserations in Boeing 777 Fly-By-Wire Computers", "High-Asssurance Systems Engineering Symposium", Nov. 1998, pp. 64-72, Publisher: IEEE.
Yeh, "Triple-Triple Redundant 777 Primary Flight Computer", "Proceedings of the Aerospace Applications Conference", 1996, pp. 293-307, vol. 1, Publisher: IEEE, Published in: New York, NY.

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090323704A1 (en) * 2008-06-25 2009-12-31 Honeywell International Inc. Hybrid topology ethernet architecture
US8130773B2 (en) * 2008-06-25 2012-03-06 Honeywell International Inc. Hybrid topology ethernet architecture
US8908675B2 (en) 2012-01-13 2014-12-09 Honeywell International Inc. Virtual pairing for consistent data broadcast
US8767767B2 (en) 2012-02-21 2014-07-01 Honeywell International Inc. System and method for out-of-band signaling
US8949983B2 (en) 2012-02-21 2015-02-03 Honeywell International Inc. System and method for integrity reconstitution
US10992516B2 (en) 2018-12-13 2021-04-27 Honeywell International Inc. Efficient self-checking redundancy comparison in a network
EP3668020A1 (en) 2018-12-13 2020-06-17 Honeywell International Inc. Efficient self-checking redundancy comparison in a network
US11303584B2 (en) 2018-12-13 2022-04-12 Honeywell International Inc. Dual fault-tolerant network using guardian interlocking
EP3965376A1 (en) 2020-09-02 2022-03-09 Honeywell International Inc. Compressed and efficient byzantine agreement
US11431613B2 (en) 2020-09-02 2022-08-30 Honeywell International Inc. Compressed and efficient byzantine agreement
US11665112B2 (en) 2020-09-02 2023-05-30 Honeywell International Inc. Self-checking node
US11991096B2 (en) 2020-09-02 2024-05-21 Honeywell International Inc. Unicast addressing for redundant communication paths
US11652663B1 (en) 2022-01-28 2023-05-16 Honeywell International Inc. Controller area network braided ring

Also Published As

Publication number Publication date
WO2005053240A3 (en) 2005-07-28
EP1698113A2 (en) 2006-09-06
JP2007511986A (ja) 2007-05-10
US20050198280A1 (en) 2005-09-08
WO2005053238A1 (en) 2005-06-09
WO2005053239A2 (en) 2005-06-09
US7505470B2 (en) 2009-03-17
EP1687943A1 (en) 2006-08-09
JP2007511991A (ja) 2007-05-10
US7649835B2 (en) 2010-01-19
JP2007511988A (ja) 2007-05-10
US20050135277A1 (en) 2005-06-23
JP2007511990A (ja) 2007-05-10
WO2005053237A1 (en) 2005-06-09
US20050152377A1 (en) 2005-07-14
WO2005053240A2 (en) 2005-06-09
US7502334B2 (en) 2009-03-10
US20050135278A1 (en) 2005-06-23
WO2005053239A3 (en) 2005-07-28
EP1692823A1 (en) 2006-08-23
EP1698112A2 (en) 2006-09-06
US20050129038A1 (en) 2005-06-16
US7729297B2 (en) 2010-06-01

Similar Documents

Publication Publication Date Title
US7606179B2 (en) High integrity data propagation in a braided ring
US7372859B2 (en) Self-checking pair on a braided ring network
US7668084B2 (en) Systems and methods for fault-tolerant high integrity data propagation using a half-duplex braided ring network
US7656881B2 (en) Methods for expedited start-up and clique aggregation using self-checking node pairs on a ring network
US7246186B2 (en) Mobius time-triggered communication
US11303584B2 (en) Dual fault-tolerant network using guardian interlocking
JP4709037B2 (ja) 車載データベースシステム
EP2573981A2 (en) System and method for encoding a slot table for a communications controller
US7668204B2 (en) Port driven authentication in a network
US11991096B2 (en) Unicast addressing for redundant communication paths
Driscoll et al. Maximizing fault tolerance in a low-s WaP data network
JP2009060418A (ja) ネットワーク障害検知方法、データ通信ネットワークシステムおよびノード装置
Böhm Introduction to FlexRay and TTA
Mahmud Various Emerging Time-Triggered Protocols for Drive-by-Wire Applications
JP2003087277A (ja) 通信システム及び通信制御装置

Legal Events

Date Code Title Description
AS Assignment

Owner name: HONEYWELL INTERNATIONAL INC., NEW JERSEY

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HALL, BRENDAN;DRISCOLL, KEVIN R.;PAULITSCH, MICHAEL;REEL/FRAME:015801/0947

Effective date: 20050221

STCF Information on status: patent grant

Free format text: PATENTED CASE

CC Certificate of correction
FPAY Fee payment

Year of fee payment: 4

FPAY Fee payment

Year of fee payment: 8

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 12