sign in
english version rss feed

inria-00618656, version 2

Well Balanced Designs for Data Placement

Jean-Claude Bermond () 1, Alain Jean-Marie () 23, Dorian Mazauric () 12, Joseph Yu () 1

N° RR-7725 (2011)

Abstract: 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.

 
  • inria-00618656, version 2
  • oai:hal.inria.fr:inria-00618656
  • From: 
  • Submitted on: Monday, 5 September 2011 13:18:51
  • Updated on: Monday, 5 September 2011 13:35:48
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...