Cooperative Subspace Multiplexing in Content Delivery Networks

• US 20140146916A1
• Filed: 01/30/2014
• Published: 05/29/2014
• Est. Priority Date: 05/14/2002
• Status: Active Grant

• Current Assignee: Genghiscomm Holdings, LLC
• Original Assignee: Genghiscomm Holdings, LLC
• Inventors: Shattil, Steve J
• Granted Patent: US 8,942,082 B2
• Time in Patent Office: Days
• US Class Current: 375/295
• CPC Class Codes: H04B 7/026 Co-operative diversity, e.g. using fixed or mobile stations as relays
• CPC Class Codes: H04J 13/0003 Code application, i.e. aspects relating to how codes are applied to form multiplexed channels
• CPC Class Codes: H04J 13/004 Orthogonal
• CPC Class Codes: H04J 13/12 Generation of orthogonal codes
• CPC Class Codes: H04L 1/0077 Cooperative coding
• CPC Class Codes: H04L 1/0681 adapting space time parameters, i.e. modifying the space time matrix
• CPC Class Codes: H04L 2001/0097 Relays
• CPC Class Codes: H04L 27/2601 Multicarrier modulation systems
• CPC Class Codes: H04L 27/2602 Signal structure
• CPC Class Codes: H04L 27/2614 Peak power aspects
• CPC Class Codes: H04L 45/24 Multipath
• CPC Class Codes: H04L 5/0021 in which codes are applied as a frequency-domain sequences, e.g. MC-CDMA
• CPC Class Codes: H04W 72/046 the resource being in the space domain, e.g. beams

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 coded components. The destination node builds up the dimension of the subspace spanned by code vectors it collects from the receiving nodes so it can decode the coded components.

Claims

1. A processing method for transporting data in a content delivery network, comprising:

selecting a plurality of original data components to transfer to at least one destination node;

selecting a plurality of transmitting nodes to cooperatively encode the original data components;

generating a plurality of subspace coded components and a corresponding code matrix; and

providing for transmitting from each of the transmitting nodes 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.

2. The processing method recited in claim 1, wherein selecting the plurality of transmitting nodes is based on a combination of network data collected from at least one client-side metrics manager and network data collected from at least one network-node metrics manager.

3. The processing method recited in claim 1, wherein generating comprises ensuring the corresponding code matrix is sufficiently well-conditioned to permit the at least one destination node to decode the coded components.

4. The processing method recited in claim 1, wherein transmitting comprises transmitting coded components until an acknowledgement from the at least one destination node is received.

5. The processing method recited in claim 1, wherein the corresponding code matrix comprises at least one of a matrix of randomly generated coefficients, a matrix of coefficients generated from measurements of a random process, a matrix of coefficients generated deterministically, and a CI code matrix.

6. The processing method recited in claim 1, wherein generating comprises employing at least one of block coding and sliding window coding.

7. A method for transmitting a file between a server and a client in a content delivery network, comprising:

generating a plurality of linearly coded packets from a plurality of original packets;

selecting a plurality of transmitting nodes to perform cooperative subspace processing; and

coordinating the plurality of transmitting nodes to increase a dimension of a subspace spanned by the linearly coded packets to provide the client with a sufficient number of linearly independent coded packets from which to retrieve the plurality of original packets.

8. The method recited in claim 7, wherein selecting the plurality of transmitting nodes is based on a combination of network data collected from at least one client-side metrics manager and network data collected from at least one network-node metrics manager.

9. The method recited in claim 7, wherein at least one of generating, selecting, and coordinating comprises ensuring that a coding matrix corresponding to the plurality of linearly coded packets is sufficiently well-conditioned to permit the client to retrieve the plurality of original packets.

10. The method recited in claim 7, wherein at least one of generating, selecting, and coordinating is responsive to feedback from the client for increasing the dimension of the subspace spanned by the linearly coded packets.

11. The method recited in claim 7, wherein generating comprises employing at least one of block coding and sliding window coding.

12. The processing method recited in claim 7, wherein generating employs a code matrix comprising at least one of a matrix of randomly generated coefficients, a matrix of coefficients generated from measurements of a random process, a matrix of coefficients generated deterministically, and a CI code matrix.

13. The processing method recited in claim 7, wherein at least one of the transmitting nodes is configured for generating at least some of the plurality of linearly coded packets from received coded packets.

14. A method for transmitting data in a content delivery network, comprising:

encoding a plurality of original packets for generating a plurality of linearly coded packets and corresponding code vectors for transfer to a destination node;

selecting a first network channel and at least a second network channel to simultaneously employ in the transfer; and

distributing a first subset of the plurality of linearly coded packets and corresponding code vectors to the first network channel and distributing a second subset of the plurality of linearly coded packets and corresponding code vectors to 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.

15. The method recited in claim 14, wherein at least one of selecting and distributing is based on a combination of network data collected from at least one client-side metrics manager and data collected from at least one network-node metrics manager.

16. The method recited in claim 14, 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.

17. The method recited in claim 14, further comprising monitoring at least one real-time property of the first network channel and the at least second network channel;

and wherein at least one of encoding and distributing is adjusted based on the monitoring to provide network load balancing.

18. The method recited in claim 14, wherein encoding comprises employing at least one of block coding and sliding window coding.

19. The method recited in claim 14, wherein at least one of encoding, selecting, and distributing is responsive to feedback from the destination node.

20. The method recited in claim 14, wherein encoding employs a code matrix comprising at least one of a matrix of randomly generated coefficients, a matrix of coefficients generated from measurements of a random process, a matrix of coefficients generated deterministically, and a CI code matrix.