Further study on optimal data placements for triple replication
From MaRDI portal
Publication:2112312
DOI10.1007/s00373-022-02604-wOpenAlexW4313462255MaRDI QIDQ2112312
Publication date: 10 January 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02604-w
Graph theory (including graph drawing) in computer science (68R10) Applications of design theory to circuits and networks (94C30) Triple systems (05B07) Theory of data (68Pxx)
Cites Work
- Candelabra systems and designs
- Large sets of disjoint packings on \(6k+5\) points
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- A class of three-designs
- The fundamental construction for 3-designs
- On the 3BD-closed set \(B_3(\{4,5\})\)
- 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
- On the 3BD-closed setB3({4,5,6})
- A complete solution to existence of H designs
- On Some Tactical Configurations
- Optimal data placements for triple replication in distributed storage systems
This page was built for publication: Further study on optimal data placements for triple replication