Implementation of repair tree algorithm for fast repair in distributed storage system

Abstract

Data is an important asset that needs to be safeguarded. Loss of data leads to direct financial losses. Storing data has evolved to meet the increasing needs of companies and individuals. The traditional storage approach, a specialized storage box no longer works for technical and economical reasons. Need is not for faster drives or networks but need is for a new approach for satisfying current demands for storing data. “Storing data on many standard servers but behave as one storage system although data is distributed between these servers.” This Distributed Storage System (DSS) is an advanced form of the “Storage” concept. Data security is a major issue for businesses and organizations today. Ensuring that your data is secure is becoming more important every day and vital to business operations. Protection of sensitive data is end goal of many IT security measures. The agenda is to ensure the avoidance of theft and protect privacy. Hence it comes to everyone’s advantage to ensure sensitive data protection. Measures are taken to keep data secure. Measures are like having regular backups of documents, protecting against attacks, using authentications for accessing data and so on. This paper speaks about data storage over distributed system ensuring data security with Erasure codes, a new technology ensuring data security. Here Erasure codes are a part of Repair tree algorithm. Repair tree algorithm helps to get the data of interest over distributed storage system.