Linear block code with locality and availability inspired by tetrahedron-Reference-Cited by-同舟云学术

Linear block code with locality and availability inspired by tetrahedron

Published:2024-02-01 Issue:1 Volume:75 Page:72-76
ISSN:1339-309X
Container-title:Journal of Electrical Engineering
language:en
Short-container-title:

Author:

Farkaš Peter¹²

Affiliation:

1. Faculty of Electrical Engineering and Information Technology , Slovak University of Technology , Ilkovičova 3 , Bratislava , Slovakia

2. Faculty of Informatics , Pan-European University , Tematínska 10, 851 05 Bratislava , Slovakia

Abstract

Abstract The primary application of codes with locality and availability in distributed storage is for data recovery in case that data are lost on some damaged servers. Locality enables the recovery of lost data by contacting only a restricted number of remaining servers. Availability means that more than one subset of servers providing locality is available for data recovery for each server. The secondary application of these codes in distributed storage is to allow access to hot data in times of high demand. In this paper it is shown that the binary linear [14, 4, 7] code has locality 2 and availability 6 and it can be interpreted as a three-dimensional graph obtained from a [7, 3, 4] Simplex code. It is achieving upper bounds on basic parameters for codes with all-symbols locality and availability. This code can be a building element of more complex codes with scalability inspired by three-dimensional structures. The availability spectrum is introduced as a tool for analyzing codes with locality and availability.

Publisher

Walter de Gruyter GmbH

Link

https://www.sciendo.com/pdf/10.2478/jee-2024-0010

Reference10 articles.

1. A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright and K. Ramchandran, “Network Coding for Distributed Storage Systems,” in IEEE Transactions on Information Theory, vol. 56, no. 9, pp. 4539-4551, Sept. 2010, doi: 10.1109/TIT.2010.2054295.

2. E. Tomes and N. Altiparmak, “A Comparative Study of HDD and SSD RAIDs’ Impact on Server Energy Consumption,” 2017 IEEE International Conference on Cluster Computing (CLUSTER), Honolulu, HI, USA, 2017, pp. 625-626, doi: 10.1109/CLUSTER.2017.103.

3. J. Wan, J. Wang, Q. Yang and C. Xie, “S2-RAID: A new RAID architecture for fast data recovery,” 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST), Incline Village, NV, USA, 2010, pp. 1-9, doi: 10.1109/MSST.2010.5496980.

4. M. F. Aktaş, S. Kadhe, E. Soljanin and A. Sprintson, “Download Time Analysis for Distributed Storage Codes With Locality and Availability,” in IEEE Transactions on Communications, vol. 69, no. 6, pp. 3898-3910, June 2021, doi: 10.1109/TCOMM.2021.3067054.

5. P. Farkaš, “Scalable Family of Codes with Locality and Availability for Information Repair in Distributed Storage Systems,” 2019 4th International Conference on Smart and Sustainable Technologies (SpliTech), Split, Croatia, 2019, pp. 1-4, doi: 10.23919/SpliTech.2019.8783148.