A binary-based node repair method and system

A node repair, binary technology, applied in the binary-based node repair method and system field, can solve the problem of low repair efficiency, achieve the effect of improving repair efficiency, reducing the amount of reading and downloading

Active Publication Date: 2021-05-04
SHENZHEN UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] The purpose of the present invention is to provide a binary-based node repair method and system, aiming to solve the technical problem of low repair efficiency

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A binary-based node repair method and system
  • A binary-based node repair method and system
  • A binary-based node repair method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0034] Such as Figure 1-2 As shown, the binary-based node repair method provided by the present invention is described in detail as follows:

[0035]Step S1, group system nodes with (n, k) codes on the piggyback coding framework and define system vectors and coding matrices; use zigzag decoding on the piggyback coding framework, thereby reducing decoding complexity and improving failure node Repair efficiency is an improvement to the node repair scheme proposed by K.V.Rashmi et al. The proposed (n, k) code has CP-BZD properties.

[0036] The (n, k) codes of the CP-BZD nature refer to codes that can be decoded in the binary domain, and it can tolerate failures of at most n-k nodes at the same time. Divide the original information s into k data packets with a length of L bits, expressed as The jth bit of is denoted as s i，j , and S i，j ∈ {0, 1}. According to the (n, k) code, these k data packets are encoded into n data packets (n>k), denoted as c 1 ,...,c n . Furtherm...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The present invention is applicable to the improvement field of distributed storage technology, and provides a binary-based node repair method. The node repair method includes the following steps: S1. Group the system nodes and group the (n, k) codes on the piggyback coding framework Define the system vector and encoding matrix; S2. Substitute the defined encoding matrix into the encoding structure to obtain the corresponding encoding method; S3. Repair the damaged nodes through zigzag decoding according to the encoding method. In the distributed storage system, according to its special encoding method, the designed code satisfies the (n, k) property; and in the process of node repair, it can effectively reduce the amount of data read and downloaded, thereby improving Repair efficiency.

Description

technical field [0001] The invention belongs to the field of improving distributed storage technology, and in particular relates to a binary-based node repair method and system. Background technique [0002] In a large-scale distributed storage system, we can store and analyze large-scale data. However, during daily operations, nodes in the system may experience various failures, such as data loss due to disk damage or disconnection. Therefore, it is particularly important to ensure the reliability and availability of nodes in the system. [0003] In traditional distributed storage systems, data storage often adopts a duplication strategy. That is, by replicating multiple copies of data and storing them on nodes in the system. When there is data damage and data recovery is required, it is only necessary to find the data stored in the corresponding node to recover. [0004] In recent years, relevant scholars have proposed a maximum distance separable code (MDS), which redu...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06F11/10H04L29/08
CPCG06F11/1076H04L67/1097
Inventor 代明军王霞王晖
Owner SHENZHEN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap