2000 character limit reached
Repairing with Zero Skip Cost
Published 6 May 2024 in cs.IT and math.IT | (2405.03614v1)
Abstract: To measure repair latency at helper nodes, we introduce a new metric called skip cost that quantifies the number of contiguous sections accessed on a disk. We provide explicit constructions of zigzag codes and fractional repetition codes that incur zero skip cost
- A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, “Network coding for distributed storage systems,” IEEE transactions on information theory, vol. 56, no. 9, pp. 4539–4551, 2010.
- A. G. Dimakis, K. Ramchandran, Y. Wu, and C. Suh, “A survey on network codes for distributed storage,” Proceedings of the IEEE, vol. 99, no. 3, pp. 476–489, 2011.
- S. Liu and F. Oggier, “An overview of coding for distributed storage systems,” Network Coding and Subspace Designs, pp. 363–383, 2018.
- V. Ramkumar, M. Vajha, S. B. Balaji, M. N. Krishnan, B. Sasidharan, and P. V. Kumar, “Codes for distributed storage,” in Concise Encyclopedia of Coding Theory. Chapman and Hall/CRC, 2021, pp. 735–762.
- M. Ye and A. Barg, “Explicit constructions of high-rate mds array codes with optimal repair bandwidth,” IEEE Transactions on Information Theory, vol. 63, no. 4, pp. 2001–2014, 2017.
- M. Vajha, V. Ramkumar, B. Puranik, G. Kini, E. Lobo, B. Sasidharan, P. V. Kumar, A. Barg, M. Ye, S. Narayanamurthy et al., “Clay codes: Moulding {{\{{MDS}}\}} codes to yield an {{\{{MSR}}\}} code,” in 16th USENIX Conference on File and Storage Technologies (FAST 18), 2018, pp. 139–154.
- T.-Y. Wu, Y. S. Han, Z. Li, B. Bai, G. Zhang, X. Zhang, and X. Wu, “Achievable lower bound on the optimal access bandwidth of (k+2,k,2)𝑘2𝑘2(k+2,k,2)( italic_k + 2 , italic_k , 2 )-mds array code with degraded read friendly,” in 2021 IEEE Information Theory Workshop (ITW), 2021, pp. 1–5.
- N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, “Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff,” IEEE Transactions on Information Theory, vol. 58, no. 3, pp. 1837–1852, 2012.
- I. Tamo, Z. Wang, and J. Bruck, “Zigzag codes: Mds array codes with optimal rebuilding,” IEEE Transactions on Information Theory, vol. 59, no. 3, pp. 1597–1616, 2013.
- S. El Rouayheb and K. Ramchandran, “Fractional repetition codes for repair in distributed storage systems,” in 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2010, pp. 1510–1517.
- T. Ernvall, “The existence of fractional repetition codes,” arXiv e-prints, pp. arXiv–1201, 2012.
- O. Olmez and A. Ramamoorthy, “Fractional repetition codes with flexible repair from combinatorial designs,” IEEE Transactions on Information Theory, vol. 62, no. 4, pp. 1565–1591, 2016.
- B. Zhu, K. W. Shum, H. Li, and H. Hou, “General fractional repetition codes for distributed storage systems,” IEEE Communications Letters, vol. 18, no. 4, pp. 660–663, 2014.
- N. Silberstein and T. Etzion, “Optimal fractional repetition codes and fractional repetition batch codes,” in 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015, pp. 2046–2050.
- H. Hanani, “On quadruple systems,” Canadian Journal of Mathematics, vol. 12, pp. 145–157, 1960.
- C. C. Lindner and A. Rosa, “Steiner quadruple systems-a survey,” Discrete Mathematics, vol. 22, no. 2, pp. 147–181, 1978.
- L. Ji and L. Zhu, “An improved product construction of rotational steiner quadruple systems,” Journal of Combinatorial Designs, vol. 10, no. 6, pp. 433–443, 2002.
- N. Alon, “Combinatorial nullstellensatz,” Combinatorics, Probability and Computing, vol. 8, no. 1-2, pp. 7–29, 1999.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.