Skip to main content
SpringerLink
Log in
Book cover

International Conference in Communications, Signal Processing, and Systems

CSPS 2018: Communications, Signal Processing, and Systems pp 361–369Cite as

A Low-Complexity Shorten Regenerating Code with Optimal Repair Bandwidth

  • Conference paper
  • First Online:

  • 2143 Accesses

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 516))

Abstract

Regenerating codes (RGCs) are considered as optimal trade-off between repair bandwidth and storage amount per node in a distributed storage system (DSS). Actually, due to the limited nodes’ amount and bandwidth resources in networks, redundant bandwidth cost and assisted nodes connections will involve as employing the traditional RGC. Specific to these problems, we propose a new code, named shorten minimum storage regenerating code (sMSR) with two novel targets, unit storage cost (USC) and unit repair bandwidth (URB), and construct it by removing some information bits of the mother code generated by product matrix in encoding process. Additionally, in order to improve the availability of sMSR, we implement Binary Addition and Shift Implementable Convolution (BASIC) to decrease the computation complexity. The simulation results demonstrate that our code improves repair efficiency of MSR codes in practical DSS.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Ma Y, Nandagopal T, Puttaswamy KPN, Banerjee S. An ensemble of replication and erasure codes for cloud file systems. In: Proceedings IEEE. INFOCOM; 2013. p. 1276–84.

    Google Scholar 

  2. Dimakis AG, Brighten Godfrey P, Wu Y, Wainwright MJ, Ramchandran K. Network coding for distributed storage systems. IEEE Trans Inf Theory. 2010;56(9):4539–51.

    Article  Google Scholar 

  3. Rashmi KV, Shah NB, Kumar PV. Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction. IEEE Trans Inf Theory. 2011;57(8):5227–39.

    Article  MathSciNet  Google Scholar 

  4. Oggier F, Datta A. Self-repairing homomorphic codes for distributed storage systems. In: Proceedings IEEE. INFOCOM; 2011. p. 1215–23.

    Google Scholar 

  5. Oggier F, Datta A. Self-repairing codes for distributed storage a projective geometric construction. In: Information theory workshop; 2011. p. 30–4.

    Google Scholar 

  6. Goldwasser JL. Shortened and punctured codes and the macwilliams identities. Linear Algebra Appl. 1997;253(253):1–13.

    Article  MathSciNet  Google Scholar 

  7. Hou H, Shum KW, Chen M, Li H. Basic codes: low-complexity regenerating codes for distributed storage systems. IEEE Trans Inf Theory. 2016;62(6):3053–69.

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work was supported by the National Natural Sciences Foundation of China under Grant 61701136, Grant 61771158, Grant 61501140, and Grant 61525103, and Project funded by China Postdoctoral Science Foundation 2018M630357, and Shenzhen Basic Research Program under Grant JCYJ2017081114233370, Grant JCYJ20170811154309920 and Grant ZDSYS20170728090330586.

Author information

Authors and Affiliations

  1. Communication Engineering Research Center, Harbin Institute of Technology, Shenzhen, Guangdong, China

    Ke Li, Shushi Gu, Ye Wang, Jian Jiao & Qinyu Zhang

Authors
  1. Ke Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shushi Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ye Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jian Jiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Qinyu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ke Li .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, University of Texas at Arlington, Arlington, TX, USA

    Qilian Liang

  2. School of Information and Communication Engineering, Dalian University of Technology, Dalian, China

    Xin Liu

  3. School of Information Science and Technology, Dalian Maritime University, Dalian, China

    Zhenyu Na

  4. College of Electronic and Communication Engineering, Tianjin Normal University, Tianjin, China

    Wei Wang

  5. College of Electronic and Communication Engineering, Tianjin Normal University, Tianjin, China

    Jiasong Mu

  6. College of Electronic and Communication Engineering, Tianjin Normal University, Tianjin, China

    Baoju Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, K., Gu, S., Wang, Y., Jiao, J., Zhang, Q. (2020). A Low-Complexity Shorten Regenerating Code with Optimal Repair Bandwidth. In: Liang, Q., Liu, X., Na, Z., Wang, W., Mu, J., Zhang, B. (eds) Communications, Signal Processing, and Systems. CSPS 2018. Lecture Notes in Electrical Engineering, vol 516. Springer, Singapore. https://doi.org/10.1007/978-981-13-6504-1_45

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-6504-1_45

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-6503-4

  • Online ISBN: 978-981-13-6504-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation