A coding scheme for distributed storage systems
The final year project is based on the research in networked storage systems. Such storage systems are used widely everywhere today since it makes data available at multiple places and reduces the storage overhead to a certain extent. Various codes have been proposed and implemented during different...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
2011
|
| 主題: | |
| 在線閱讀: | http://hdl.handle.net/10356/44211 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | The final year project is based on the research in networked storage systems. Such storage systems are used widely everywhere today since it makes data available at multiple places and reduces the storage overhead to a certain extent. Various codes have been proposed and implemented during different times for efficient network storage that can alleviate costs related to storage and computations.
In this report, these codes have been studied with respect to the different mechanisms they employ and the associated storage and computations costs that they incur. The report also discusses the underlying mathematics and looks into the Self-Repairing Homomorphic codes in detail that reduce the mentioned costs to a large extent. The repairing phases in these codes were scheduled and a suitable algorithm was required to attain an optimal situation. |
|---|