Local data updating method based on erasure code cluster storage system

Abstract

The invention discloses a local data updating method based on an erasure code cluster storage system, which comprises the following steps: receiving a data D0 updating request sent by a user; updating a data D0 into a data D0'; sending the data D0' to a data node to be updated; reading the data D0' from a local disc to a memory by the data node to be updated; calculating a provisional data block set needed by m redundant nodes in the memory of the data node to be updated; writing the data D0' into the local disc by the data node to be updated; sending m provisional data blocks onto the m redundant nodes by the data node to be updated through the network at the same time; reading an original redundant data Pj by the j redundant node from the local disc, and calculating to obtain a new check data Pj'; and writing the check data block Pj' obtained through calculating into the local disc by the redundant node. Due to the adoption of the local data updating method based on the erasure code cluster storage system, the consumption of the bandwidth can be reduced effectively, the load pressure of the update server can be decreased, and the data updating performance can be improved.

Description

technical field [0001] The invention belongs to the field of data storage, and more specifically relates to a partial data update method based on an erasure code cluster storage system. Background technique [0002] In recent years, multicast transmission has become an important component of the Internet. When large-scale software is transmitted to many users through the Internet, multicast or broadcast transmission is required. These transports must be completely reliable, while having low network overhead and supporting random access by a large number of various users. To achieve this goal, a coding method is needed, that is, to encode the transmitted k-bit original data into n (n>k)-bit data and send it out. If the receiver receives enough data, it will use appropriate The decoding method can restore the source data of k bits, and this code is called a forward error correction code, or an erasure correction code. [0003] It is precisely because of the high fault tol...

AI Technical Summary

Problems solved by technology

[0004] However, the existing erasure code cluster storage system has the following problems: the strategy for data update is only managed by a simple update manager, and the consumed network bandwidth and time-consuming data update are not sufficiently optimized; in addition , due to the encoding characteristics of erasure codes, when there is data update, in addition to affecting the update of its own data nodes, all check nodes must also be updated. If the traditional update method is used, that is, read data on the client and calculate the new The data is written back, and frequent network transmission is required, which makes the update of the data largely affected by the network bandwidth, which also affects the response time and bandwidth loss of the entire system.

Images