Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2109.14140

Optimal data placements for triple replication

Ruijing Liu·Junling Zhou
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a set $V$ of $v$ servers along with $b$ files (data), each file is replicated (placed) on exactly $k$ servers and thus a file can be represented by a set of $k$ servers. Then we produce a data placement consisting of $b$ subsets of $V$ called blocks, each of size $k$. 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 $b$ blocks (of size three) on a $v$-set was proved to exist by Wei et al. if $v$ and $b$ are not excluded by two conditions. This article concentrates on the parameters $v, b$ satisfying the two conditions and characterizes the combinatorial properties of the corresponding optimal data placements. Nearly well-balanced triple systems (NWBTSs) are defined to produce optimal data placements. Many constructions for NWBTSs are developed, mainly by constructing candelabra systems with various desirable partitions. The main result of this article is that there always exist optimal data placements for triple replication with $b$ blocks on a $v$-set possibly except when $v\equiv 4$ (mod 24) or $v=50,74$, and $\frac{λv(v-1)}{6}-\frac{v}{6} < b < \frac{λv(v-1)}{6}+\frac{v}{6}$ for an odd integer $λ$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruijing Liu, Junling Zhou. 2021-09-29. Optimal data placements for triple replication. https://arxiv.org/abs/2109.14140

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