Well-Balanced Designs for Data Placement
From MaRDI portal
Publication:2808799
DOI10.1002/jcd.21506zbMath1336.05018OpenAlexW2140709916MaRDI QIDQ2808799
Jean-Claude Bermond, Alain Jean-Marie, Dorian Mazauric, Joseph Yu
Publication date: 24 May 2016
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21506
Combinatorial aspects of block designs (05B05) Graph theory (including graph drawing) in computer science (68R10) Triple systems (05B07) Data structures (68P05)
Related Items (6)
Optimal data placements for triple replication in distributed storage systems ⋮ Egalitarian Steiner triple systems for data popularity ⋮ The existence of 2-balanced Mendelsohn triple systems ⋮ Well-Balanced Designs for Data Placement ⋮ The Existence of Well-Balanced Triple Systems ⋮ Further study on optimal data placements for triple replication
Cites Work
- Group divisible designs with two associate classes, and quadratic leaves of triple systems
- On large sets of disjoint Steiner triple systems. IV
- On large sets of disjoint Steiner triple systems. III
- Quadratic leaves of maximal partial triple systems
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- New results on large sets of Kirkman triple systems
- A new existence proof for large sets of disjoint Steiner triple systems
- Well-Balanced Designs for Data Placement
- The Existence of Well-Balanced Triple Systems
- Neighborhoods in Maximum Packings of 2Knand Quadratic Leaves of Triple Systems
- On Quadruple Systems
- Towards a Large Set of Steiner Quadruple Systems
- Unnamed Item
- Unnamed Item
This page was built for publication: Well-Balanced Designs for Data Placement