https://hal.inria.fr/hal-00684697Feuillet, MathieuMathieuFeuilletRAP - Networks, Algorithms and Probabilities - Inria Paris-Rocquencourt - Inria - Institut National de Recherche en Informatique et en AutomatiqueRobert, PhilippePhilippeRobertRAP - Networks, Algorithms and Probabilities - Inria Paris-Rocquencourt - Inria - Institut National de Recherche en Informatique et en AutomatiqueA Scaling Analysis of a Transient Stochastic NetworkHAL CCSD2014[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Robert, Philippe2012-04-02 18:35:472022-01-21 03:15:112012-04-02 18:35:47enJournal articles10.1239/aap/14013697051In this paper, a simple transient Markov process with an absorbing point is used to investigate the qualitative behavior of a large scale storage network of non reliable file servers where files can be duplicated. When the size of the system goes to infinity it is shown that there is a critical value for the maximum number of files per server such that below this quantity, the system stays away from the absorbing state, all files lost, in a quasi-stationary state where most files have a maximum number of copies. Above this value, the network looses a significant number of files until some equilibrium is reached. When the network is stable, it is shown that, with convenient time scales, the evolution of the network towards the absorbing state can be described via a stochastic averaging principle.