Reperasure: Replication protocol using erasure-code in peer-to-peer storage network

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2002, Pages 330-335

  Zhang, Zheng ^b   Lian, Qiao ^a  

^a TSINGHUA UNIVERSITY   (China)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER SYSTEMS; DATA STORAGE EQUIPMENT; INTERNET; OPTIMIZATION;

PEER-TO-PEER STORGE NETWORK;

NETWORK PROTOCOLS;

EID: 0036446135     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Clarke, I., et al. Freenet: A distributed anonymous information storage and retrieval system, in Workshop on Design Issues in Anonymity and Unobservability. 2000. Berkeley, CA, USA.
2. Dabek, F., et al. Wide-area cooperative storage with CFS. in Symposium on Operating Systems Principles (SOSP). 2001. Banff, Canada.
3. Druschel, P. and A. Rowstron. PAST: a large-scale, persistent peer-to-peer storage utility, in HotOS-VIII Workshop. 2001. Schloss Elmau, Germany.
4. E.G. Kotsakis and B.H. Pardoe Dynamic Quorum Adjustment: A Consistency Scheme for Replicated Objects Proceedings of the Third Communication Networks Symposium, July 1996.
5. Hakim Weatherspoon and John Kubiatowicz, Erasure Coding vs. Replication: A Quantitative Comparison Proceedings of IPTPS 2002, March 2002.
6. Hakim Weatherspoon, Matthew Delco, Shelley Zhuang, Typhoon: An Archival System for Tolerating High Degrees of File Server Failure, available through http://www.cs.berkeley.edu/~hweather/Typhoon/TyphoonReport.html, 1999.
7. J. Gray, P.Helland, P.E. O'Neil, D. Shasha, The Dangers of Replication and a Solution SIGMOD Conf. 1996: pp.173-182.
8. J. Plank, "A Tutorial on Reed-Solomon Coding for Fault-Tolerance in RAID-like Systems", available through http://cs.utk.edu/~plank/, February 1999.
9. Karin Petersen, et al. Flexible Update Propagation for Weakly Consistent Replication, Proceedings of SOSP 16, 1997.
10. Kubiatowicz, J., et al. OceanStore: An Architecture for Global-Scale Persistent Storage. in ASPLOS 2000. 2000. MA, USA: ACM.
11. th Symp. on Theory of Computing, pp. 150-159, 1997.
12. Qin Lv and Sylvia Ratnasamy, Can Heterogeneity Make Gnutella Scalable? Proceedings of IPTPS 2002.
13. Ratnasamy, S., et al. A Scalable Content-Addressable Network. in ACM SIGCOMM. 2001. San Diego, CA, USA.
14. Rowstron, A. and P. Druschel. Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems, in IFIP/ACM Middleware. 2001. Heidelberg, Germany.
15. Stoica, I., et al. Chord: A scalable peer-to-peer lookup service for Internet applications, in ACM SIGCOMM. 2001. San Diego, CA, USA.
16. Xu, Zhichen and Zhang, Zheng, Building Low-maintenance Expressways for P2P Systems, available through http://www.hpl.hp.com/techreports/2002/HPL-2002-41.html, March 2002.
17. Zhao, B.Y,. Kubiatowicz, J.D., and Josep, A.D. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, UC Berkeley, EECS, 2001.