This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Distributed Data Replenishment
Feb. 2013 (vol. 24 no. 2)
pp. 275-287
Kien Nguyen, Oregon State University, Corvallis
Thinh Nguyen, Oregon State University, Corvallis
Yevgeniy Kovchegov, Oregon State University, Corvallis
Viet Le, Oregon State University, Corvallis
We propose a distributed data replenishment mechanism for some distributed peer-to-peer-based storage systems that automates the process of maintaining a sufficient level of data redundancy to ensure the availability of data in presence of peer departures and failures. The dynamics of peers entering and leaving the network are modeled as a stochastic process. A novel analytical time-backward technique is proposed to bound the expected time for a piece of data to remain in P2P systems. Both theoretical and simulation results are in agreement, indicating that the data replenishment via random linear network coding (RLNC) outperforms other popular strategies. Specifically, we show that the expected time for a piece of data to remain in a P2P system, the longer the better, is exponential in the number of peers used to store the data for the RLNC-based strategy, while they are quadratic for other strategies.
Index Terms:
Peer to peer computing,Redundancy,Bandwidth,Maintenance engineering,Distributed databases,Games,Network coding,network coding,Stochastic process,absorption time,distributed storage
Citation:
Kien Nguyen, Thinh Nguyen, Yevgeniy Kovchegov, Viet Le, "Distributed Data Replenishment," IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 2, pp. 275-287, Feb. 2013, doi:10.1109/TPDS.2012.115
Usage of this product signifies your acceptance of the Terms of Use.