Patent ID: 9268836
Filing Date: 2016-02-23
CPC Classification: G06F,H04L

Claim Text:
1. A computer-implemented method comprising: determining, by a processing device, a distance value of a path between each datastore in a plurality of datastores; performing, by a processing device, 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, by a processing device, 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, by a processing device, 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, by a processing device, the data from the source datastore to one or more of the plurality of datastores in the descending order.