Please use this identifier to cite or link to this item:
https://hdl.handle.net/11499/51099
Title: | Minimum Repair Bandwidth LDPC Codes for Distributed Storage Systems | Authors: | Pourmandi, Massoud Pusane, Ali Emre Arslan, Suayb S. S. Haytaoglu, Elif |
Keywords: | Parity check codes Maintenance engineering Bandwidth Decoding Protocols Complexity theory Reliability engineering Distributed storage LDPC data regeneration BEC repair differential evolution (DE) Design |
Publisher: | IEEE-Inst Electrical Electronics Engineers Inc | Abstract: | In distributed storage systems (DSS), an optimal code design must meet the requirements of efficient local data regeneration in addition to reliable data retention. Recently, low-density parity-check (LDPC) codes have been proposed as a promising candidate that can secure high data rates as well as low repair bandwidth while maintaining low complexity in data reconstruction. The main objective of this study is to optimize the repair bandwidth characteristics of LDPC code families for a DSS application while meeting the data reliability requirements. First, a data access scenario in which nodes contact other available nodes randomly to download data is examined. Later, a minimum-bandwidth protocol is considered in which nodes make their selections based on the degree numbers of check nodes. Through formulating optimization problems for both protocols, a fundamental trade-off between the decoding threshold and the repair bandwidth is established for a given code rate. Finally, conclusions are confirmed by numerical results showing that irregular constructions have a large potential for establishing optimized LDPC code families for DSS applications. | URI: | https://doi.org/10.1109/LCOMM.2022.3230263 https://hdl.handle.net/11499/51099 |
ISSN: | 1089-7798 1558-2558 |
Appears in Collections: | Mühendislik Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.