Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Set Transformation: Trade-off Between Repair Bandwidth and Sub-packetization (2405.02713v1)

Published 4 May 2024 in cs.IT and math.IT

Abstract: Maximum distance separable (MDS) codes facilitate the achievement of elevated levels of fault tolerance in storage systems while incurring minimal redundancy overhead. Reed-Solomon (RS) codes are typical MDS codes with the sub-packetization level being one, however, they require large repair bandwidth defined as the total amount of symbols downloaded from other surviving nodes during single-node failure/repair. In this paper, we present the {\em set transformation}, which can transform any MDS code into set transformed code such that (i) the sub-packetization level is flexible and ranges from 2 to $(n-k){\lfloor\frac{n}{n-k}\rfloor}$ in which $n$ is the number of nodes and $k$ is the number of data nodes, (ii) the new code is MDS code, (iii) the new code has lower repair bandwidth for any single-node failure. We show that our set transformed codes have both lower repair bandwidth and lower field size than the existing related MDS array codes, such as elastic transformed codes \cite{10228984}. Specifically, our set transformed codes have $2\%-6.6\%$ repair bandwidth reduction compared with elastic transformed codes \cite{10228984} for the evaluated typical parameters.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (27)
  1. K. Tang, K. Cheng, H. H. W. Chan, X. Li, P. P. C. Lee, Y. Hu, J. Li, and T.-Y. Wu, “Balancing Repair Bandwidth and Sub-Packetization in Erasure-Coded Storage via Elastic Transformation,” in IEEE INFOCOM 2023 - IEEE Conference on Computer Communications, 2023, pp. 1–10.
  2. I. S. Reed and G. Solomon, “Polynomial Codes over Certain Finite Fields,” Journal of the Society for Industrial & Applied Mathematics, vol. 8, no. 2, pp. 300–304, 1960.
  3. D. Ford, F. Labelle, F. I. Popovici, M. Stokely, V.-A. Truong, L. Barroso, C. Grimes, and S. Quinlan, “Availability in Globally Distributed Storage Systems,” in Proc. of the 9th Usenix Symposium on Operating Systems Design and Implementation, 2010, pp. 1–7.
  4. A. Dimakis, P. Godfrey, Y. Wu, M. Wainwright, and K. Ramchandran, “Network Coding for Distributed Storage Systems,” IEEE Trans. Information Theory, vol. 56, no. 9, pp. 4539–4551, Sep. 2010.
  5. K. V. Rashmi, N. B. Shah, and P. V. Kumar, “Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction,” IEEE Trans. Information Theory, vol. 57, no. 8, pp. 5227–5239, August 2011.
  6. I. Tamo, Z. Wang, and J. Bruck, “Zigzag Codes: MDS Array Codes with Optimal Rebuilding,” IEEE Trans. Information Theory, vol. 59, no. 3, pp. 1597–1616, May 2013.
  7. H. Hou, K. W. Shum, M. Chen, and H. Li, “BASIC Codes: Low-Complexity Regenerating Codes for Distributed Storage Systems,” IEEE Trans. Information Theory, vol. 62, no. 6, pp. 3053–3069, 2016.
  8. M. Ye and A. Barg, “Explicit Constructions of Optimal-Access MDS Codes with Nearly Optimal Sub-Packetization,” IEEE Transactions on Information Theory, vol. 63, no. 10, pp. 6307–6317, 2017.
  9. J. Li, X. Tang, and C. Tian, “A Generic Transformation to Enable Optimal Repair in MDS codes for Distributed Storage Systems,” IEEE Trans. Information Theory, vol. 64, no. 9, pp. 6257–6267, 2018.
  10. S. B. Balaji and P. V. Kumar, “A Tight Lower Bound on the Sub- Packetization Level of Optimal-Access MSR and MDS Codes,” in Proc. IEEE Int. Symp. Inf. Theory, 2018, pp. 2381–2385.
  11. H. Hou, P. P. Lee, and Y. S. Han, “Multi-Layer Transformed MDS Codes with Optimal Repair Access and Low Sub-Packetization,” arXiv preprint arXiv:1907.08938, 2019.
  12. H. Hou and P. P. Lee, “Binary MDS Array Codes with Optimal Repair,” IEEE Trans. Information Theory, vol. 66, no. 3, pp. 1405–1422, Mar. 2020.
  13. K. V. Rashmi, N. B. Shah, and K. Ramchandran, “A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes,” IEEE Trans. Information Theory, vol. 63, no. 9, pp. 5802–5820, 2017.
  14. G. Y. Li, X. Lin, and X. Tang, “An Efficient One-to-One Piggybacking Design for Distributed Storage Systems,” IEEE Trans. Communications, vol. 67, no. 12, pp. 8193–8205, 2019.
  15. Z. Jiang, H. Hou, Y. S. Han, Z. Huang, B. Bai, and G. Zhang, “An Efficient Piggybacking Design with Lower Repair Bandwidth and Lower Sub-packetization,” in Proc. IEEE Int. Symp. Inf. Theory, 2021, pp. 2328–2333.
  16. H. Shi, H. Hou, Y. S. Han, P. P. C. Lee, Z. Jiang, Z. Huang, and B. Bai, “New Piggybacking Codes with Lower Repair Bandwidth for Any Single-Node Failure,” in 2022 IEEE International Symposium on Information Theory (ISIT), 2022, pp. 2601–2606.
  17. Z. Jiang, H. Shi, Z. Huang, B. Bai, G. Zhang, and H. Hou, “Toward Lower Repair Bandwidth of Piggybacking Codes via Jointly Design for Both Data and Parity Nodes,” in 2023 IEEE Global Communications Conference: Selected Areas in Communications: Cloud/edge Computing, Networking, and Data Storage (Globecom2023 SAC CLOUD), Kuala Lumpur, Malaysia, December 2023, p. 6.
  18. ——, “Toward Lower Repair Bandwidth and Optimal Repair Complexity of Piggybacking Codes with Small Sub-packetization,” IEEE Transactions on Communications, pp. 1–1, 2024.
  19. H. Shi, Z. Jiang, Z. Huang, B. Bai, G. Zhang, and H. Hou, “Piggybacking+ Codes: MDS Array Codes with Linear Sub-Packetization to Achieve Lower Repair Bandwidth,” in 2023 IEEE Global Communications Conference: Selected Areas in Communications: Cloud/edge Computing, Networking, and Data Storage (Globecom2023 SAC CLOUD), Kuala Lumpur, Malaysia, December 2023, p. 6.
  20. K. Kralevska, D. Gligoroski, R. E. Jensen, and H. Øverby, “HashTag Erasure Codes: From Theory to Practice,” IEEE Transactions on Big Data, vol. 4, no. 4, pp. 516–529, 2018.
  21. J. Li, X. Tang, and C. Tian, “A Generic Transformation for Optimal Repair Bandwidth and Rebuilding Access in MDS Codes,” in 2017 IEEE International Symposium on Information Theory (ISIT), 2017, pp. 1623–1627.
  22. K. Wang and Z. Zhang, “Bidirectional Piggybacking Design for All Nodes With Sub-Packetization 2 < l < r,” IEEE Transactions on Communications, vol. 71, no. 12, pp. 6859–6869, 2023.
  23. ——, “Bidirectional Piggybacking Design for All Nodes with Sub-Packetization l = r,” in 2023 IEEE Information Theory Workshop (ITW), 2023, pp. 305–310.
  24. N. ALON, “Combinatorial Nullstellensatz,” Combinatorics, Probability and Computing, vol. 8, no. 1-2, p. 7–29, 1999.
  25. J. Li, X. Tang, and C. Tian, “A Generic Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems,” IEEE Transactions on Information Theory, vol. 64, no. 9, pp. 6257–6267, 2018.
  26. G. K. Agarwal, B. Sasidharan, and P. Vijay Kumar, “An Alternate Construction of An Access-optimal Regenerating Code with Optimal Sub-packetization Level,” in 2015 Twenty First National Conference on Communications (NCC), 2015, pp. 1–6.
  27. H. Hou, P. P. C. Lee, and Y. S. Han, “Multi-Layer Transformed MDS Codes with Optimal Repair Access and Low Sub-Packetization,” 2019.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets