Method and system for load balancing
US-2016234298-A1 · Aug 11, 2016 · US
US11799586B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11799586-B2 |
| Application number | US-202117538184-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 30, 2021 |
| Priority date | Nov 7, 2014 |
| Publication date | Oct 24, 2023 |
| Grant date | Oct 24, 2023 |
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 data communication between a first node and a second node includes forming one or more redundancy messages from data messages at the first node using an error correcting code and transmitting first messages from the first node to the second node over a data path, the transmitted first messages including the data messages and the one or more redundancy messages. Second messages are received at the first node from the second node, which are indicative of: (i) a rate of arrival at the second node of the first messages, and (ii) successful and unsuccessful delivery of the first messages. A transmission rate limit and a window size are maintained according to the received second messages. Transmission of additional messages from the first node to the second node is limited according to the maintained transmission rate limit and window size.
Opening claim text (preview).
What is claimed is: 1. A method for data communication between a first node and a second node over a data path coupling the first node and the second node, the method comprising: transmitting a first message from the first node to the second node over the data path, the transmitted first message including data and redundancy information formed based on the data according to a first error correction parameter; receiving a second message at the first node from the second node, the second message being indicative of a condition of the data path; determining at the first node a second error correction parameter based on the second message, wherein the second error correction parameter is different from the first error correction parameter and includes a code rate; and transmitting from the first node to the second node over the data path additional messages comprising redundancy information according to the code rate. 2. The method of claim 1 , further comprising: receiving at the first node from the second node data indicative of: (i) a rate of arrival at the second node of messages transmitted from the first node, and (ii) successful and unsuccessful delivery of messages transmitted from the first node to the second node; maintaining a transmission rate limit according to the data indicative of (i) and (ii); and limiting a transmission rate of the transmission of the additional messages according to the maintained transmission rate limit. 3. The method of claim 1 , further comprising: receiving at the first node from the second node data indicative of: (i) a rate of arrival at the second node of messages transmitted from the first node, and (ii) successful and unsuccessful delivery of messages transmitted from the first node to the second node; maintaining a congestion control window size according to the data indicative of (i) and (ii); and limiting the transmission of the additional messages according to the congestion control rate. 4. The method of claim 3 , wherein the limiting the transmission of the additional messages according to the maintained congestion control window size includes limiting a number of the additional messages not yet acknowledged as successfully delivered to the second node according to the congestion control window size. 5. The method of claim 4 , wherein the data indicative of the rate of arrival comprises acknowledgment messages transmitted from the second node to the first node. 6. The method of claim 5 , wherein the rate of arrival of the acknowledgment messages includes a rate of acknowledgment of packets. 7. The method of claim 1 , wherein each of the first and second error correction parameters is a parameter of a linear error correcting code. 8. The method of claim 1 , wherein each of the first and second error correction parameters is a parameter of a nonlinear error correcting code. 9. A communication apparatus comprising a first device having an interface for passing messages to and from a second device over a data path coupling the first device to the second device, the first device further comprising a communication controller configured to: transmit a first messages to the second device over the data path, the transmitted first message including data and redundancy information formed based on the data according to a first error correction parameter; receive a second message from the second device, the second message being indicative of a condition of the data path; determine a second error correction parameter based on the second message, wherein the second error correction parameter is different from the first error correction parameter and includes a code rate; and transmit to the second device over the data path additional messages comprising redundancy information according to the code rate. 10. The communication apparatus of claim 9 , wherein the communication controller is further configured to: receive from the second device data indicative of: (i) a rate of arrival at the second device of messages transmitted from the first device, and (ii) successful and unsuccessful delivery messages transmitted from the first device to the second device; maintain a transmission rate limit according to the data indicative of (i) and (ii); and limit a transmission rate of the transmission of the additional messages according to the maintained transmission rate limit. 11. The communication apparatus of claim 9 , wherein the communication controller is further configured to: receive from the second device data indicative of: (i) a rate of arrival at the second device of messages transmitted from the first device, and (ii) successful and unsuccessful delivery messages transmitted from the first device to the second device; maintain a congestion control window size according to the data indicative of (i) and (ii); and limit transmission of the additional messages according to the congestion control window size. 12. The communication apparatus of claim 11 , wherein the communication controller is configured to limit the transmission of the additional messages according to the maintained congestion control window size by limiting a number of the additional messages not yet acknowledged as successfully delivered to the second device according to the congestion control window size. 13. The communication apparatus of claim 12 , wherein the data indicative of the rate of arrival comprises acknowledgment messages received from the second device. 14. The communication apparatus of claim 13 , wherein the rate of arrival of the acknowledgment messages includes a rate of acknowledgment of packets. 15. The communication apparatus of claim 9 , wherein each of the first and second error correction parameters is a parameter of a linear error correcting code. 16. The communication apparatus of claim 9 , wherein each of the first and second error correction parameters is a parameter of a nonlinear error correcting code.
Distributed coding, e.g. network coding, involving channel coding (coding in both space and time H04L1/0618; cooperative diversity H04B7/022) · CPC title
using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits {(H03M13/2906 takes precedence)} · CPC title
Linear codes · CPC title
with erasure correction and erasure determination, e.g. for packet loss recovery or setting of erasures for the decoding of Reed-Solomon codes · CPC title
using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.