System and method enabling interactive services in alarm system environment
US-2024420555-A1 · Dec 19, 2024 · US
US11525712B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11525712-B2 |
| Application number | US-202015931891-A |
| Country | US |
| Kind code | B2 |
| Filing date | May 14, 2020 |
| Priority date | May 21, 2019 |
| Publication date | Dec 13, 2022 |
| Grant date | Dec 13, 2022 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method for transferring data blocks from a field device to a server, each data block including data describing an operation of the field device during a block time period is provided. The method includes setting a first and a second pointer delimiting a completed time period; and, until a predetermined transfer period elapses: transferring the data blocks having a block time period that is later than the second pointer to the server in a chronological order; and if all data blocks having a block time period that is later than the second pointer have been transferred to the server, transferring the data blocks having a block time period that is earlier than the first pointer to the server in an anti-chronological order. Data blocks can efficiently and reliably be transferred to the server.
Opening claim text (preview).
The invention claimed is: 1. A method for transferring data blocks from a field device to a server device, each data block comprising historical data describing an operation of the field device during a block time period, the method comprising: setting a first pointer and a second pointer delimiting a completed time period such that all data blocks having a block time period comprised within the completed time period have previously successfully been transferred from the field device to the server device; and until a predetermined transfer period elapses: transferring the data blocks having a block time period that is later than the second pointer to the server device in a chronological order starting from the data block having a block time period that is closest to the second pointer; and if all data blocks having a block time period that is later than the second pointer have been transferred to the server device, transferring the data blocks having a block time period that is earlier than the first pointer to the server device in an anti-chronological order starting from the data block having a block time period that is closest to the first pointer. 2. The method according to claim 1 , further comprising: updating a position of the second pointer upon completed transfer of the data block having a block time that is closest to the second pointer; and/or updating a position of the first pointer upon completed transfer of the data block having a block time that is closest to the first pointer. 3. The method according to claim 1 , further comprising: skipping the transfer of the one or several data blocks which have already been transferred to the server device when transferring the data blocks having a block time period that is later than the second pointer and/or earlier than the first pointer. 4. The method according to claim 1 , wherein the field device is a wind turbine. 5. The method according to claim 1 , further comprising: stopping the transfer of data blocks to the server device after completing any uncompleted data block transfer as soon as the predetermined transfer period elapses. 6. The method according to claim 1 , wherein each block time period has a same length in time. 7. The method according to claim 6 , wherein each block time period lasts between 1 and 20 minutes. 8. The method according to claim 1 , wherein the data blocks all have identical data structures. 9. The method according to claim 1 , further comprising: storing the data blocks in the field device after collection of the historical data and before transferring the data blocks to the server device. 10. A computer program product, comprising a computer readable hardware storage device having computer readable program code stored therein, said program code executable by a processor of a computer system to implement the method according to claim 1 when run on at least one computer. 11. A transfer device for transferring data blocks from a field device to a server device, each data block comprising historical data describing an operation of the field device during a block time period, the transfer device comprising: a setting unit for setting a first pointer and a second pointer delimiting a completed time period such that all data blocks having a block time period comprised within the completed time period have previously successfully been transferred from the field device to the server device; and a transfer unit for, until a predetermined transfer period elapses: transferring the data blocks having a block time period that is later than the second pointer to the server device in a chronological order starting from the data block having a block time period that is closest to the second pointer; and if all data blocks having a block time period that is later than the second pointer have been transferred to the server device, transferring the data blocks having a block time period that is earlier than the first pointer to the server device in an anti-chronological order starting from the data block having a block time period that is closest to the first pointer. 12. The transfer device according to claim 11 , for executing a method for transferring data blocks from the field device to the server device.
having a sequence of storage locations each being individually accessible for both enqueue and dequeue operations, e.g. using a RAM · CPC title
specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks · CPC title
having a sequence of storage locations each being individually accessible for both enqueue and dequeue operations, e.g. using random access memory {(G06F5/065 takes precedence)} · CPC title
using a wired architecture · CPC title
using burst mode transfer, e.g. direct memory access {DMA}, cycle steal (G06F13/32 takes precedence) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.