Daisy chain distribution in data centers
AssigneePaypal, Inc.
InventorsAswani Kumar Raveendran Nair, Sergiy Pereshyvaylo, Bin Yu, Sudheendra Vasudeva Murthy
Life of this patent
Estimating the term…
Abstract
A method and a system to provide daisy chain distribution in data centers are provided. A node identification module identifies three or more data nodes of a plurality of data nodes. The identification of three or more data nodes indicates that the respective data nodes are to receive a copy of a data file. A connection creation module to, using one or more processors, create communication connections between the three or more data nodes. The communication connections form a daisy chain beginning at a seeder data node of the three or more data nodes and ending at a terminal data node of the three or more data nodes.
Claims20
A system comprising
- one or more processors;
- and
- one or more non-transitory computer-readable media containing instructions that are executable by the one or more processors to cause the system to perform operations comprising:
- communicating blocks of data via a sequence of data nodes that includes three or more data nodes ending at a terminal node of the sequence;
- during the communication of the blocks of data, forming a leapfrog communication connection between a previous node of the sequence that is previous to a skipped node of the sequence and a particular data node of the sequence that is after the skipped node in the sequence in which the leapfrog communication connection bypasses the skipped node, the skipped node receiving the communication of the blocks of data prior to the formation of the leapfrog communication connection;
- and
- after formation of the leapfrog communication connection, continuing the communication of the blocks of data from the previous node to the particular data node via the leapfrog communication connection.
A method, comprising:
- communicating blocks of data across a sequence of data nodes that includes three or more data nodes ending at a terminal node of the sequence;
- during the communication of the blocks of data, forming a leapfrog communication connection between a previous node of the sequence that is previous to a skipped node of the sequence and a particular data node of the sequence that is after the skipped node in the sequence in which the leapfrog communication connection bypasses the skipped node, the skipped node receiving the communication of the blocks of data prior to the formation of the leapfrog communication connection;
- and
- after formation of the leapfrog communication connection, continuing the communication of the blocks of data from the previous node to the particular node via the leapfrog communication connection.
A data node comprising
- a processor;
- and
- a non-transitory computer-readable media containing instructions that are executable by the processor to cause the data node to perform operations, the operations comprising:
- sequentially receiving blocks of data from a previous node in a sequence of data nodes of which the data node is a part;
- communicating the received blocks of data to a next node in the sequence of data nodes;
- during the receipt of the sequential blocks of data, forming a leapfrog communication connection to a particular data node of the sequence of data nodes that is immediately following the next node in the sequence in which the leapfrog communication connection bypasses the next node;
- and
- after formation of the leapfrog communication connection, continuing the communication of the blocks of data to the particular node in the sequence via the leapfrog communication connection.
Dependencies are inferred from the claim text.