The Design of Regenerating Codes with a Varying Number of Helper Nodes 


Vol. 41,  No. 12, pp. 1684-1691, Dec.  2016


PDF Full-Text
  Abstract

Erasure codes have recently been applied to distributed storage systems due to their high storage efficiency. Regenerating codes are a kind of erasure codes, which are optimal in terms of minimum repair bandwidth. An (n, k, d)-regenerating code consists of n storage nodes where a failed node can be recovered with the help of the exactly d numbers of surviving nodes. However, if node failures occur frequently or network connection is unstable, the number of helper nodes that a failed node can contact may be smaller than d. In such cases, regenerating codes cannot repair the failed nodes efficiently since the node repair process of the codes does not work when the number of helper nodes is less than d. In this paper, we propose an operating method of regenerating codes where a failed node can be repaired from d¯ helper nodes where k ≦d¯≦ d.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Lee and J. Lee, "The Design of Regenerating Codes with a Varying Number of Helper Nodes," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 12, pp. 1684-1691, 2016. DOI: .

[ACM Style]

Hyuk Lee and Jungwoo Lee. 2016. The Design of Regenerating Codes with a Varying Number of Helper Nodes. The Journal of Korean Institute of Communications and Information Sciences, 41, 12, (2016), 1684-1691. DOI: .

[KICS Style]

Hyuk Lee and Jungwoo Lee, "The Design of Regenerating Codes with a Varying Number of Helper Nodes," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 12, pp. 1684-1691, 12. 2016.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880