Problem
Research questions and friction points this paper is trying to address.
AVID
data dispersal
node recovery
complexity
Asynchronous Verifiable Information Dispersal with Low Space and Communication Complexity
🤖 AI Summary
本文提出了一种高效的异步可验证信息分散协议，通过二维矩阵编码和定制分散算法，在保证数据检索通信复杂度最优的同时，显著降低了恢复操作的复杂度。
📝 Abstract
The primary goal of a distributed storage system is to ensure that clients can both write and read data in a reliable and consistent manner, even in the presence of failures. While existing asynchronous verifiable information dispersal (AVID) protocols achieve optimal space complexity for storage and communication complexity for data retrieval in a Byzantine setting, the crucial operations of data dispersal and node recovery have received less attention.
We propose an efficient AVID protocol that simultaneously guarantees low complexities for dispersal, storage, retrieval, and recovery. At the core of the proposed protocol lies a novel mechanism to encode data in a two-dimensional matrix and a bespoke dispersal algorithm. The protocol maintains an optimal communication complexity for retrieval while substantially improving upon the state of the art for recovery. Additionally, we describe how the protocol can be modified in order to reduce the space complexity and the communication complexity for dispersal, at the expense of a higher communication complexity for retrieval and recovery. As the proposed protocols strike a balance across all considered metrics, they are suitable for a broad range of real-world use cases.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Asynchronous Verifiable Information Dispersal
Two-dimensional Matrix Encoding
Customized Dispersal Algorithm
Optimal Communication Complexity for Retrieval
Improved Recovery Efficiency
🔎 Similar Papers
