CPC H04L 65/60 (2013.01) [H04L 67/06 (2013.01); H04L 67/2876 (2013.01); H04L 67/5651 (2022.05); H04L 67/5681 (2022.05)] | 10 Claims |
1. A system, comprising:
a parent data processing node;
a child data processing node;
computer program code configured to execute on the parent and child data processing nodes, the computer program code configured to:
as a stream traverses the parent data processing node, break the stream into chunks;
for a particular chunk of the stream, determine, at the parent data processing node and using a directed cyclic graph (DCG) associated with the parent data processing node, whether the child data processing node already has the particular chunk;
based on the determination, send, from the parent data processing node to the child processing node, one of: the chunk, a reference to the chunk, and a compact data structure representing a sequence of chunks as identified in the directed cyclic graph associated with the parent data processing node;
as the stream begins to be decoded at the child data processing node, and for at least one reference or compact data structure in the stream, determine whether the reference or the compact data structure, as the case may be, is associated with a chunk stored in the child data processing system using a directed cyclic graph (DCG) associated with the child data processing node;
when the reference or compact data structure is associated with a chunk stored, incorporate data associated with the chunk back into the stream; and
when the reference or compact data structure is associated with a chunk that is missing, perform an on-demand request to the parent data processing node to obtain data corresponding to the chunk or the compact data structure.
|