Cooperative subspace multiplexing in content delivery networks
First Claim
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.
3 Assignments
0 Petitions
Accused Products
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.
-
Citations
20 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. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
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. - View Dependent Claims (8, 9, 10, 11, 12, 13)
-
-
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. - View Dependent Claims (15, 16, 17, 18, 19, 20)
-
Specification