Distributed Data Replenishment
- 5 April 2012
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 24 (2) , 275-287
Abstract
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.Keywords
This publication has 20 references indexed in Scilit:
- A Survey on Network Codes for Distributed StorageProceedings of the IEEE, 2011
- Tree-structured Data Regeneration in Distributed Storage Systems with Regenerating Codes2010
- Existence and Construction of Capacity-Achieving Network Codes for Distributed StorageIEEE Journal on Selected Areas in Communications, 2010
- Reducing repair traffic for erasure coding-based storage via interference alignment2009
- A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems2009
- A Random Linear Network Coding Approach to MulticastIEEE Transactions on Information Theory, 2006
- Flexible information discovery in decentralized distributed systems2004
- A scalable content-addressable networkACM SIGCOMM Computer Communication Review, 2001
- ChordACM SIGCOMM Computer Communication Review, 2001
- Network information flowIEEE Transactions on Information Theory, 2000