RFH: A resilient, fault-tolerant and high-efficient replication algorithm for distributed cloud storage

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2012, Pages 520-529

  Qu, Yanzhen ^a   Xiong, Naixue ^a  

^a Colorado Technical University ^*  (United States)

Author keywords

Data replication; Distributed Cloud storage; Fault tolerance; High efficient

Indexed keywords

DATA PARTITION; DATA REPLICATION; EXTENSIVE SIMULATIONS; FAULT-TOLERANT; FIXED NUMBERS; FLASH CROWD; HIGH AVAILABILITY; HIGH-EFFICIENT; LOAD BALANCE; LOW COSTS; PATH LENGTH; PHYSICAL NODES; QUERY EFFICIENCY; RANDOM ALGORITHMS; REPLICATION ALGORITHM; STORAGE SYSTEMS; TRAFFIC LOADS; UTILIZATION RATES; VIRTUAL NODE; WEB APPLICATION;

ALGORITHMS; BLOCKING PROBABILITY; FAULT TOLERANCE;

DIGITAL STORAGE;

EID: 84871112175     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2012.3     Document Type: Conference Paper

References (25)

1. P. Gill, N. Jain, N. Nagappan. Understanding Network Failures in Data Centers: Measurement, Analysis, and Implications. In ACM SIGCOMM'11, Canada, 2011.
2. K. Chen, C. Guo, H. Wu, J. Yuan, Z. Feng, Y. Chen, S. Lu, W. Wu. DAC: Generic and Automatic Address Configuration for Data Center Networks. IEEE/ACM Transactions on Networking, vol.19, no.6, pp.1, 2011.
3. C. Guo, Guohan Lu, D. Li, H. Wu, X. Zhang, Y. Shi. BCube: A High Performance, Server-centric Network Architecture for Modular Data Centers. In ACM SIGCOMM'09, Spain, Aug. 2009.
4. G. Decandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: amazons highly available key-value store. In Proceeding of ACM Symposium on Operating Systems Principles (SOSP), New York,USA, 2007.
5. N. Bonvin, Thanasis G. Papaioannou and K. Aberer. A Self-Organized, Fault-Tolerant and Scalable Replication Scheme for Cloud Storage. In ACM SoCC'10, Indianapolis, USA, 2010.
6. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proc. of ACM Symposium on Theory of Computing, pp.654-663, May 1997.
7. 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 global-scale persistent storage. SIGPLAN Not., vol.35, no.11, pp.190-201, 2000.
8. Q. Wei, B. Veeravalli, B. Gong, L. Zeng, D. Feng. CDRM: A Cost-effective Dynamic Replication Management Scheme for Cloud Storage Cluster. In IEEE International Conference on Cluster Computing, Heraklion, Greece, 2010.
9. S. Kandula, S. Sengupta, A. Greenberg, P. Patel, R. Chaiken. The Nature of Datacenter Traffic: Measurements & Analysis. In USENIX Internet Measurement Conference (IMC), Chicago, USA, 2009.
10. D. Feng, L. Qin. Adaptive Object Placement in Object-Based Storage Systems with Minimal Blocking Probability. In Proceeding of the 20th international conference on Advanced Information Networking and Applications (AINA), 2006.
11. A. Rowstron and P. Druschel. Storage Management and Caching in PAST, a Large-Scale, Persistent Peer-to-Peer Storage Utility. In Proceeding Symp. Operating Systems Principles (SOSP), 2001.
12. F. Dabek et al.. Wide Area Cooperative Storage with CFS. In Proceeding Symp. Operating Systems Principles (SOSP), 2001.
13. M. Theimer and M. Jones. Overlook: Scalable Name Service on an Overlay Network. In Proceeding Intl Conference Distributed Computing Systems (ICDCS), 2002.
14. I. Stoica et al.. Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications. IEEE/ACM Trans. Networking, 1(1):17-32, Feb. 2003.
15. Tapestry, http://tapestry.apache.org, 2011.
16. Gnutella, http://www.gnutella.com, 2008.
17. H. Shen. An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems. IEEE Trans. On Parallel and Distributed System, vol.21, no.6, pp.827-840, June 2010.
18. K. Daudjee and K. Salem. Lazy database replication with snapshot isolation. In Proceeding of the 32nd International Conference on Very large data bases (VLDB), pp.715-726, Seoul, Korea, 2006.
19. R. G. Guy, J. S. Heidemann, and J. T. W. Page. The ficus replicated file system. ACM SIGOPS Operating Systems Review, vol.26, no.2, 1992.
20. M. Satyanarayanan, J. J. Kistler, P. Kumar, M. E. Okasaki, E. H. Siegel, and D. C. Steere. Coda: a highly available file system for a distributed workstation environment. IEEE Transactions on Computers, vol.39, no.4, pp.447-459, 1990.
21. S. Ghemawat, H. Gobioff, and S. Leung. The Google file system. In Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles (SOSP), New York, USA, Oct. 2003.
22. D. Borthakur. HDFS Architecture. http://cdh3u0.cloudera.com/cdh/3/hadoop- 0.20.2+320/hdfs-design.pdf, April 2009.
23. E. Pinheiro, W.-D. Weber, and L. A. Barroso. Failure trends in a large disk drive population. In Proceeding of 5th USENIX Conference on File and Storage Technologies, San Jose, USA, Feb. 2007.
24. D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine, and D. Lewin. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual ACM Symposium on theory of Computing (STOC), New York, USA, 1997.
25. N. Xiong, A. V. Vasilakos, L. T. Yang, L. Song, Y. Pan, R. Kannan, Y. Li. Comparative Analysis of Quality of Service and Memory Usage for Adaptive Failure Detectors in Healthcare Systems. IEEE JSAC, 27(4): 495-509, May 2009.