An Efficient Regenerating Coding for Recovery Single and Concurrent Failures in Hadoop

Authors : T.Karthikeyan, N.Vanitha

Volume/Issue : Volume 2 - 2017, Issue 6 - June

Google Scholar :

Scribd :

Thomson Reuters ResearcherID :

Data availability is perilous in distributed storing systems, especially when node failures are prevalent in real life. A key requirement is to minimize the amount of data transferred among nodes when recovering the lost or unavailable data of failed nodes. The retrieval solutions for proposed system based on regenerating codes, which are shown to provide fault-tolerant storage and minimum recovery bandwidth. Existing optimal regenerating codes are designed for single node failures. The failures in distributed storing systems, which supplements existing optimal regenerating codes to support a general number of failures including single and concurrent failures. The distributed storage system achieves single and concurrent failures having minimum possible recovery bandwidth for most cases. The proposed system implements single and concurrent failures in distributed storage systems and evaluate our prototype atop a Hadoop HDFS cluster tested with up to 2 storage nodes. The experimental result shows the single and concurrent failures in distributed storage systems prototype conforms to our theoretical findings and achieves recovery bandwidth and stores the lost data.

Keywords : Single and Concurrent failures, Erasure coded System, Recovery bandwidth, Mapreduce .


Paper Submission Last Date
30 - November - 2022

Paper Review Notification
In 1-2 Days

Paper Publishing
In 2-3 Days

Video Explanation for Published paper

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.