Lluis Pamies-Juarez
ABSTRACT
Peer-to-peer (P2P) storage is a promising technology to provide users with cheap and online persistence. However, due the instability of these infrastructures, P2P storage systems must introduce redundancy in order to guarantee a reliable storage service. Besides, they need data repair algorithms to maintain this redundancy in front of permanent node departures. To ensure that such repairs can always be run, existing P2P storage systems aim to maintain 100% data availability. Unfortunately, this solution seems to overkill in preventing data loses, introducing network and data overheads.
In this paper we propose a new data repair algorithm able to guarantee a high reliable storage service without 100% data availability. The main idea is to ensure that objects are kept stored instead of maintaining them available. We analytically prove that our approach reduces considerably the total amount of redundancy. Moreover, through simulation, we show how our approach significantly reduces the required number of repairs, decreasing both, the network and the storage overheads.
- B. G. Chun, F. Dabek, A. Haeberlen, E. Sit, H. Weatherspoon, M. F. Kaashoek, and J. Kubiatowicz. Efficient replica maintenance for distributed storage systems. machine availability estimation. In Symposium on Networked Systems Design and Implementation (NSDI), 2006. Google Scholar
Digital Library
- L. Cox and B. Noble. Pastiche: Making backup cheap and easy. In Proceedings of 5th USENIX Symposium on Operating Systems Design and Implementation (OSDI), 2002. Google ScholarDigital Library
- F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with cfs. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP), 2001. Google ScholarDigital Library
- Anwitaman Datta and Karl Aberer. Internet-scale storage systems under churn. a study of the steady-state using markov models. In Proceedings of the 6th International Conference on Peer-to-Peer Computing (P2P), 2006. Google ScholarDigital Library
- P. Druschela and A. Rowstron. Past: A large-scale, persistent peer-to-peer storage utility. In Proceedings of the 8th Workshop on Hot Topics in Operating Systems (HOTOS), 2001. Google ScholarDigital Library
- A. Duminuco, E. W. Biersack, and T. En-Najjary. Proactive replication in distributed storage systems using machine availability estimation. In Proceedings of the 3rd CoNEXT conference (CONEXT), 2007. Google ScholarDigital Library
- Ranjita Bhagwan Kiran, Kiran Tati, Yu-chung Cheng, Stefan Savage, and Geoffrey M. Voelker. Total recall: System support for automated availability management. In Symposium on Networked Systems Design and Implementation (NSDI), 2004. Google ScholarDigital Library
- M. Luby. Lt codes. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Google ScholarDigital Library
- M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, and V. Stemann. Practical loss-resilient codes. In Proceedings of the 29th Annual Aymposium on Theory of Computing (STOC), 1997. Google ScholarDigital Library
- P. Maymounkov. Online codes. Technical Report TR2002-833, New York University, 2002.Google Scholar
- Sean Rhea, Brighten Godfrey, Brad Karp, John Kubiatowicz, Sylvia Ratnasamy, Scott Shenker, Ion Stoica, and Harlan Yu. Opendht: a public dht service and its uses. SIGCOMM Comput. Commun. Rev., 35(4):73--84, 2005. Google ScholarDigital Library
- A. Shokrollahi. Raptor codes. IEEE/ACM Transactions on Networking (TON), 14, 2006. Google ScholarDigital Library
- E. Sit, A. Haeberlen, F. Dabek, B. Chun, H. Weatherspoon, R. Morris, M. F. Kaashoek, and J. Kubiatowicz. Proactive replication for data durability. In Proceedings of the 5th International Workshop on Peer-to-Peer Systems (IPTPS), 2006.Google Scholar
- G. Utard and A. Vernois. Data durability in peer to peer storage systems. In Proceedings of the 4th IEEE International Symposium on Cluster Computing and the Grid (CCGRID), 2004. Google ScholarDigital Library
- Z. Zhang and Q. Lian. Reperasure: replication protocol using erasure-code in peer-to-peer storage network. In Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS), 2002. Google ScholarDigital Library
Index Terms
- Maintaining data reliability without availability in P2P storage systems
Recommendations
A Novel Data Consistence Model Based on Virtual Peers in Peer-to-Peer Systems
In recent years, peer-to-peer (P2P) systems have become a promising paradigm to provide efficient storage service in distributed environments. Although its effectiveness has been proven in many areas, the data consistency problem in P2P systems are ...
Characterizing unstructured overlay topologies in modern P2P file-sharing systems
In recent years, peer-to-peer (P2P) file-sharing systems have evolved to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the unstructured overlay topologies formed by these peers. Little is ...
Maintaining Data Consistency in Structured P2P Systems
A fundamental challenge of supporting mutable data replication in a Peer-to-Peer (P2P) system is to efficiently maintain consistency. This paper presents a framework for Balanced Consistency Maintenance (BCoM) in structured P2P systems with ...
Comments