US 12,007,844 B2 · Network informed policy creation using dynamically sized windows

Abstract

Optimizing backups for a data protection system by determining a size of a dataset to be saved in each backup operation and an available bandwidth in each transfer window of transfer windows for data transfers between a source and destination. An order of the backup operations is defined based on first ordering the backups based on decreasing dataset size and second ordering the transfer windows in order of decreasing bandwidth, and matching the backups to the transfer windows in accordance with these orderings. A dynamic window sizing process determines an initial change between the minimum and maximum bandwidth utilization over a period of time and then iteratively split and consolidate the time blocks until optimal utilization over the time period is reached.

Claims20

Dependent claims

A computer-implemented process of determining an optimal window size for backing up data in a series of time windows of a backup operation, comprising:

dividing a backup window of the backup operation into a plurality of slices;
assigning a respective percentage of a minimum and maximum available bandwidth to each slice of the plurality of slices;
iteratively determining which slices that have more than a certain percent difference between the assigned minimum and maximum available bandwidth;
splitting the determined slices into sub-slices into 1-minute, and assigning the minimum and maximum available bandwidth to the sub-slices;
determining which immediately consecutive slices have, when combined, a bandwidth difference that is less than or equal to the certain percent difference to identify consecutive under-utilized slices;
and
consolidating the consecutive under-utilized slices together.

4 more elements

A system for determining an optimal window size for backing up data in a series of time windows of a backup operation, comprising:

a first component dividing a backup window of the backup operation into a plurality of slices, assigning a respective percentage of a minimum and maximum available bandwidth to each slice of the plurality of slices, and iteratively determining which slices that have more than a certain percent difference between the assigned minimum and maximum available bandwidth;
a second component splitting the determined slices into sub-slices into 1-minute, and assigning the minimum and maximum available bandwidth to the sub-slices, determining which immediately consecutive slices have, when combined, a bandwidth difference that is less than or equal to the certain percent difference to identify consecutive under-utilized slices, and consolidating the consecutive under-utilized slices together.

Dependencies are inferred from the claim text.

Network informed policy creation using dynamically sized windows

Life of this patent

Network informed policy creation using dynamically sized windows

Life of this patent

Abstract

Claims20