NETWORK COMMUNICATION RECODING NODE

• US 20170012885A1
• Filed: 03/04/2016
• Published: 01/12/2017
• Est. Priority Date: 07/07/2015
• Status: Active Grant

• Current Assignee: Strong Force IoT Portfolio 2016, LLC (Strong Force Intellectual Capital, LLC)
• Original Assignee: Speedy Packets, Inc.
• Inventors: Ho, Tracey
• Granted Patent: US 10,554,565 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: H04L 1/0002 by adapting the transmission rate
• CPC Class Codes: H04L 1/0009 by adapting the channel coding H04L1/1812 takes precedence
• CPC Class Codes: H04L 1/0041 Arrangements at the transmitter end
• CPC Class Codes: H04L 1/0076 Distributed coding, e.g. network coding, involving channel coding coding in both space and time H04L1/0618; cooperative diversity H04B7/022
• CPC Class Codes: H04L 1/1819 with retransmission of additional or different redundancy
• CPC Class Codes: H04L 1/1858 Transmission or retransmission of more than one copy of acknowledgement message
• CPC Class Codes: H04L 2001/0097 Relays
• CPC Class Codes: H04L 43/0829 Packet loss
• CPC Class Codes: H04L 43/0864 Round trip delays
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/24 Multipath
• CPC Class Codes: H04L 45/52 Multiprotocol routers
• CPC Class Codes: H04L 45/74 Address processing for routing
• CPC Class Codes: H04L 47/127 by using congestion prediction
• CPC Class Codes: H04L 47/16 in connection oriented networks, e.g. frame relay
• CPC Class Codes: H04L 47/20 Traffic policing
• CPC Class Codes: H04L 47/263 Rate modification at the source after receiving feedback
• CPC Class Codes: H04L 47/27 Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
• CPC Class Codes: H04L 47/283 in response to processing delays, e.g. caused by jitter or round trip time [RTT]
• CPC Class Codes: H04L 47/30 in combination with information about buffer occupancy at either end or at transit nodes
• CPC Class Codes: H04L 49/351 : for local area network [LAN], e.g. Ethernet switches
• CPC Class Codes: H04L 49/552 : by ensuring the integrity of packets received through redundant connections
• CPC Class Codes: H04L 49/90 : Buffering arrangements
• CPC Class Codes: H04L 5/0055 : Physical resource allocation for ACK/NACK for physical mapping arrangements in ARQ protocols H04L1/1861
• CPC Class Codes: H04L 67/01 : Protocols
• CPC Class Codes: H04L 67/04 : specially adapted for terminals or networks with limited capabilities; specially adapted for terminal portability
• CPC Class Codes: H04L 67/141 : Setup of application sessions admission control or resource allocation in data switching networks H04L47/70
• CPC Class Codes: H04L 67/56 : Provisioning of proxy services store-and-forward switching systems in data switching networks H04L12/54
• CPC Class Codes: H04L 69/161 : Implementation details of TCP/IP or UDP/IP stack architecture; Specification of modified or new header fields
• CPC Class Codes: H04L 69/40 : for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection management of faults, events, alarms or notifications in data switching networks H04L41/06
• CPC Class Codes: H04W 28/04 : Error control
• CPC Class Codes: H04W 72/535 : based on resource usage policies

Abstract

A method for modifying redundancy information associated with encoded data passing from a first node to a second node over data paths includes receiving first encoded data including first redundancy information at an intermediate node from the first node via a first channel connecting the first node and the intermediate node, the first channel having first channel characteristics and transmitting second encoded data including second redundancy information from the intermediate node to the second node via a second channel connecting the intermediate node and the second node, the second channel having second channel characteristics. A degree of redundancy associated with the second redundancy information is determined by modifying the first redundancy information based on one or both of the first channel characteristics and the second channel characteristics without decoding the first encoded data.

Claims

