Fractional Repetition Codes Based on Petersen Graphs
In order to study the repair efficiency of distributed storage system,a fractional repetition code design based on Pe-tersen graph edge coloring is proposed.The design uses the edge coloring of Petersen graph to construct,that is,the coloring the edges of Petersen graph is dyed first,the different number of colored edges is marked,and then the links of different edge colors in Petersen graph is constructed.Finally,each link is regarded as a storage node of partial repeat code,which is called PECBFR code.Theoretical analysis points out that the PECBFR code can randomy access the system storage capacity in reach.In addi-tion,the experimental simulation results show that the proposed fractional repeat code construction algorithm based on Petersen graph edge coloring,compared with the reed-solomon codes and simple regenerative codes in distributed storage system,can quickly repair the faulty node when the system repairs the faulty node.Compared with common coding algorithms in distributed storage systems,the performance of repair locality,repair complexity and repair bandwidth overhead are greatly improved.