AI 中文总结
针对现有AVID协议数据分散与节点恢复操作研究不足的问题，提出基于二维矩阵编码的高效AVID协议，平衡了各环节复杂度，适配广泛现实场景。
AI 中文摘要
分布式存储系统的核心目标是确保客户端在存在故障的情况下仍能可靠且一致地读写数据。现有异步可验证信息分散（AVID）协议在拜占庭环境下实现了存储的最优空间复杂度与数据检索的最优通信复杂度，但数据分散和节点恢复的关键操作却较少受到关注。我们提出一种高效的AVID协议，该协议同时保证了分散、存储、检索和恢复的低复杂度。该协议的核心是一种将数据编码为二维矩阵的新颖机制以及定制的分散算法。该协议保持了检索的最优通信复杂度，同时大幅改进了现有技术的恢复性能。此外，我们描述了如何修改该协议以降低分散的空间复杂度和通信复杂度，代价是提高检索和恢复的通信复杂度。由于所提出的协议在所有考虑的指标之间取得了平衡，因此适用于广泛的现实用例。
英文摘要
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.
CommentsPublished at SPAA 2026 (July 6-10, 2026, London, UK)
Journal refIn Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2026). ACM, New York, NY, USA, 143-154
