作者: Ping Hu , Chi Wan Sung , Terence H. Chan
DOI: 10.1109/TCOMM.2018.2875752
关键词:
摘要: In wireless distributed storage systems, nodes are connected by channels, which broadcast in nature. This paper exploits this unique feature to design an efficient repair mechanism, called repair, for systems the presence of multiple-node failures. Due nature transmission, we advocate a new measure on performance repair-transmission bandwidth . contrast bandwidth, measures average number packets downloaded newcomer replace failed node, transmitted helper per node. The system considered can undergo unlimited rounds. We obtain upper bound maximum file size that be supported cut analysis finite graph. achievability is shown codes constructed over refined information flow graph, unbounded. addition, optimal storage-bandwidth tradeoff obtained. compared both analytically and numerically with cooperative basic method wired While based idea allowing newcomers exchange packets, all simultaneously. show outperforms offering better between efficiency bandwidth.