Access Balancing in Storage Systems by Labeling Partial Steiner Systems

by   Yeow Meng Chee, et al.

Storage architectures ranging from minimum bandwidth regenerating encoded distributed storage systems to declustered-parity RAIDs can be designed using dense partial Steiner systems in order to support fast reads, writes, and recovery of failed storage units. In order to ensure good performance, popularities of the data items should be taken into account and the frequencies of accesses to the storage units made as uniform as possible. A proposed combinatorial model ranks items by popularity and assigns data items to elements in a dense partial Steiner system so that the sums of ranks of the elements in each block are as equal as possible. By developing necessary conditions in terms of independent sets, we demonstrate that certain Steiner systems must have a much larger difference between the largest and smallest block sums than is dictated by an elementary lower bound. In contrast, we also show that certain dense partial S(t, t+1, v) designs can be labeled to realize the elementary lower bound. Furthermore, we prove that for every admissible order v, there is a Steiner triple system (S(2, 3, v)) whose largest difference in block sums is within an additive constant of the lower bound.


page 1

page 2

page 3

page 4


Optimal Radio Labellings of Block Graphs and Line Graphs of Trees

A radio labeling of a graph G is a mapping f : V(G) →{0, 1, 2,...} such ...

Distributed Multi-User Secret Sharing

A distributed secret sharing system is considered that consists of a dea...

Solving the unit-load pre-marshalling problem in block stacking storage systems with multiple access directions

Block stacking storage systems are highly adaptable warehouse systems wi...

An Exponential Lower Bound on the Sub-Packetization of MSR Codes

An (n,k,ℓ)-vector MDS code is a F-linear subspace of (F^ℓ)^n (for some f...

Theoretical Bounds for the Size of Elementary Trapping Sets by Graphic Methods

Elementary trapping sets (ETSs) are the main culprits for the performanc...

Balanced and Swap-Robust Trades for Dynamical Distributed Storage

Trades, introduced by Hedayat, are two sets of blocks of elements which ...

Please sign up or login with your details

Forgot password? Click here to reset