inria-00618656, version 2
Well Balanced Designs for Data Placement
Jean-Claude Bermond
1Alain Jean-Marie 2, 3Dorian Mazauric 1, 2Joseph Yu 1
N° RR-7725 (2011)
Résumé : The problem we consider in this article is motivated by data placement in particular data replication in video on demand systems. We are given a set V of n servers and b files (data, documents). Each file is replicated on exactly k servers. The problem is to determine the placement that minimizes the variance of the number of unavailable datas. To do that, we consider the problem of determining well balanced designs, a difficult problem because it contains the problem of the existence of Steiner systems.
- 1 : MASCOTTE (INRIA Sophia Antipolis / Laboratoire I3S)
- INRIA – Université Nice Sophia Antipolis [UNS] – CNRS : UMR7271
- 2 : MAESTRO (INRIA Sophia Antipolis)
- INRIA – Université Montpellier II - Sciences et techniques
- 3 : Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM)
- CNRS : UMR5506 – Université Montpellier II - Sciences et techniques
- Domaine : Informatique/Algorithme et structure de données
- Référence interne : RR-7725
- Versions disponibles : v1 (02-09-2011) v2 (05-09-2011)
- inria-00618656, version 2
- http://hal.inria.fr/inria-00618656
- oai:hal.inria.fr:inria-00618656
- Contributeur : Dorian Mazauric
- Soumis le : Lundi 5 Septembre 2011, 13:18:51
- Dernière modification le : Lundi 5 Septembre 2011, 13:35:48
Documents associés
Exporter