Optimal data placements for triple replication
Ruijing Liu, Junling Zhou

TL;DR
This paper investigates optimal data placements for triple replication across servers, characterizing when such placements exist and introducing nearly well-balanced triple systems to achieve minimal variance in data availability.
Contribution
It characterizes the existence of optimal data placements for triple replication under specific parameters and introduces nearly well-balanced triple systems for this purpose.
Findings
Optimal data placements exist for most parameters, with specific exceptions.
Nearly well-balanced triple systems are effective in producing optimal placements.
The paper provides new constructions for these systems using candelabra systems.
Abstract
Given a set of servers along with files (data), each file is replicated (placed) on exactly servers and thus a file can be represented by a set of servers. Then we produce a data placement consisting of subsets of called blocks, each of size . Each server has some probability to fail and we want to find a placement that minimizes the variance of the number of available files. It was conjectured that there always exists an optimal data placement (with variance better than any other placement for any value of the probability of failure). An optimal data placement for triple replication with blocks (of size three) on a -set was proved to exist by Wei et al. if and are not excluded by two conditions. This article concentrates on the parameters satisfying the two conditions and characterizes the combinatorial properties of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · DNA and Biological Computing · Genome Rearrangement Algorithms
