DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Dongwon | ko |
dc.contributor.author | Park, Hyegyeong | ko |
dc.contributor.author | Moon, Jaekyun | ko |
dc.date.accessioned | 2016-07-07T06:37:51Z | - |
dc.date.available | 2016-07-07T06:37:51Z | - |
dc.date.created | 2016-06-20 | - |
dc.date.created | 2016-06-20 | - |
dc.date.issued | 2016-05-24 | - |
dc.identifier.citation | 2016 IEEE International Conference on Communications (ICC), pp.423 - 428 | - |
dc.identifier.uri | http://hdl.handle.net/10203/210150 | - |
dc.description.abstract | Distributed storage systems suffer from significant repair traffic generated due to frequent storage node failures. This paper shows that properly designed low-density parity-check (LDPC) codes can substantially reduce the amount of required block downloads for repair thanks to the sparse nature of their factor graph representation. In particular, with a careful construction of the factor graph, both low repair-bandwidth and high reliability can be achieved for a given code rate. First, a formula for the average repair bandwidth of LDPC codes is developed. This formula is then used to establish that the minimum repair bandwidth can be achieved by forcing a regular check node degree in the factor graph. It is also shown that for a given repair-bandwidth overhead, LDPC codes can have substantially higher reliability than currently utilized Reed-Solomon (RS) codes. Our reliability analysis is based on a formulation of the general equation for the mean-time-to-data-loss (MTTDL) associated with LDPC codes. The formulation reveals that the stopping number is highly related to MTTDL. For code rates 1/2, 2/3, and 3/4, our results show that quasi-cyclic (QC) progressive-edge-growth (PEG) LDPC codes with variable node degree 2 allow 25% ~ 50% reduction in the repair bandwidth while maintaining higher MTTDL compared to currently employed RS codes. | - |
dc.language | English | - |
dc.publisher | IEEE | - |
dc.title | Reducing Repair-Bandwidth Using Codes Based on Factor Graphs | - |
dc.type | Conference | - |
dc.identifier.wosid | 000390993200070 | - |
dc.identifier.scopusid | 2-s2.0-84981328270 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 423 | - |
dc.citation.endingpage | 428 | - |
dc.citation.publicationname | 2016 IEEE International Conference on Communications (ICC) | - |
dc.identifier.conferencecountry | MY | - |
dc.identifier.conferencelocation | 쿠알라룸푸르 | - |
dc.identifier.doi | 10.1109/ICC.2016.7510728 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Moon, Jaekyun | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.