access icon free Optimal cooperative repair strategy for (n = 2k + s,k) Suh–Ramchandran code

An (n = 2k + s,k) Suh–Ramchandran code is shown, where s > 0 is a positive integer, is a minimum storage regeneration code, and can also achieve the optimal repair bandwidth for multiple systematic nodes failure repair.

Inspec keywords: failure analysis; codes

Other keywords: multiple systematic node failure repair; minimum storage regeneration code; Suh-Ramchandran code; optimal cooperative repair strategy; positive integer; optimal repair bandwidth

Subjects: Codes; Reliability

References

    1. 1)
    2. 2)
      • 10. Wang, A., Zhang, Z.: ‘Exact cooperative regenerating codes with minimum-repair-bandwidth for distributed storage’. Proc. of IEEE INFOCOM, Turin, Italy, April 2013, pp. 400404.
    3. 3)
      • 1. Kubiatowicz, J., Bindel, D., Chen, Y., et al: ‘OceanStore: an architecture for global-scale persistent storage’. Proc. Ninth Int. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Cambridge, MA, USA, November 2000, pp. 190201.
    4. 4)
    5. 5)
      • 11. Chen, J., Shum, K.W.: ‘Repairing multiple failures in the Suh–Ramchandran regenerating codes’. Proc. IEEE Int. Symp. Information Theory (ISIT), Istanbul, Turkey, July 2013, pp. 14411445.
    6. 6)
    7. 7)
      • 3. Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, M., Morris, R.: ‘Designing a DHT for low latency and high throughput’, Proc. Nsdi, 2004, 4, pp. 8598.
    8. 8)
    9. 9)
    10. 10)
      • 2. Bhagwan, R., Tati, K., Cheng, Y., Savage, S., Voelker, G.: ‘Total recall: system support for automated availability management’. Proc. fist Conf. on Networked Systems Design and Implementation, San Francisco, CA, USA, March 2004, pp. 337350.
    11. 11)
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2016.3518
Loading

Related content

content/journals/10.1049/el.2016.3518
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading