Skip to main content
SpringerLink
Log in

Explicit construction of minimum bandwidth rack-aware regenerating codes

  • Letter
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Huang C, Simitci H, Xu Y, et al. Erasure coding in windows azure storage. In: Proceedings of the 2012 USENIX Annual Technical Conference, Boston, 2012. 15–26

  2. Sathiamoorthy M, Asteris M, Papailiopoulos D, et al. XORing elephants: novel erasure codes for big data. Proc VLDB Endow, 2013, 6: 325–336

    Article  Google Scholar 

  3. Dimakis A G, Godfrey P B, Wu Y, et al. Network coding for distributed storage systems. IEEE Trans Inform Theor, 2010, 56: 4539–4551

    Article  MATH  Google Scholar 

  4. Balaji S B, Krishnan M N, Vajha M, et al. Erasure coding for distributed storage: an overview. Sci China Inf Sci, 2018, 61: 100301

    Article  Google Scholar 

  5. Hou H, Lee P P C, Shum K W, et al. Rack-aware regenerating codes for data centers. IEEE Trans Inform Theor, 2019, 65: 4730–4745

    Article  MathSciNet  MATH  Google Scholar 

  6. Chen Z, Barg A. Explicit constructions of MSR codes for clustered distributed storage: the rack-aware storage model. IEEE Trans Inform Theor, 2020, 66: 886–899

    Article  MathSciNet  MATH  Google Scholar 

  7. Rashmi K V, Shah N B, Kumar P V. Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction. IEEE Trans Inform Theor, 2011, 57: 5227–5239

    Article  MathSciNet  MATH  Google Scholar 

  8. Tamo I, Barg A. A family of optimal locally recoverable codes. IEEE Trans Inform Theor, 2014, 60: 4661–4676

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported in part by National Key R&D Program of China (Grant No. 2020YFA0712300) and National Natural Science Foundation of China (Grant No. 61872353).

Author information

Authors and Affiliations

  1. Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, China

    Liyang Zhou & Zhifang Zhang

  2. School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, 100049, China

    Liyang Zhou & Zhifang Zhang

Authors
  1. Liyang Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhifang Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhifang Zhang.

Additional information

Supporting information

Appendixes A–C. The supporting information is available online at info.scichina.com and link.springer.com. The supporting materials are published as submitted, without typesetting or editing. The responsibility for scientific accuracy and content remains entirely with the authors.

Supplementary File

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, L., Zhang, Z. Explicit construction of minimum bandwidth rack-aware regenerating codes. Sci. China Inf. Sci. 65, 179301 (2022). https://doi.org/10.1007/s11432-021-3304-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-021-3304-6

Search

Navigation