1. A method for modifying redundancy information associated with encoded data passing from a first node to a second node over a plurality of data paths, the method comprising:

receiving first encoded data including first redundancy information at an intermediate node from the first node via a first channel connecting the first node and the intermediate node, the first channel having first channel characteristics;

transmitting second encoded data including second redundancy information from the intermediate node to the second node via a second channel connecting the intermediate node and the second node, the second channel having second channel characteristics;

wherein a degree of redundancy associated with the second redundancy information is determined by modifying the first redundancy information based on one or both of the first channel characteristics and the second channel characteristics without decoding the first encoded data, including modifying the first redundancy information based on one or more of a block size, a congestion window size, and a pacing rate associated with the first channel characteristics and/or the second channel characteristics.

2. The method of claim 1 wherein modifying the first redundancy information includes adding redundancy information to the first redundancy information.

3. The method of claim 1 wherein modifying the first redundancy information includes removing redundancy information from the first redundancy information.

4. The method of claim 1 wherein the second redundancy information is further formed by modifying the first redundancy information based on feedback from the second node indicative of successful or unsuccessful delivery of the encoded data to the second node.

5. The method of claim 1 wherein the first encoded data and the second encoded data are encoded using a random linear network code.

6. The method of claim 1 further comprising sending a feedback message from the intermediate node to the first node acknowledging receipt of one or more messages at the intermediate node.

7. The method of claim 1 further comprising receiving a feedback message from the second node at the intermediate node and, in response to receiving the feedback message, transmitting additional redundancy information to the second node.

8. A system for modifying redundancy information associated with encoded data passing from a first node to a second node over a plurality of data paths, the system comprising:

an intermediate node configured to

receive first encoded data including first redundancy information from the first node via a first channel connecting the first node and the intermediate node, the first channel having first channel characteristics;

transmit second encoded data including second redundancy information from the intermediate node to the second node via a second channel connecting the intermediate node and the second node, the second channel having second channel characteristics;

wherein a degree of redundancy associated with the second redundancy information is determined by modifying the first redundancy information based on one or both of the first channel characteristics and the second channel characteristics without decoding the first encoded data, including modifying the first redundancy information based on one or more of a block size, a congestion window size, and a pacing rate associated with the first channel characteristics and/or the second channel characteristics.

9. The system of claim 8 wherein modifying the first redundancy information at the intermediate node includes adding redundancy information to the first redundancy information.

10. The system of claim 8 wherein modifying the first redundancy information at the intermediate node includes removing redundancy information from the first redundancy information.

11. The system of claim 8 wherein the second redundancy information is further formed by the intermediate node by modifying the first redundancy information based on feedback from the second node indicative of successful or unsuccessful delivery of the encoded data to the second node.

12. The system of claim 8 wherein the first encoded data and the second encoded data are encoded using a random linear network code.

13. The system of claim 8 further comprising sending a feedback message from the intermediate node to the first node acknowledging receipt of one or more messages at the intermediate node.

14. The system of claim 8 further comprising receiving a feedback message from the second node at the intermediate node and, in response to receiving the feedback message, transmitting additional redundancy information to the second node.

15. Software stored on non-transitory computer-readable media comprising instructions for causing an intermediate node in a data communication system to modify redundancy information associated with encoded data passing from a first node to a second node over a plurality of data paths, the method comprising:

receiving first encoded data including first redundancy information at the intermediate node from the first node via a first channel connecting the first node and the intermediate node, the first channel having first channel characteristics;

transmitting second encoded data including second redundancy information from the intermediate node to the second node via a second channel connecting the intermediate node and the second node, the second channel having second channel characteristics;

wherein a degree of redundancy associated with the second redundancy information is determined by modifying the first redundancy information based on one or both of the first channel characteristics and the second channel characteristics without decoding the first encoded data, including modifying the first redundancy information based on one or more of a block size, a congestion window size, and a pacing rate associated with the first channel characteristics and/or the second channel characteristics.