Cooperative subspace demultiplexing in content delivery networks

Patent metadata

Field	Value
Publication number	US-9819449-B2
Application number	US-201414168466-A
Country	US
Kind code	B2
Filing date	Jan 30, 2014
Priority date	May 14, 2002
Publication date	Nov 14, 2017
Grant date	Nov 14, 2017

Abstract

A source node selects a plurality of original data components to transfer to at least one destination node. A plurality of transmitting nodes cooperatively encodes the original data components to generate a plurality of subspace coded components and a corresponding code matrix. Each of the transmitting nodes transmits a subset of the plurality of subspace coded components and corresponding code matrix, wherein at least one of the transmitting nodes has a rank that is insufficient for decoding the plurality of subspace coded components. A destination node may employ a plurality of receiving nodes to cooperatively receive a plurality of subspace coded components and their corresponding code vectors, wherein the rank of at least one of the receiving nodes is insufficient for decoding the subspace coded components. The destination node builds up the dimension of the subspace spanned by code vectors it collects from the receiving nodes and then decodes the subspace coded components.

First claim

The invention claimed is:

1. A processing method for retrieving data in a content delivery network, comprising:
selecting a plurality of receiving nodes to cooperatively receive a plurality of linearly independent coded components and a plurality of corresponding code vectors, wherein a rank of at least one of the receiving nodes is insufficient for decoding the coded components;
building up a dimension of a subspace spanned by collected code vectors by collecting the coded components and the corresponding code vectors from the plurality of receiving nodes, and in response to a user input, selecting a destination node from a plurality of user-selectable client devices, and combining the coded components and the corresponding code vectors at the destination node; and
decoding the coded components.

2. The processing method recited in claim 1 , wherein at least one of selecting and building comprises at least one of ensuring that a code matrix generated from the corresponding code vectors has sufficient rank to enable decoding, and ensuring the code matrix is sufficiently well-conditioned to permit decoding.

3. The processing method recited in claim 1 , further comprising transmitting at least one acknowledgement to at least one source node upon at least one of receiving a coded component and decoding the coded components.

4. The processing method recited in claim 1 , wherein decoding is configured for decoding at least one of a set of coded components, the set comprising block coded components and sliding window coded components.

5. A non-transitory computer-readable medium storing a computer program configured for implementing the method of claim 1 .

6. A method for processing data in a content delivery network, comprising:
determining a required number of degrees of freedom for decoding a set of linearly coded packets;
based on the required number of degrees of freedom, selecting at least one additional receiving node for cooperatively receiving at least one coded packet and associated code vector;
collecting a plurality of coded packets and associated code vectors from a plurality of cooperating receiving nodes, including the at least one additional receiving node, to provide the required number of degrees of freedom, wherein the plurality of receiving nodes comprises a destination node and at least one user-selectable client device, and wherein collecting comprises, in response to a user input, selecting one of the at least one user-selectable client device as a new destination node and combining the plurality of coded packets and associated code vectors at the new destination node to enable the new destination node to decode the plurality of coded packets; and
decoding the plurality of coded packets.

7. The method recited in claim 6 , wherein at least one of selecting and collecting comprises ensuring that a code matrix produced from the associated code vectors is sufficiently well-conditioned to permit decoding.

8. The method recited in claim 6 , further comprising transmitting at least one acknowledgement to at least one source node upon at least one of collecting a coded packet and decoding the coded packets.

9. The method recited in claim 6 , wherein decoding is configured to employ at least one of block codes and sliding window codes.

10. A non-transitory computer-readable medium storing a computer program configured for implementing the method of claim 6 .

11. A method for receiving data in a content delivery network, comprising:
connecting to a first network channel and at least a second network channel to simultaneously receive a plurality of linearly coded packets and corresponding code vectors transmitted from a source node;
receiving a first subset of the plurality of linearly coded packets and corresponding code vectors on the first network channel and receiving a second subset of the plurality of linearly coded packets and corresponding code vectors on the at least second network channel, wherein at least one of the first subset and the second subset has a rank that is insufficient for decoding the plurality of linearly coded packets, and wherein a sum of ranks of the first subset and the second subset is sufficient for decoding the plurality of linearly coded packets, and in response to a user input, selecting a destination node from a plurality of user-selectable client devices;
combining the first subset with the second subset at the destination node; and
decoding the plurality of linearly coded packets.

12. The method recited in claim 11 , wherein the first network channel resides on a first network and the at least second network channel resides on a second network, the second network different than the first network.

13. The method recited in claim 11 , further comprising monitoring at least one real-time property of the first network channel and the at least second network channel; and instructing the source node to adjust at least one of coding and transmitting the plurality of linearly coded packets and corresponding code vectors.

14. The method recited in claim 11 , wherein receiving the first subset and receiving the second subset comprises ensuring that a code matrix produced from the corresponding code vectors is sufficiently well-conditioned to permit decoding.

15. The method recited in claim 11 , further comprising transmitting at least one acknowledgement to the source node upon at least one of collecting a linearly coded packet and decoding the plurality of linearly coded packets.

16. The method recited in claim 11 , wherein decoding comprises decoding at least one of a set of coded packets, the set comprising block coded packets and sliding window coded packets.

17. A non-transitory computer-readable medium storing a computer program implementing the method of claim 11 .

Assignees

• Shattil Steve J
• Genghiscomm Holdings Llc

Inventors

• Shattil Steve J

Classifications

• H04B7/026

  Co-operative diversity, e.g. using fixed or mobile stations as relays · CPC title

• H04L2001/0097

  Relays · CPC title

• H04L1/0077

  Cooperative coding · CPC title

• H04L45/24

  Multipath · CPC title

• H04L27/2614

  Peak power aspects · CPC title