Voting mechanism for transmission schedule enforcement

• US 7,873,739 B2
• Filed: 11/19/2004
• Issued: 01/18/2011
• Est. Priority Date: 11/19/2003
• Status: Active Grant

• Current Assignee: Honeywell International Inc., TTTech Computertechnik AG
• Original Assignee: Honeywell International Inc.
• Inventors: Driscoll, Kevin R., Angelow, Harald, Wachter, Matthias, Hall, Brendan
• Primary Examiner(s): Najjar; Saleh
• Assistant Examiner(s): HUQ, FARZANA B
• Application Number:
  US10/993,910
• Publication Number:
  US 20050278457A1
• Time in Patent Office: 2,251 Days
• Field of Search: 709/217, 709/219, 709/232, 709/238, 709/240, 370/411, 370/458, 370/282, 370442-448
• US Class Current: 709/230
• CPC Class Codes: H04L 12/40026 Details regarding a bus guardian
• CPC Class Codes: H04L 12/417 with deterministic access, e.g. token passing
• CPC Class Codes: H04L 12/43 with synchronous transmission, e.g. time division multiplex [TDM], slotted rings
• CPC Class Codes: H04L 12/44 Star or tree networks
• CPC Class Codes: H04L 12/6418 Hybrid transport
• CPC Class Codes: H04L 2012/445 with switching in a hub, e.g. ETHERNET switch
• CPC Class Codes: H04L 2012/644 Star
• CPC Class Codes: H04L 2012/6448 Medium Access Control [MAC]
• CPC Class Codes: H04L 2012/6459 Multiplexing, e.g. TDMA, CDMA
• CPC Class Codes: H04L 2012/6489 Buffer Management, Threshold setting, Scheduling, Shaping
• CPC Class Codes: H04L 67/125 involving control of end-device applications over a network
• CPC Class Codes: H04L 67/62 Establishing a time schedule for servicing the requests

Abstract

Method and systems of transmission schedule enforcement in a hub-based network is provided. Method includes receiving guardian messages from one or more of a plurality of nodes, implementing a voting function, voting the received guardian messages using the voting function, and when a clear winner of the received guardian messages is detected, enabling a port indicated by the clear winner to propagate. The guardian messages are received outside of TDMA communications. The guardian messages contain information pertaining to the next slot or slots to transmit.

Claims

1. A method of transmission schedule enforcement in a hub-based network, the method comprising:

receiving guardian messages from one or more of a plurality of nodes, wherein the guardian messages are embedded in data communications;

extracting the guardian messages from the data communications;

voting the received guardian messages using a voting function; and

wherein the guardian messages contain information pertaining to the node or nodes that have been scheduled to transmit in a next slot or slots;

when a clear winner of the voted guardian messages is detected, enabling one or more ports determined based upon the information contained within the guardian message of the clear winner to propagate.

2. The method of claim 1, further comprising communicating data over half-duplex communication links.

3. The method of claim 1, wherein the information contained in the guardian messages includes slot length of the next one or more.

4. The method of claim 1, further comprising retrieving the one or more ports to propagate from a slot to guardian port look up table.

5. The method of claim 1, further comprising when a winner of the voted guardian messages is not detected, implementing an arbitration function, selecting a guardian message, retrieves one or more ports to propagate next from a slot to guardian port look up table based on the one or more slots of the selected guardian message and enabling the one or more ports to propagate.

6. The method of claim 1, wherein voting the received guardian messages using a voting function comprising voting the received guardian messages using a fault tolerant voting function.

7. The method of claim 1, further comprising when a winning guardian message is not detected blocking transmissions.

8. A method of transmission schedule enforcement in a hub-based network, the method comprising:

receiving guardian messages from one or more of a plurality of nodes, wherein the guardian messages are embedded in data communications;

extracting the guardian messages from the data communications;

wherein each of the guardian messages contains a portion of a complete transmission schedule, wherein each portion partially overlaps the next portion;

comparing the overlaps of consecutive portions of the complete transmission schedule; and

when the overlap portions agree, assembling the portions of the complete transmission schedule;

executing the assembled transmission schedule.