Fragment Maintenance in Distributed Storage Systems

Author

Yang, Xiaoyuan ; Zhu, Shuaishuai

Author_Institution

Key Lab. of Network & Inf. Security of APF, Eng. Coll. of APF, Xi´´an, China

fYear

2010

Firstpage

123

Lastpage

126

Abstract

How to efficiently enhance fault-tolerance and data access availability are the major problems to solve in distributed storage system. Data fragment maintenance is an essential part of distributed storage systems. Byzantine quorum system is a typical system model in maintaining data availability. The paper presents a novel fragment verifying and repairing algorithm built in Byzantine quorum system with the mechanism of fragment verifier generation and recovery. Different data redundancy schemes are considered when applying our algorithm. According to our analysis, the algorithm can greatly reduce computing complexity and network load in probing and returning an available quorum. More importantly, processing simplification is considered.

Keywords

distributed processing; fault tolerant computing; information retrieval; redundancy; security of data; Byzantine quorum system; data access availability; data fragment maintenance; data redundancy; distributed storage system; fault tolerance; repairing algorithm; Availability; Fault tolerant systems; Maintenance engineering; Protocols; Redundancy; Training; Byzantine fault-tolerance; data repair; distributed storage system; quorum system; secret sharing scheme;

fLanguage

English

Publisher

ieee

Conference_Titel

Multimedia Information Networking and Security (MINES), 2010 International Conference on

Conference_Location

Nanjing, Jiangsu

Print_ISBN

978-1-4244-8626-7

Electronic_ISBN

978-0-7695-4258-4

Type

conf

DOI

10.1109/MINES.2010.34

Filename

5670931