Multi-layer QoS management in a distributed computing environment
US-9521089-B2 · Dec 13, 2016 · US
US10110424B1 · US · B1
| Field | Value |
|---|---|
| Publication number | US-10110424-B1 |
| Application number | US-201715639378-A |
| Country | US |
| Kind code | B1 |
| Filing date | Jun 30, 2017 |
| Priority date | Jun 30, 2017 |
| Publication date | Oct 23, 2018 |
| Grant date | Oct 23, 2018 |
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 node failure recovery tool includes an interface and one or more processors. The interface is configured to receive a first portion and a second portion of state information from a first node. The one or more processors are configured to determine a time that the first portion of state information was received and store the first portion of state information and the time that the first portion of state information was received. The one or more processors are further configured to determine a time that the second portion of state information was received and start a timer, determine that the timer has expired and that the third portion of state information has not been received, and after determining that the first node has crashed, send a retrieved second portion of state information to the first node so that the first node can recover from the crash.
Opening claim text (preview).
What is claimed is: 1. A node failure recovery tool comprising: an interface configured to receive a first portion and a second portion of state information from a first node, each of the first and second portion of state information comprising data about a user and an action and an indication that a third portion of state information is to be received; one or more processors configured to: determine a time that the first portion of state information was received; store, in a memory, the first portion of state information and the time that the first portion of state information was received; upon receiving the second portion of state information from the first node, determine a time that the second portion of state information was received and start a timer; determine that the second portion of state information comprises data about a first user and a first action; determine that the stored first portion of state information comprises data about the first user and the first action; in response to determining that the time that the second portion of state information was received is later than the time that the first portion of state information was received and that the first and second portions of state information comprises data about the first user and the first action, replace, in the memory, the first portion of state information with the second portion of state information; determine that the timer has expired and that the third portion of state information has not been received; upon determining that the timer has expired and that the third portion of state information has not been received, determine that the first node has crashed; after determining that the first node has crashed, retrieve, from the memory, the second portion of state information and send the retrieved second portion of state information to the first node so that the first node can recover from the crash. 2. The node failure recovery tool of claim 1 , wherein the node failure recovery tool is positioned in a middleware layer of a distribution system. 3. The node failure recovery tool of claim 1 , wherein sending the second portion of state information to the first node prevents the node failure recovery tool from receiving state information that was previously received from the first node. 4. The node failure recovery tool of claim 1 , wherein the one or more processors are further configured to determine a throughput corresponding to the first node, wherein the throughput is based at least on the time that the first portion of state information was received by the first node. 5. The node failure recovery tool of claim 1 , wherein the one or more processors are further configured to determine a latency corresponding to the first node, wherein the latency is based on an amount of time that has passed between the first node's receipt of a first portion of state information and the first node's sending of the first portion of state information. 6. The node failure recovery tool of claim 1 , wherein each portion of state information received from the first node is a portion of a larger set of data that the first node is communicating to a second node. 7. The node failure recovery tool of claim 6 , wherein sending the state information that was last received from the first node to the first node prevents the first node from sending the larger set of data to the second node more than once. 8. A method comprising: receiving a first portion and a second portion of state information from a first node, each of the first and second portion of state information comprising data about a user and an action and an indication that a third portion of state information is to be received; determining a time that the first portion of state information was received; storing, in a memory, the first portion of state information and the time that the first portion of state information was received; upon receiving the second portion of state information from the first node, determining a time that the second portion of state information was received and start a timer; determining that the second portion of state information comprises data about a first user and a first action; determining that the stored first portion of state information comprises data about the first user and the first action; in response to determining that the time that the second portion of state information was received is later than the time that the first portion of state information was received and that the first and second portions of state information comprises data about the first user and the first action, replacing, in the memory, the first portion of state information with the second portion of state information; determining that the timer has expired and that the third portion of state information has not been received; upon determining that the timer has expired and that the third portion of state information has not been received, determining that the first node has crashed; after determining that the first node has crashed, retrieving, from the memory, the second portion of state information and sending the retrieved second portion of state information to the first node so that the first node can recover from the crash. 9. The method of claim 8 , wherein sending the second portion of state information to the first node prevents the node failure recovery tool from receiving state information that was previously received from the first node. 10. The method of claim 8 , determining a throughput corresponding to the first node, wherein the throughput is based at least on the time that the first portion of state information and the time that the second portion of state information was received from the first node. 11. The method of claim 8 , further comprising determining a latency corresponding to the first node, wherein the latency is based on an amount of time that has passed between the first node's receipt of a first portion of state information and the first node's sending of the first portion of state information. 12. The method of claim 8 , wherein each portion of state information received from the first node is a portion of a larger set of data that the first node is communicating to a second node. 13. The method of claim 12 , wherein sending the state information that was last received from the first node to the first node prevents the first node from sending the larger set of data to the second node more than once. 14. A system comprising: a first node configured to send a first portion and a second portion of state information, each of the first and second portion of state information comprising data about a user and an action and an indication that a third portion of state information is to be received; and a node failure recovery tool comprising: an interface configured to receive the first portion and the second portion of state information from the first node; and one or more processors configured to: determine a time that the first portion of state information was received; store, in a memory, the first portion of state information and the time that the first portion of state information was received; upon receiving the second portion of state information from the first node, determine a time that the second portion of state information was received and start a timer; determine that the second portion of state information comprises data about a first user and a first action; determine that the stored first portion of state information comprises data about the first user and the first action; in response to determining that the time that the second portion of
Electricity · mapped topic
Localisation of faults · CPC title
Round trip delays · CPC title
by reconfiguring faulty entities · CPC title
involving time analysis · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.