Product Matrix MSR Codes with Bandwidth Adaptive Exact Repair
Kaveh Mahdaviani, Soheil Mohajer, Ashish Khisti

TL;DR
This paper introduces a new class of MSR codes within the Product Matrix framework that adaptively optimize repair bandwidth across multiple helper node configurations, enhancing efficiency in dynamic distributed storage systems.
Contribution
It proposes bandwidth adaptive MSR codes that support multiple helper node counts, generalizing existing PM MSR codes for improved flexibility and efficiency.
Findings
Supports multiple helper configurations with optimal repair bandwidth.
Generalizes existing PM MSR codes to be bandwidth adaptive.
Enhances repair efficiency in dynamic distributed storage environments.
Abstract
In a distributed storage systems (DSS) with systematic nodes, robustness against node failure is commonly provided by storing redundancy in a number of other nodes and performing repair mechanism to reproduce the content of the failed nodes. Efficiency is then achieved by minimizing the storage overhead and the amount of data transmission required for data reconstruction and repair, provided by coding solutions such as regenerating codes [1]. Common explicit regenerating code constructions enable efficient repair through accessing a predefined number, , of arbitrary chosen available nodes, namely helpers. In practice, however, the state of the system dynamically changes based on the request load, the link traffic, etc., and the parameters which optimize system's performance vary accordingly. It is then desirable to have coding schemes which are able to operate optimally under a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Distributed systems and fault tolerance · Caching and Content Delivery
