Abstract
Peer-to-peer (P2P) networks have been shown to be a natural and efficient paradigm for modeling most internet applications. However, data persistence remains still a major challenge, particularly in highly dynamic and unstable P2P networks. Within the framework of collaborative engineering, we propose a probabilistic approach based on peers collaboration to guarantee persistence of critical data in a system. Markov chains are used to model applications and realistically capture the behavior of practical systems. The model is first analytically investigated, and then data persistence is measured using an erasure coding redundancy scheme. The mathematical analysis allows us to determine the extent of data persistence in several important cases, and to anticipate the robustness of the large scale dynamic distributed applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) a scalabe content addressable network. In: Proc of ACM SIGCOMM, 2001, pp 161–172.
Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for Internet applications. In: Proc of ACM SIGCOMM, 2001, pp 149–160.
Rowstron A, Druschel P (2001) Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer system. In: Proc of Middleware, 2001, pp 329– 350.
C. Batten, K. Barr, A. Saraf, and S. Trepetin. pStore: A secure peer-to-peer backup system. Technical Memo MITLCS-TM-632, Massachusetts Institute of Technology Laboratory for Computer Science, October 2002.
Landers, M., Zhang, H., and Tan, K. 2004. PeerStore: Better Performance by Relaxing in Peer-to-Peer Backup. In Proceedings of the Fourth international Conference on Peer-To-Peer Computing (P2p'04) - Volume 00 (August 25 - 27, 2004). P2P. IEEE Computer Society, Washington, DC, 72-79.
Cox, L. P., Murray, C. D., and Noble, B. D. 2002. Pastiche: making backup cheap and easy. SIGOPS Oper. Syst. Rev. 36, SI (Dec. 2002), 285-298.
Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime. Vincent Gramoli, Anne-Marie Kermarrec, Achour Mostéfaoui, Michel Raynal, Bruno Sericola. Proceedings of the On The Move International Workshop on Reliability in Decentralized Distributed systems (OTM'06), apr 2006. Springer LNCS 4278 p.1470- 1479.
BOLOSKY, W., DOUCEUR, J., ELY, D., AND THEIMER, M. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In Proc. of Sigmetrics (June 2000).
DRUSCHEL, P., AND ROWSTRON, A. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. of ACM SOSP (2001).
PATTERSON, D., GIBSON, G., AND KATZ, R. The case for raid: Redundant arrays of inexpensive disks, May 1988.
F. Dabek, J. Li, E. Sit, J. Robertson, F. Kaashoek, and R. Morris. Designing a DHT for low latency and high throughput. In Proc. NSDI ’04.
J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. Oceanstore: An architecture for globalscale persistent storage. In Proc. ASPLOS 2000.
Reed S, Solomon G (1960) Polynomial codes over certain finite fields. J SIAM 8:300–304.
Byers JW, Luby M, Mitzenmacher M, Rege A (1998) a digital fountain approach to reliable distribtuion of bulk data. In: Proc of SIGCOMM, 1998, pp 56–67.
R. Bhagwan, K. Tati, Y. Cheng, S. Savage, and G.Voelker. Total recall: System support for automated availability management. In Proceedings of NSDI, 2004.
H. Weatherspoon and J. Kubiatowicz. Erasure coding vs. replication: A quantitative comparison. In Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS 2002).
Rodrigo Rodrigues and Barbara Liskov. High availability in DHTs: Erasure coding vs. replication. In Proceedings of IPTPS, 2005.
Lin, W. K., Chiu, D. M., and Lee, Y. B. 2004. Erasure Code Replication Revisited. In Proceedings of the Fourth international Conference on Peer-To-Peer Computing (August 25 - 27, 2004). P2P. IEEE Computer Society, Washington, DC, 90-97.
Chen, G., Qiu, T., and Wu, F. 2008. Insight into redundancy schemes in DHTs. J. Supercomput. 43, 2 (Feb. 2008), 183-198.
LI, H. and Chen, G. 2007. Data Persistence in Structured P2P Networks with Redundancy Schemes. In Proceedings of the Sixth international Conference on Grid and Cooperative Computing (August 16 - 18, 2007). GCC. IEEE Computer Society, Washington, DC, 542-549.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer London
About this paper
Cite this paper
Tout, R., Ghodous, P., Ouksel, A., Tanasoiu, M. (2009). Data Persistence in P2P Backup Systems. In: Chou, SY., Trappey, A., Pokojski, J., Smith, S. (eds) Global Perspective for Competitive Enterprise, Economy and Ecology. Advanced Concurrent Engineering. Springer, London. https://doi.org/10.1007/978-1-84882-762-2_14
Download citation
DOI: https://doi.org/10.1007/978-1-84882-762-2_14
Publisher Name: Springer, London
Print ISBN: 978-1-84882-761-5
Online ISBN: 978-1-84882-762-2
eBook Packages: EngineeringEngineering (R0)