Abstract
In peer-to-peer storage systems, peers can freely join and leave the system at any time. Ensuring high data availability in such an environment is a challenging task. In this paper we analyze the costs of achieving data availability in fully decentralized peer-to-peer systems. We mainly address the problem of churn and what effect maintaining availability has on network bandwidth. We discuss two different redundancy techniques – replication and erasure coding – and consider their monitoring and repairing costs analytically. We calculate the bandwidth costs using basic costs equations and two different Markov reward models. One for centralized monitoring system and the other for distributed monitoring. We show a comparison of the numerical results accordingly. Depending on these results, we determine the best redundancy and maintenance strategy that corresponds to peer’s failure probability.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, M.F., Morris, R.: Designing a DHT for low latency and high throughput. In: NSDI, pp. 85–98 (2004)
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: OceanStore: An architecture for global-scale persistent storage. In: Proceeedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), Boston, MA, November 2000, pp. 190–201 (2000)
Bhagwan, R., Tati, K., chung Cheng, Y., Savage, S., Voelker, G.M.: Total recall: System support for automated availability management. In: Proc. of NSDI, pp. 337–350 (2004)
Batten, C., Barr, K., Saraf, A., Trepetin, S.: pStore: A secure peer-to-peer backup system. Technical Memo MIT-LCS-TM-632, Massachusetts Institute of Technology Laboratory for Computer Science (2002)
Chun, B., Dabek, F., Haeberlen, A., Sit, E., Weatherspoon, H., Kaashoek, M., Kubiatowicz, J., Morris, R.: Efficient replica maintenance for distributed storage systems (2006)
Tati, K., Voelker, G.: On object maintenance in peer-to-peer systems (2006)
Lin, W.K., Chiu, D.M., Lee, Y.B.: Erasure code replication revisited. In: Fourth International Conference on Peer-to-Peer Computing (P2P 2004), pp. 90–97 (2004)
Weatherspoon, H., Kubiatowicz, J.: Erasure Coding vs. Replication: A Quantitative Comparison. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 328. Springer, Heidelberg (2002)
Rodrigues, R., Liskov, B.: High availability in dhts: Erasure coding vs. replication. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 226–239. Springer, Heidelberg (2005)
Blake, C., Rodrigues, R.: High availability, scalable storage, dynamic peer networks: pick two. In: HOTOS 2003: Proceedings of the 9th conference on Hot Topics in Operating Systems, Berkeley, CA, USA, USENIX Association, pp. 1–1 (2003)
Ahlswede, R., Cai, N., Li, S.-y.R., Yeung, R.W., Member, S., Member, S.: Network information flow. IEEE Transactions on Information Theory 46, 1204–1216 (2000)
Ho, T., Mdard, M., Koetter, R., Karger, D.R., Member, A., Effros, M., Member, S., Member, S., Member, S., Shi, J., Leong, B.: A random linear network coding approach to multicast. IEEE Trans. Inform. Theory 52, 4413–4430 (2006)
Dimakis, R.G., Godfrey, P.B., Wainwright, M.J., Ramch, K.: Network coding for distributed storage systems. In: Proc. of IEEE INFOCOM (2007)
Acedański, S., Deb, S., Mdard, M., Koetter, R.: How good is random linear coding based distributed networked storage. In: NetCod (2005)
Gkantsidis, C., Rodriguez, P.: Network coding for large scale content distribution. In: INFOCOM 2005: Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 4, pp. 2235–2245 (2005)
Duminuco, A., Biersack, E.: Hierarchical codes: How to make erasure codes attractive for peer-to-peer storage systems. In: Eighth International Conference on Peer-to-Peer Computing, P2P 2008, pp. 89–98 (2008)
Wu, D., Tian, Y., Ng, K.W., Datta, A.: Stochastic analysis of the interplay between object maintenance and churn. Comput. Commun. 31(2), 220–239 (2008)
Alouf, S., Dandoush, A., Nain, P.: Performance Analysis of Peer-to-Peer Storage Systems. Research Report RR-6044, INRIA (2006)
Ramabhadran, S., Pasquale, J.: Analysis of long-running replicated systems. In: INFOCOM 2006: Proceedings of 25th IEEE International Conference on Computer Communications, pp. 1–9 (2006)
Datta, A., Aberer, K.: Internet-scale storage systems under churn – a study of the steady-state using markov models. In: P2P 2006: Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing, pp. 133–144. IEEE Computer Society, Los Alamitos (2006)
Lampka, K.: A symbolic approach to the state graph based analysis of high-level Markov Reward Models. PhD thesis, University Erlangen-Nuremberg (2007)
Kutzner, K., Fuhrmann, T.: The IGOR file system for efficient data distribution in the GRID. In: Proc. Cracow Grid Workshop CGW 2006 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Houri, Y., Jobmann, M., Fuhrmann, T. (2009). Self-organized Data Redundancy Management for Peer-to-Peer Storage Systems. In: Spyropoulos, T., Hummel, K.A. (eds) Self-Organizing Systems. IWSOS 2009. Lecture Notes in Computer Science, vol 5918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10865-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-10865-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10864-8
Online ISBN: 978-3-642-10865-5
eBook Packages: Computer ScienceComputer Science (R0)