CPRSD for LT codes

Yao, Weiqing; Yi, Benshun; Li, Weizhong; Huang, Taiqi; Xie, Qiuying

doi:10.1049/iet-com.2015.1183

Cited by 7 publications

(6 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We evaluate the threshold-based data recovery cost for the general repair tree structure in various system parameters and code parameters. In order to trade-off the relationship between successful decoding rate and decoding overhead, it is critical to select an appropriate value of [32]. For the LT code with (n=3000, k=1500, r=1500), we set = 0.2 , which can guarantee high successful decoding rate.…”

Section: The Simulation Results Of the General Repair Tree Structurementioning

confidence: 99%

See 1 more Smart Citation

An Optimal Tree-Structured Repair Scheme of Multiple Failure Nodes for Distributed Storage Systems

Zhou

Liu

et al. 2021

IEEE Access

Self Cite

View full text Add to dashboard Cite

To reduce recovery cost of repairing multiple failed nodes, many repair schemes have been proposed for erasure codes based distributed storage systems. However, most of the existing researches ignore the network topology of storage devices. Motivated by such considerations, we combine delay repair schemes with network topology and propose a tree-structured model based on fountain codes with large value of (, ,) to improve the repair efficiency. More precisely, with the consideration of network topology, a new target named data recovery cost is defined to measure the efficiency of coded fragment download and source file reconstruction, and then the optimal recovery threshold is derived to minimize the average data recovery cost of general tree-structured model. Moreover, we analyze and compare the average data recovery cost of general tree-structure with different systematic parameters. To further improve the data transmission efficiency, an optimal tree-structured scheme based on improved tabu search algorithm (ITSA-ORT) is proposed. Compared with other algorithms, the ITSA-ORT scheme uses Prim algorithm to generate the initial solution and then uses special method to obtain the corresponding neighborhood structure. The experimental results show that the proposed scheme can find a globally optimal solution and obtain lower cost of data recovery. In addition, the ITSA-ORT scheme has lower computational complexity than the optimal treestructured scheme based on particle swarm optimization algorithm (PSO-ORT) and the optimal treestructured scheme based on firefly algorithm (FA-ORT). INDEX TERMS Centralized communication model, fountain codes, delay repair, network topology, treestructured model, optimization algorithms.

show abstract

Section: The Simulation Results Of the General Repair Tree Structurementioning

confidence: 99%

“…In this paper, we exploit the advantage of large LT codes to ensure the reliability of stored data during transmission. It must be noted that, in order to guarantee the encoding/decoding performance of large LT codes, we select the combined Poisson robust soliton distribution (CPRSD) as the degree distribution for large LT codes [32].…”

Section: A Large Lt Codesmentioning

confidence: 99%

An Optimal Tree-Structured Repair Scheme of Multiple Failure Nodes for Distributed Storage Systems

Zhou

Liu

et al. 2021

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…In order to reduce overhead and consuming the time of encoding and decoding process, CPRSD proposed by combining IPD and RSD as follows [20] First, η(i) is obtained from normalization of θ(i),…”

Section: Combined Poisson Robust Soliton Distributionmentioning

confidence: 99%

Performance and Time Improvement of LT Codes-based Cloud Storage

Chakani¹,

Mirrezaei²,

Hodtani³

2021

Preprint

View full text Add to dashboard Cite

Outsourcing data on the cloud storage services has already attracted great attention due to prospect of rapid data growth and storing efficiencies for customers. The coding-based cloud storage approach can offer more reliable and faster solution with less storage space in comparison with replication-based cloud storage. LT codes as a famous member of rateless codes family can improve performance of storage systems utilizing good degree distributions. Since degree distribution plays key role in LT codes performance, recently introduced Poisson Robust Soliton Distribution (PRSD) and Combined Poisson Robust Soliton Distribution (CPRSD) motivate us to investigate LT codes-based cloud storage system. So, we exploit LT codes with new degree distributions in order to provide lower average degree and higher decoding efficiency, specifically when receiving fewer encoding symbols, comparing with popular degree distribution, Robust Soliton Distribution (RSD). In this paper, we show that proposed cloud storage outperforms traditional ones in terms of storage space and robustness encountering unavailability of encoding symbols, due to compatible properties of PRSD and CPRSD with cloud storage essence. Furthermore, modified decoding process based on required encoding symbols behavior is presented to reduce data retrieval time. Numerical results confirm improvement of cloud storage performance.

show abstract

“…The parameters of PRSD are obtained through the analysis of ripple size evolution. Improved PD and RSD were combined to increase the mean of ripple size and reduce its variation [9]. Binary exponential distribution, PD, and RSD were combined to improve symbol recovery probability [10].…”

Section: Introductionmentioning

confidence: 99%

Goal‐oriented design of optimal degree distribution for LT codes

Zhang

2020

IET Communications

View full text Add to dashboard Cite

CPRSD for LT codes

Cited by 7 publications

References 23 publications

An Optimal Tree-Structured Repair Scheme of Multiple Failure Nodes for Distributed Storage Systems

An Optimal Tree-Structured Repair Scheme of Multiple Failure Nodes for Distributed Storage Systems

Performance and Time Improvement of LT Codes-based Cloud Storage

Goal‐oriented design of optimal degree distribution for LT codes

Contact Info

Product

Resources

About