Balanced and Swap-Robust Trades for Dynamical Distributed Storage

  title={Balanced and Swap-Robust Trades for Dynamical Distributed Storage},
  author={Chao Pan and Ryan Gabrys and Xujun Liu and Charles J. Colbourn and Olgica Milenkovic},
  journal={2022 IEEE International Symposium on Information Theory (ISIT)},
Trades, introduced by Hedayat [9], are two sets of blocks of elements which may be exchanged (traded) without altering the counts of certain subcollections of elements within their constituent blocks. They are of importance in applications where certain combinations of elements dynamically become prohibited from being placed in the same group of elements, since in this case one can trade the offending blocks with allowed ones. This is particularly the case in distributed storage systems, where… 

Figures from this paper



MaxMinSum Steiner Systems for Access-Balancing in Distributed Storage

It is shown that proper relabelings of points in the Bose and Skolem constructions for Steiner triple systems lead to optimal MaxMin values for the sums of interest; for the duals of the designs, the block labelings that are within a 3/4 multiplicative factor from the optimum.

On the Delay-Storage Trade-Off in Content Download from Coded Distributed Storage Systems

This work uses a novel fork-join queueing framework to model multiple users requesting the content simultaneously, and derive bounds on the expected download time, demonstrating the fundamental trade-off between the expected downloading time and the amount of storage space.

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

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

Network Coding for Distributed Storage Systems

This paper shows how to optimally generate MDS fragments directly from existing fragments in the system, and introduces a new scheme called regenerating codes which use slightly larger fragments than MDS but have lower overall bandwidth use.

Distributed Storage Allocations

This work examines the problem of allocating a given total storage budget in a distributed storage system for maximum reliability and indicates that the optimal allocations often have nonintuitive structure and are difficult to specify.

Fractional repetition codes for repair in distributed storage systems

  • S. RouayhebK. Ramchandran
  • Computer Science
    2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2010
We introduce a new class of exact Minimum-Bandwidth Regenerating (MBR) codes for distributed storage systems, characterized by a low-complexity uncoded repair process that can tolerate multiple node

Evaluating Load Balancing Performance in Distributed Storage With Redundancy

The load balance in a system of nodes in which each object is stored at different nodes improves multiplicatively with <inline-formula> <tex-math notation="LaTeX">$d$ </tex-Math></inline- formula> as long as the spacing between consecutive spacings is consecutive between the ordered statistics of uniform random variables.

Optimal Fractional Repetition Codes Based on Graphs and Designs

This paper considers bounds on the FR capacity, which is the maximum amount of data that can be stored using an FR code, and proposes a new family of codes for DSS, namely, FR batch codes, which have the properties of batch codes and FR codes simultaneously.

Egalitarian Steiner triple systems for data popularity

  • C. Colbourn
  • Materials Science
    Designs, Codes and Cryptography
  • 2021
For an ordering of the blocks of a design, the point sum of an element is the sum of the indices of blocks containing that element. Block labelling for popularity asks for the point sums to be as

Optimal combinatorial batch codes based on block designs

New constructions of optimal CBCs in both the uniform and general settings are presented, for values of the parameters where tight bounds have not been established previously.