• DocumentCode
    3609480
  • Title

    Adaptive Fractional Repetition Codes for Dynamic Storage Systems

  • Author

    Bing Zhu ; Hui Li

  • Author_Institution
    Sch. of Electron. & Comput. Eng., Peking Univ., Shenzhen, China
  • Volume
    19
  • Issue
    12
  • fYear
    2015
  • Firstpage
    2078
  • Lastpage
    2081
  • Abstract
    Node recovery is a challenging task in erasure-coded storage systems, which involves a considerable amount of network resources. The efficacy of failure recovery is measured by various metrics, such as repair bandwidth and computational complexity. This letter focuses on fractional repetition (FR) codes, which are a family of codes that provide uncoded exact repairs with minimum repair bandwidth. We consider the usage of FR codes in dynamic storage systems, where the system parameters can vary over time. Specifically, we introduce adaptive fractional repetition codes that can effectively adapt to system changes. The proposed codes allow update of systems without the need for frequent reconfigurations. Moreover, explicit code constructions for both homogeneous and heterogeneous storage systems are presented.
  • Keywords
    adaptive codes; cache storage; cloud computing; computational complexity; resource allocation; FR codes; adaptive fractional repetition codes; code constructions; computational complexity; dynamic storage systems; erasure-coded storage systems; failure recovery; heterogeneous storage systems; homogeneous storage systems; network resources; node recovery; repair bandwidth; Adaptive systems; Algorithm design and analysis; Bandwidth; Computational complexity; Encoding; Maintenance engineering; Wireless communication; Distributed storage systems; combinatorial designs; regenerating codes; repair bandwidth; uncoded repair;
  • fLanguage
    English
  • Journal_Title
    Communications Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1089-7798
  • Type

    jour

  • DOI
    10.1109/LCOMM.2015.2496197
  • Filename
    7312417