Kirkman Systems that Attain the Upper Bound on the Minimum Block Sum, for Access Balancing in Distributed Storage

TL;DR

This paper demonstrates that infinitely many Kirkman systems can achieve optimal data distribution in distributed storage by maximizing the minimum block sum, ensuring balanced access across servers.

Contribution

It proves the existence of infinitely many Kirkman systems with optimal minimum block sums and extends the results to quadruple systems for better data balancing.

Findings

Infinitely many Kirkman triple systems attain the upper bound on minimum block sum.

Kirkman systems can be extended to quadruple systems with similar properties.

Application of Kirkman systems improves data distribution balance in distributed storage.

Abstract

We study a class of combinatorial designs called Kirkman systems, and we show that infinitely many Kirkman systems are well-distributed in a precise sense. Steiner triple systems of order $n$ can achieve a minimum block sum of $n$. Kirkman triple systems form parallel classes from the blocks of Steiner triple systems. We prove that there are an infinite number of Kirkman triple systems that have a minimum block sum of $n$. We expand this to quadruple systems. These concepts can then be applied to distributed storage to spread data across the servers, and servers across locations, using Kirkman triple systems, while having data well distributed by popularity, measured by the minimum block sum.