Methods and apparatus for high-integrity data transfer with preemptive blocking
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-011/10
H04L-001/00
출원번호
US-0595731
(2015-01-13)
등록번호
US-9641287
(2017-05-02)
발명자
/ 주소
Gilreath, Jon Douglas
Kreider, Thom
출원인 / 주소
HONEYWELL INTERNATIONAL INC.
대리인 / 주소
Lorenz & Kopf, LLP
인용정보
피인용 횟수 :
0인용 특허 :
33
초록▼
A method for performing high-integrity data transmission is provided. The method obtains a first set of data at a first transmitter and a second set of data at a second transmitter; develops a first key for the obtained first set of data and a second key for the obtained second set of data; and when
A method for performing high-integrity data transmission is provided. The method obtains a first set of data at a first transmitter and a second set of data at a second transmitter; develops a first key for the obtained first set of data and a second key for the obtained second set of data; and when the first key matches the second key, provides a receiver indication of validity of the first set of data. In certain embodiments, the method stores the first key and the second key within a predetermined window of time. In some embodiments, when the first key matches the second key, the method also synchronizes operation of the first transmitter and the second transmitter.
대표청구항▼
1. A method for performing high-integrity data transmission, the method comprising: obtaining a first set of data at a first transmitter and a second set of data at a second transmitter;developing a first key for the obtained first set of data and a second key for the obtained second set of data; an
1. A method for performing high-integrity data transmission, the method comprising: obtaining a first set of data at a first transmitter and a second set of data at a second transmitter;developing a first key for the obtained first set of data and a second key for the obtained second set of data; andwhen the first key matches the second key, permitting one or more receivers to access at least one of the first set of data and the second set of data, by: passing a pointer to the first key to the one or more receivers, wherein the pointer references a first memory location of the first key, and wherein the first key comprises a memory location of the first set of data. 2. The method of claim 1, wherein the obtaining step further comprises: performing a mathematical calculation to create the first set of data and the second set of data. 3. The method of claim 1, wherein the obtaining step further comprises: receiving a first complete dataset at the first transmitter, wherein the first set of data comprises the first complete dataset; andreceiving a second complete dataset at the second transmitter, the second set of data comprising the second complete dataset. 4. The method of claim 1, further comprising: storing the first set of data in a first buffer; andstoring the second set of data in a second buffer;wherein the permitting step further comprises providing the one or more receivers with access information for at least one of the first buffer and the second buffer. 5. The method of claim 1, wherein the comparing step is performed at the first transmitter. 6. The method of claim 1, wherein the comparing step is performed by at least one of the one or more receivers. 7. The method of claim 1, wherein the comparing step is performed at an intermediate node; and wherein the intermediate node comprises a computing element separate and distinct from the first transmitter, the second transmitter, and the one or more receivers. 8. The method of claim 1, wherein, when a match between the first key and the second key has not been determined, denying the one or more receivers access to the first set of data and the second set of data. 9. The method of claim 8, wherein the denying step further comprises preventing the one or more receivers from accessing the first key and the second key. 10. A system for preventing error transmission in a computational environment, the system comprising: a plurality of transmitters, wherein a first one of the plurality of transmitters is configured to communicate a first set of data and a second one of the plurality of transmitters is configured to communicate a second set of data;at least one receiver, configured to obtain data from the plurality of transmitters; andprocessing logic, configured to: create a first key associated with the first set of data and a second key associated with the second set of data;compare the first key to the second key to determine whether the first key matches the second key; andtransmit data retrieval details to the receiver when the first key matches the second key, wherein the data retrieval details facilitate access to the first set of data by the receiver;wherein the data retrieval details comprise a pointer to the first key, wherein the pointer references a first memory location of the first key, and wherein the first key comprises a memory location of the first set of data. 11. The system of claim 10, wherein each of the plurality of transmitters performs a mathematical calculation to create the first set of data and the second set of data. 12. The system of claim 10, wherein the first one of the plurality of transmitters is further configured to receive an entirety of the first set of data, prior to communicating the first set of data; and wherein the second one of the plurality of transmitters is further configured to receive an entirety of the second set of data, prior to communicating the second set of data. 13. A non-transitory, computer-readable medium containing instructions thereon, which, when executed by a processor, perform a method comprising: creating a first key using a first set of data and a second key using a second set of data, by: performing a first cyclic redundancy check (CRC), using the first set of data, to obtain a first result; andperforming a second CRC, using the second set of data, to obtain a second result, wherein the first key comprises the first result, and the second key comprises the second result;comparing the first key that uniquely characterizes the first set of data to the second key that uniquely characterizes the second set of data;when the first key matches the second key, determining that the first set of data and the second set of data comprise valid datasets and providing access to the first set of data to a receiver; andwhen the first key does not match the second key, determining that the first set of data and the second set of data do not comprise valid datasets and preventing access to the first set of data by the receiver. 14. A non-transitory, computer-readable medium containing instructions thereon, which, when executed by a processor, perform a method comprising: creating a first key using a first set of data and a second key using a second set of data, by: performing a first checksum, using the first set of data, to obtain a first result; andperforming a second checksum, using the second set of data, to obtain a second result, wherein the first key comprises the first result, and the second key comprises the second result;comparing the first key that uniquely characterizes the first set of data to the second key that uniquely characterizes the second set of data;when the first key matches the second key, determining that the first set of data and the second set of data comprise valid datasets and providing access to the first set of data to a receiver; andwhen the first key does not match the second key, determining that the first set of data and the second set of data do not comprise valid datasets and preventing access to the first set of data by the receiver. 15. A method for performing high-integrity data transmission, the method comprising: obtaining a first set of data at a first transmitter and a second set of data at a second transmitter;developing a first key for the obtained first set of data and a second key for the obtained second set of data;storing the first key and the second key within a predetermined window of time, wherein the first key is stored at a first timing value and the second key is stored at a second timing value, wherein the first timing value and the second timing value are separated by an allowable amount of timing error, and wherein the predetermined window of time includes the first timing value, the second timing value, and the allowable amount of timing error; andwhen the first key matches the second key, providing a receiver indication of validity of the first set of data, by: passing a pointer to the first key to the receiver, wherein the pointer references a first memory location of the first key, and wherein the first key comprises a memory location of the first set of data; andsynchronizing operation of the first transmitter and the second transmitter. 16. The method of claim 15, wherein the obtaining step further comprises creating the first set of data and the second set of data. 17. The method of claim 15, wherein the obtaining step further comprises: receiving a first complete dataset at the first transmitter, wherein the first set of data comprises the first complete dataset; andreceiving a second complete dataset at the second transmitter, the second set of data comprising the second complete dataset. 18. The method of claim 15, further comprising: storing the first set of data in a first buffer; andstoring the second set of data in a second buffer;wherein the permitting step further comprises providing the receiver with access information for the first buffer and the second buffer. 19. The method of claim 15, wherein the comparing step is performed at the first transmitter. 20. The method of claim 15, wherein the comparing step is performed at the receiver. 21. The method of claim 15, wherein the comparing step is performed at an intermediate node; and wherein the intermediate node comprises a computing element separate and distinct from the first transmitter, the second transmitter, and the receiver. 22. The method of claim 15, wherein, when a match between the first key and the second key has not been determined, providing no indication of validity to the receiver. 23. The method of claim 22, wherein, when a match between the first key and the second key has not been determined, providing no indication of validity to the receiver; andperforming no synchronization of the first transmitter and the second transmitter. 24. A system for preventing error transmission in a computational environment, the system comprising: a plurality of transmitters, wherein a first one of the plurality of transmitters is configured to communicate a first set of data and a second one of the plurality of transmitters is configured to communicate a second set of data;at least one receiver, configured to obtain data from the plurality of transmitters; andprocessing logic, configured to: create a first key associated with the first set of data and a second key associated with the second set of data;determine whether a timing condition has been satisfied, by: detect a first timing value associated with recognition of the first set of data, and a second timing value associated with recognition of the second set of data; andcompare the first timing value to the second timing value to determine whether the timing condition has been satisfied, wherein the timing condition comprises recognizing the first timing value and the second timing value within a predetermined timing window;compare the first key to the second key to determine whether the first key matches the second key; andwhen the first key matches the second key, and the timing condition has been satisfied, transmit data retrieval details to the receiver, wherein the data retrieval details facilitate access to the first set of data by the receiver; andsynchronize operation of the plurality of transmitters and the at least one receiver. 25. The system of claim 24, wherein the timing condition comprises identical values for the first timing value and the second timing value, and wherein the predetermined timing window comprises a simultaneous occurrence of the recognition of the first set of data and the recognition of the second set of data. 26. The system of claim 24, wherein the data retrieval details comprise the first key, wherein the first key comprises a memory location of the first set of data. 27. The system of claim 24, wherein the data retrieval details comprise a pointer to the first key, wherein the pointer references a first memory location of the first key, and wherein the first key comprises a memory location of the first set of data.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (33)
Patrick Coronato ; Joseph Pona, Angular rate and reaction torque assembly.
Didinsky Garry ; Nayak Arunkumar P. ; Li Rongsheng ; Wu Yeong-Wei A. ; Kurland Jeffrey A. ; Needelman David D., Attitude determination system and method.
Klupar,George J.; Potter,Calvin C.; Brault,Sharon K.; Pinkerton,Robert J.; Kolecki,Norman Stanley, Dual voltage integrated power and attitude control system and method.
Li, Rongsheng; Kurland, Jeffrey A.; Dawson, Alec M.; Wu, Yeong-Wei A.; Uetrecht, David S., Spacecraft methods and structures with enhanced attitude control that facilitates gyroscope substitutions.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.