Visible to the public On Some Universally Good Fractional Repetition Codes

TitleOn Some Universally Good Fractional Repetition Codes
Publication TypeConference Paper
Year of Publication2020
AuthorsPrajapati, S. A., Deb, S., Gupta, M. K.
Conference Name2020 International Conference on COMmunication Systems NETworkS (COMSNETS)
Keywordscoding theory, compositionality, computer network reliability, computer network security, cryptography, data storage, Data storage systems, distributed storage systems, encoded packet replication, heterogeneous DSS, Metrics, minimum distance bound, multidimensional optimization problem, network coding, Network security, network theory (graphs), optimisation, Optimization, partial regular graph, pubcrawl, resilience, Resiliency, security, storage management, storage overhead, universally good Fractional Repetition codes
AbstractData storage in Distributed Storage Systems (DSS) is a multidimensional optimization problem. Using network coding, one wants to provide reliability, scalability, security, reduced storage overhead, reduced bandwidth for repair and minimal disk I/O in such systems. Advances in the construction of optimal Fractional Repetition (FR) codes, a smart replication of encoded packets on n nodes which also provides optimized disk I/O and where a node failure can be repaired by contacting some specific set of nodes in the system, is in high demand. An attempt towards the construction of universally good FR codes using three different approaches is addressed in this work. In this paper, we present that the code constructed using the partial regular graph for heterogeneous DSS, where the number of packets on each node is different, is universally good. Further, we also encounter the list of parameters for which the ring construction and the T-construction results in universally good codes. In addition, we evaluate the FR code constructions meeting the minimum distance bound.
DOI10.1109/COMSNETS48256.2020.9027326
Citation Keyprajapati_universally_2020