INTELLIGENT DATA PROPAGATION IN A HIGHLY DISTRIBUTED ENVIRONMENT
First Claim
1. A computer-implemented method comprising:
- determining a distance value of a path between each datastore in a plurality of datastores;
performing a graph cluster analysis using the distance values to create a plurality of clusters, wherein each cluster includes one or more of the datastores within close proximity to one another based upon the distance values;
determining a shortest path tree to copy data from a source datastore at a root of the shortest path tree to a remainder of the plurality of datastores, wherein each datastore is represented as a vertex in the shortest path tree;
ordering each child vertex of the root in descending order according to a number of unique clusters to which descendants of the child vertex belong; and
copying the data from the source datastore to one or more of the plurality of datastores in the descending order.
2 Assignments
0 Petitions
Accused Products
Abstract
Exemplary methods, apparatuses, and systems that can intelligently copy data to a plurality of datastores are described. In one embodiment, a distance value of a path between each datastore is determined. Based on the distance values, a graph cluster analysis creates clusters of the datastores within close proximity to one another. Also, a shortest path tree determines the most efficient paths available for copying data from a source datastore to one or more destination datastores. The source datastore is designated as the root of the shortest path tree, and the one or more destination datastores are designated as the vertices of the tree. After each child vertex of the source datastore is ordered in descending order according to a number of unique clusters to which descendants of the child vertex belong, the data is copied from the source datastore to the one or more destination datastores in the descending order.
53 Citations
20 Claims
-
1. A computer-implemented method comprising:
-
determining a distance value of a path between each datastore in a plurality of datastores; performing a graph cluster analysis using the distance values to create a plurality of clusters, wherein each cluster includes one or more of the datastores within close proximity to one another based upon the distance values; determining a shortest path tree to copy data from a source datastore at a root of the shortest path tree to a remainder of the plurality of datastores, wherein each datastore is represented as a vertex in the shortest path tree; ordering each child vertex of the root in descending order according to a number of unique clusters to which descendants of the child vertex belong; and copying the data from the source datastore to one or more of the plurality of datastores in the descending order. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A non-transitory computer-readable medium storing instructions, which when executed by a processing device, cause the processing device to perform a method comprising:
-
determining a distance value of a path between each datastore in a plurality of datastores; performing a graph cluster analysis using the distance values to create a plurality of clusters, wherein each cluster includes one or more of the datastores within close proximity to one another based upon the distance values; determining a shortest path tree to copy data from a source datastore at a root of the shortest path tree to a remainder of the plurality of datastores, wherein each datastore is represented as a vertex in the shortest path tree; ordering each child vertex of the root in descending order according to a number of unique clusters to which descendants of the child vertex belong; and copying the data from the source datastore to one or more of the plurality of datastores in the descending order. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. An apparatus comprising:
-
a processing device, wherein the processing device executes instructions that cause the apparatus to perform a method comprising; determining a distance value of a path between each datastore in a plurality of datastores; performing a graph cluster analysis using the distance values to create a plurality of clusters, wherein each cluster includes one or more of the datastores within close proximity to one another based upon the distance values; determining a shortest path tree to copy data from a source datastore at a root of the shortest path tree to a remainder of the plurality of datastores, wherein each datastore is represented as a vertex in the shortest path tree; ordering each child vertex of the root in descending order according to a number of unique clusters to which descendants of the child vertex belong; and copying the data from the source datastore to one or more of the plurality of datastores in the descending order. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification