Method and system for load balancing
US-2016234298-A1 · Aug 11, 2016 · US
US11817954B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11817954-B2 |
| Application number | US-202117538140-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 30, 2021 |
| Priority date | Nov 7, 2014 |
| Publication date | Nov 14, 2023 |
| Grant date | Nov 14, 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: forming at least one redundancy message from at least one data message at the first node; transmitting, based on a transmission parameter, a first message from the first node to the second node over the data path, the first message including the at least one data message and the at least one redundancy message; receiving, at a first time, a second message at the first node from the second node, the second message being indicative of a delivery of the first message to the second node over the data path; based on receiving, within a time period based on the first time, a third message at the first node from the second node, modifying the transmission parameter based on the second message, wherein the third message is indicative of an updated delivery of the first message to the second node over the data path; based on failing to receive, within the time period, the third message at the first node from the second node, maintaining the transmission parameter; and transmitting additional messages from the first node to the second node over the data path according to the transmission parameter. 2. The method of claim 1 , wherein the transmitting the additional messages according to the transmission parameter includes limiting a transmission rate of the additional messages. 3. The method of claim 1 , wherein the transmission parameter includes a congestion control window size. 4. The method of claim 1 , wherein the transmitting the additional messages includes limiting a number of the additional messages not yet acknowledged as successfully delivered to the second node according to a window size. 5. The method of claim 1 , wherein the receiving the second message indicative of the delivery of the first message to the second node over the data path includes receiving at least one acknowledgment message from the second node, wherein a rate of arrival of the at least one acknowledgment message is indicative of a rate of arrival of the first message at the second node. 6. The method of claim 5 , wherein the rate of arrival of the at least one acknowledgment message includes a rate of acknowledgment of packets. 7. The method of claim 1 , wherein the second message is indicative of a rate of arrival at the second node of the first message transmitted from the first node over the data path. 8. The method of claim 1 , wherein the transmission parameter is based on a linear error correcting code. 9. The method of claim 1 , wherein the transmission parameter is based on a nonlinear error correcting code. 10. 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: form at least one redundancy message from at least one data message at the first device; transmit, based on a transmission parameter, a first message from the first device to the second device over the data path, the first message including the at least one data message and the at least one redundancy message; receive, at a first time, a second message at the first device from the second device, the second message being indicative of a delivery of the first message to the second device over the data path; based on receiving, within a time period based on the first time, a third message at the first device from the second device, modify the transmission parameter based on the second message, wherein the third message is indicative of an updated delivery of the first message to the second device over the data path; based on failing to receive, within the time period, the third message at the first device from the second device, maintain the transmission parameter; and transmit additional messages from the first device to the second device over the data path according to the transmission parameter. 11. The communication apparatus of claim 10 , wherein the transmission of the additional messages according to the transmission parameter includes limiting a transmission rate of the additional messages. 12. The communication apparatus of claim 10 , wherein the transmission parameter includes a congestion control window size. 13. The communication apparatus of claim 10 , wherein the transmission of the additional messages according to the transmission parameter includes limiting a number of the additional messages not yet acknowledged as successfully delivered to the second device according to a window size. 14. The communication apparatus of claim 10 , wherein the receiving of the second message indicative of the delivery of the first message to the second device over the data path includes receiving at least one acknowledgment message from the second device, wherein a rate of arrival of the at least one acknowledgment message is indicative of a rate of arrival of the first message at the second device. 15. The communication apparatus of claim 14 , wherein the rate of arrival of the at least one acknowledgment message includes a rate of acknowledgment of packets. 16. The communication apparatus of claim 10 , wherein the second message is indicative of a rate of arrival at the second device of the first message transmitted from the first device over the data path. 17. The communication apparatus of claim 10 , wherein the transmission parameter is based on a linear error correcting code. 18. The communication apparatus of claim 10 , wherein the transmission parameter is based on a nonlinear error correcting code. 19. The method of claim 1 , wherein the transmission parameter includes at least one of, a block size, an interleaving factor, a code rate, a pacing rate, or a window size. 20. The communication apparatus of claim 10 , wherein the transmission parameter includes at least one of, a block size, an interleaving factor, a code rate, a pacing rate, or a window size.
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.