Data Recovery Scheme Based on Erasure Codes in Satellite Storage Networks
Yiping Teng, Heyao Yang, Haochun Pan, Tiantian Yu, Chunlong Fan · 2025
In recent years, satellite networking technology has garnered significant attention and found applications across various domains, including edge computing, data communication, and data storage. Satellite networks offer a direct solution to network coverage issues, leveraging advantages such as extensive coverage, minimal reliance on infrastructure, and independence from cost and distance constraints. Despite the widespread use of erasure codes for fault tolerance in distributed storage systems, current solutions often lack direct support for the dynamic topologies characteristic of satellite networks. To address the data transmission and latency challenges faced by erasure code systems in dynamic satellite networks, we propose a novel index, i.e., Era-H2H index, that integrates space-time graphs with tree decomposition. Additionally, to reduce the storage costs associated with Era-H2H index, we present an optimization algorithm that leverages the recovery properties of erasure codes and the temporal features of the space-time graph. To further minimize recovery costs, we develop a two-layer regeneration tree, i.e., H2H-RegTree, construction algorithm based on Era-H2H index. At last, we analyze the complexity of the proposed algorithms and conduct an experimental evaluation to demonstrate their performance.