Packet coding based network communication

US10924216B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10924216-B2
Application numberUS-201916277055-A
CountryUS
Kind codeB2
Filing dateFeb 15, 2019
Priority dateNov 7, 2014
Publication dateFeb 16, 2021
Grant dateFeb 16, 2021

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A method for data communication between a first node and a second node over a data path includes forming one or more redundancy messages from data messages at the first node using an error correcting code and transmitting messages from the first node to the second node. The transmitted first messages include the data messages and the redundancy messages. The method includes, receiving, at the first node, second messages indicative of a rate of arrival at the second node of the messages transmitted from the first node, and of successful and unsuccessful delivery of the first messages transmitted from the first node to the second node. A first transmission limit and a second transmission limit 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 first and the second transmission limits.

First claim

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 one or more redundancy messages from data messages at the first node using an error correcting code; transmitting first messages from the first node to the second node over the data path, the transmitted first messages including the data messages and the one or more redundancy messages; receiving second messages at the first node from the second node, the second messages being indicative of a rate of arrival at the second node of the first messages transmitted from the first node, and of successful and unsuccessful delivery of the first messages transmitted from the first node to the second node; maintaining a first transmission limit according to the received second messages; maintaining a second transmission limit according to the received second messages; and limiting transmission of additional messages from the first node to the second node according to the first transmission limit, and according to the second transmission limit. 2. The method of claim 1 wherein maintaining the first transmission limit comprises maintaining a transmission rate limit, and wherein limiting transmission of the additional messages according to the first transmission limit includes limiting a transmission rate of said additional messages. 3. The method of claim 1 wherein maintaining the second transmission limit comprises maintaining a window size. 4. The method of claim 3 wherein the window size comprises a congestion control window size. 5. The method of claim 1 wherein limiting transmission of the additional messages according to the second transmission limit includes limiting a number of the additional messages not yet acknowledged as successfully delivered to the second node according to a window size. 6. The method of claim 1 wherein receiving the second messages indicative of the rate of arrival comprises receiving acknowledgement messages from the second node, wherein a rate of arrival of said acknowledgment messages is indicative of the rate of arrival of the first messages at the second node. 7. The method of claim 6 wherein the rate of arrival of the acknowledgement messages includes a rate of acknowledgement of packets. 8. The method of claim 1 wherein the second messages include third messages indicative of the rate of arrival and fourth messages indicative of successful and unsuccessful delivery of the first messages. 9. The method of claim 1 wherein the error correcting code is a linear error correcting code. 10. The method of claim 1 wherein a single message of the second messages is indicative of the rate of arrival at the second node of the first messages transmitted from the first node, and of successful and unsuccessful delivery of the first messages transmitted from the first node to the second node. 11. A communication apparatus comprising a first device having an interface for passing messages to and from a second device over a communication path coupling the first device to second device, the first device further comprising communication controller configured to form one or more redundancy messages from data messages at the first node using an error correcting code; transmit first messages from the first node to the second node over the data path, the transmitted first messages including the data messages and the one or more redundancy messages; receive second messages at the first node from the second node, the second messages being indicative of a rate of arrival at the second node of the first messages transmitted from the first node, and of successful and unsuccessful delivery of the first messages transmitted from the first node to the second node; maintain a first transmission limit according to the received second messages; maintain a second transmission limit according to the received second messages; and limit transmission of additional messages from the first node to the second node according to the first transmission limit, and according to the second transmission limit. 12. The communication apparatus of claim 11 wherein maintaining the first transmission limit comprises maintaining a transmission rate limit, and wherein limiting transmission of the additional messages according to the first transmission limit includes limiting a transmission rate of said additional messages. 13. The communication apparatus of claim 11 wherein maintaining the second transmission limit comprises maintaining a window size. 14. The communication apparatus of claim 13 wherein the window size comprises a congestion control window size. 15. The communication apparatus of claim 11 wherein limiting transmission of the additional messages according to the second transmission limit includes limiting a number of the additional messages not yet acknowledged as successfully delivered to the second node according to a window size. 16. The communication apparatus of claim 11 wherein receiving third messages indicative of the rate of arrival comprises receiving acknowledgement messages from the second node, wherein a rate of arrival of said acknowledgment messages is indicative of the rate of arrival of the first messages at the second node. 17. The communication apparatus of claim 16 wherein the rate of arrival of the acknowledgement messages includes a rate of acknowledgement of packets. 18. The communication apparatus of claim 11 wherein the second messages include third messages indicative of the rate of arrival and fourth messages indicative of successful and unsuccessful delivery of the first messages. 19. The communication apparatus of claim 11 wherein the error correcting code is a linear error correcting code. 20. The communication apparatus of claim 11 wherein a single message of the second messages is indicative of the rate of arrival at the second node of the first messages transmitted from the first node, and of successful and unsuccessful delivery of the first messages transmitted from the first node to the second node.

Assignees

Inventors

Classifications

  • using bitmaps · CPC title

  • Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets · CPC title

  • H04L1/0076Primary

    Distributed coding, e.g. network coding, involving channel coding (coding in both space and time H04L1/0618; cooperative diversity H04B7/022) · CPC title

  • Linear codes · CPC title

  • Arrangements at the transmitter end · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10924216B2 cover?
A method for data communication between a first node and a second node over a data path includes forming one or more redundancy messages from data messages at the first node using an error correcting code and transmitting messages from the first node to the second node. The transmitted first messages include the data messages and the redundancy messages. The method includes, receiving, at the f…
Who is the assignee on this patent?
Strong Force Iot Portfolio 2016 Llc
What technology area does this patent fall under?
Primary CPC classification H04L1/0076. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Feb 16 2021 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 12 related publications on this page (citations in our corpus or others sharing the same primary CPC).