A system, comprising: a first storage system; a second storage system in communication with the first storage system, wherein the first storage system and the second storage system are key/value based object storage devices; and wherein the first storage system and the second storage system store and serve objects; wherein the first storage system is a consistent hashing ring used as a clustered storage system and the second storage system is a Dispersed Storage System; a probabilistic algorithm engine to predict access patterns, the probabilistic algorithm engine integrated with the first storage system; wherein the probabilistic algorithm engine manages object storage on the first storage system and the second storage system; wherein the probabilistic algorithm engine is configured to: constitute a window of chunks, a chunk being a metadata object that composes a 3-tuple including tag, datum and metadata, compute an eviction threshold corresponding to the ratio of data to evict out of total data in terms of size, sort chunks composing the window by their fair-values, compute a discriminant fair-value from a window of chunks and a fair-value of a chunk, wherein the fair-value is a value calculated from chunk variates and is determined by the probabilistic algorithm engine by using an empirical cumulative distribution function which provides a cumulative size of chunks that satisfy a comparison of a chunk against the fair value, and where the discriminant fair-value corresponds to a thresholding index into the empirical cumulative distribution function and is computed for use to differentiate the chunks; and wherein the fair-value of the chunk is compared to the discriminant fair-value to determine a transfer state of the chunk, wherein if the fair-value of the object is less than the discriminant fair-value, the object is archived onto the second storage system, and if the fair-value of the object is greater than or equal to the discriminant fair-value, the transfer state of the object is unchanged (1808, 1809). a first storage system; a second storage system in communication with the first storage system, wherein the first storage system and the second storage system are key/value based object storage devices; and wherein the first storage system and the second storage system store and serve objects; wherein the first storage system is a consistent hashing ring used as a clustered storage system and the second storage system is a Dispersed Storage System; a probabilistic algorithm engine to predict access patterns, the probabilistic algorithm engine integrated with the first storage system; wherein the probabilistic algorithm engine manages object storage on the first storage system and the second storage system; wherein the probabilistic algorithm engine is configured to: constitute a window of chunks, a chunk being a metadata object that composes a 3-tuple including tag, datum and metadata, compute an eviction threshold corresponding to the ratio of data to evict out of total data in terms of size, sort chunks composing the window by their fair-values, compute a discriminant fair-value from a window of chunks and a fair-value of a chunk, wherein the fair-value is a value calculated from chunk variates and is determined by the probabilistic algorithm engine by using an empirical cumulative distribution function which provides a cumulative size of chunks that satisfy a comparison of a chunk against the fair value, and where the discriminant fair-value corresponds to a thresholding index into the empirical cumulative distribution function and is computed for use to differentiate the chunks; and constitute a window of chunks, a chunk being a metadata object that composes a 3-tuple including tag, datum and metadata, compute an eviction threshold corresponding to the ratio of data to evict out of total data in terms of size, sort chunks composing the window by their fair-values, compute a discriminant fair-value from a window of chunks and a fair-value of a chunk, wherein the fair-value is a value calculated from chunk variates and is determined by the probabilistic algorithm engine by using an empirical cumulative distribution function which provides a cumulative size of chunks that satisfy a comparison of a chunk against the fair value, and where the discriminant fair-value corresponds to a thresholding index into the empirical cumulative distribution function and is computed for use to differentiate the chunks; and wherein the fair-value of the chunk is compared to the discriminant fair-value to determine a transfer state of the chunk, wherein if the fair-value of the object is less than the discriminant fair-value, the object is archived onto the second storage system, and if the fair-value of the object is greater than or equal to the discriminant fair-value, the transfer state of the object is unchanged (1808, 1809). if the fair-value of the object is less than the discriminant fair-value, the object is archived onto the second storage system, and if the fair-value of the object is greater than or equal to the discriminant fair-value, the transfer state of the object is unchanged (1808, 1809).