CN113886115B - Block chain Bayesian fault tolerance method and system based on vehicle-road cooperation - Google Patents
Block chain Bayesian fault tolerance method and system based on vehicle-road cooperation Download PDFInfo
- Publication number
- CN113886115B CN113886115B CN202111055051.0A CN202111055051A CN113886115B CN 113886115 B CN113886115 B CN 113886115B CN 202111055051 A CN202111055051 A CN 202111055051A CN 113886115 B CN113886115 B CN 113886115B
- Authority
- CN
- China
- Prior art keywords
- block
- chain
- blocks
- hot
- erasure code
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 18
- 230000007246 mechanism Effects 0.000 claims abstract description 29
- 238000011084 recovery Methods 0.000 claims abstract description 12
- 238000004364 calculation method Methods 0.000 claims description 2
- 230000006399 behavior Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000004931 aggregating effect Effects 0.000 description 1
- 239000008358 core component Substances 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0706—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment
- G06F11/0727—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment in a storage system, e.g. in a DASD or network based storage system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0793—Remedial or corrective actions
Abstract
The invention relates to a block chain Bayesian busy-court fault-tolerant method based on vehicle-road cooperation, which comprises the following steps: step 1: storing newly generated road data based on the alliance chain, and obtaining a newly generated block; step 2: acquiring the access frequency of the newly generated block stored based on the full-copy policy; step 3: evaluating the access frequency of each block when the blocks are stored based on a full copy strategy, and dividing the blocks into a hot block and a cold block; step 4: the hot zone block and the cold zone block are stored based on two different storage mechanisms so as to realize the Bayesian fault tolerance and reduce the network overhead and the time delay during recovery.
Description
Technical Field
The invention relates to the technical field of blockchain storage, in particular to a blockchain Bayesian fault tolerance method and system based on vehicle-road cooperation.
Background
For members of a specific group and limited third parties, a plurality of preselected nodes are designated as billing people, data can be stored through a coalition chain and consensus among the nodes is achieved, in a cloud-side-end cooperative distributed environment of vehicle road cooperation, the nodes in the distributed environment can store vehicle road data through the coalition chain, in the coalition chain, a typical problem is the problem of Bayesian fault tolerance, namely the nodes in the distributed system are possibly malicious nodes, malicious behaviors of the malicious nodes possibly damage the consensus of the nodes in the system on the data, an algorithm is designed to prevent the malicious behaviors of the malicious nodes from damaging the consensus of the benign nodes in the system, namely the Bayesian fault tolerance, the coalition chain is usually based on a practical Bayesian fault tolerance algorithm to realize the Bayesian fault tolerance, the practical bayer fault-tolerant algorithm guarantees low bandwidth overhead while providing high reliability, and the practical bayer fault-tolerant algorithm stores data based on a full-copy policy, which means that each block in the federation chain is held by all nodes in the system, so that each node in the federation chain needs to store all data, which is a not insignificant challenge for single node storage overhead, and in addition, since the federation chain needs to support dynamic addition and exit of nodes, when a new node enters the system, the node needs to hold all history blocks, so that it needs to obtain all history block data from other nodes in the system, and when the number of nodes in the system is high, the addition process of the new node causes huge network overhead.
The implementation schemes of the existing optimized alliance chain storage mechanism are totally divided into two types: the first category is to introduce the concept of light nodes, and the nodes only store important information such as block head and the like, but not store the whole block data; the second is to introduce the concept of a light network, which reduces the size of the block by aggregating multiple micro-transactions between two accounts, thus reducing node storage overhead, these existing methods of optimizing the federated chain storage mechanism cannot be applied to the complex scenario of the bayer fault tolerance, and these technologies are mostly from the perspective of optimizing the size of a single block, and not from the perspective of optimizing the full-copy storage mechanism, the storage overhead of a single block of these technologies is still O (n).
The road data can be stored through the alliance chain, and higher reliability is realized on the basis of realizing tamper resistance. In a cloud-side-end cooperative distributed environment, the total number of nodes contained in a system is huge in scale, such as a large number of MEC end devices, cloud servers and the like, and the nodes are possibly attacked by malicious behaviors of malicious nodes besides facing storage device faults, so that the Bayesian fault tolerance is realized, a practical Bayesian fault tolerance algorithm is generally used in a alliance chain, the algorithm stores data based on a full-scale codebook strategy, the node storage cost in the system is overlarge, and the problem that the Bayesian fault tolerance is realized through erasure code storage blocks and the single-node storage cost is reduced is solved.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provide a block chain Bayesian fault tolerance method and system based on vehicle-road cooperation.
The aim of the invention can be achieved by the following technical scheme:
a block chain Bayesian and busy-court fault-tolerant method based on vehicle-road cooperation comprises the following steps:
step 1: storing newly generated road data based on the alliance chain, and obtaining a newly generated block;
step 2: acquiring the access frequency of the newly generated block stored based on the full-copy policy;
step 3: evaluating the access frequency of each block when the blocks are stored based on a full copy strategy, and dividing the blocks into a hot block and a cold block;
step 4: and the hot area block and the cold area block are respectively stored by adopting different storage mechanisms so as to realize the Bayesian fault tolerance and reduce the network overhead and the time delay during recovery.
In the step 3, the dividing basis is specifically as follows:
the access frequencies of all the blocks are ordered, the blocks with the access frequency at the first twenty percent are defined as hot blocks, and the rest blocks are defined as cold blocks.
The hot zone block and the cold zone block are mutually converted along with the change of the access frequency, and specifically:
the hot zone blocks are converted into cold zone blocks along with the decrease of the access frequency, and the cold zone blocks are converted into hot zone blocks along with the increase of the access frequency.
In the step 4, the hot zone block is stored based on a long-chain erasure code combined short-chain erasure code storage mechanism, and the cold zone block is stored based on a long-chain erasure code storage mechanism.
The storage cost of the long-chain erasure code combined short-chain erasure code storage mechanism is small relative to that of the short-chain erasure code storage mechanism, and the reading time delay of the short-chain erasure code storage mechanism is small relative to that of the long-chain erasure code combined short-chain erasure code storage mechanism.
The storage and recovery process of the long-chain erasure code storage mechanism specifically comprises the following steps:
step 401: setting the total number of nodes of the alliance chain system as n, the number of Bayesian nodes as f, and encoding an original block based on an RS (n-2 f,2 f) erasure code;
step 402: when n-2f blocks are newly generated, taking the newly generated n-2f blocks as data blocks, and generating 2f check blocks based on RS (n-2 f,2 f) erasure codes;
step 403: storing n-2f blocks and 2f check blocks to n nodes of the system, namely storing one block in each node respectively;
step 404: when a block requested by one node comes from a failed node or the block is tampered by a malicious node, recovering the block through a long-chain erasure code, broadcasting the block in a alliance chain system by the node, and sending the stored block to the node by other nodes of the system;
step 405: and recovering the original block of the node through the decoding operation of the RS erasure code, thereby realizing the Bayesian fault tolerance.
The total number of the nodes and the number of the Bayesian nodes meet the following conditions:
n≥3f+1。
in the step 404, the decoding operation of the RS erasure code specifically includes:
generating m parts of check data based on n parts of original data, and restoring the original data through any n parts of data in n+m parts of data, namely restoring the original data through RS codes based on the rest of data which are not disabled when any m parts of data are disabled.
The storage and recovery process of the short-chain erasure code storage mechanism specifically comprises the following steps:
step 411: dividing all nodes in the alliance chain system into a plurality of groups;
step 412: the hot area block is encoded to generate corresponding check blocks, and the hot area blocks stored through short-chain erasure codes and the corresponding check blocks are stored on nodes of each group;
step 413: when the hot area block is from a fault node or tampered by a malicious node, recovering the hot area block from the group where the hot area block is located, ending the recovery process if the correct block can be recovered, otherwise, recovering through long-chain erasure codes.
A system for a blockchain bayer occupational fault tolerance method based on vehicle-road coordination, the system comprising:
the block generation module: the new generation block is used for recording newly generated road data;
an access frequency calculation module: the access frequency used for obtaining each block and storing based on the full copy strategy;
and the cold and hot block dividing module is used for: the method comprises the steps of dividing a block into a hot block and a cold block according to the obtained access frequency, and mutually converting the hot block and the cold block along with the change of the access frequency;
and a storage strategy module: for providing different storage mechanisms for the cold block and the hot block.
Compared with the prior art, the invention has the following advantages:
the invention can apply erasure codes to a complex scene of Bayesian fault tolerance based on vehicle-road cooperation, and researches the problem from the perspective of optimizing the storage of a alliance chain.
Drawings
FIG. 1 is a schematic flow chart of the present invention.
FIG. 2 is a diagram of an example federated chain storage.
Detailed Description
The invention will now be described in detail with reference to the drawings and specific examples. It will be apparent that the described embodiments are some, but not all, embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.
Examples
As shown in fig. 1, the invention provides a block chain Bayesian fault tolerance method based on vehicle-road cooperation, after vehicle-road data is generated, firstly, based on alliance chain storage data, newly generated vehicle-road data is recorded through a newly generated block, firstly, the newly generated block is stored based on a full copy strategy, a system evaluates the access frequency (cold and hot block division) when the block is stored based on the full copy strategy, the block with high access frequency is a hot block, the block with low access frequency is a cold block, then, the hot block and the cold block are stored based on two different erasure code coding schemes, namely, two different storage mechanisms, the hot block is stored based on a long-chain erasure code combined short-chain erasure code storage mechanism, so as to realize Bayesian fault tolerance and reduce network overhead and delay when recovering, and the cold block is stored based on the long-chain erasure code storage mechanism, so as to realize the Bayesian fault tolerance and not based on short-chain erasure code storage.
In the distributed system, node failure and storage device failure are very frequent, and in addition, since the blockchain system is a decentralised system, malicious nodes may tamper with a block, and when a block requested by a certain node comes from a failed node or the block is tampered with by a malicious node, the node needs to restore the original block.
The storage block based on the long-chain erasure code storage mechanism is a core component for realizing the Bayesian fault tolerance, specifically, the total number of nodes of a alliance chain system is set to be n, the number of Bayesian nodes is set to be f, the original blocks are encoded based on RS (n-2 f,2 f) erasure codes, when n-2f blocks are newly generated, the newly generated n-2f blocks are used as data blocks, 2f check blocks are generated based on RS (n-2 f,2 f) erasure codes, the n-2f blocks and the 2f check blocks are stored to n nodes of the system, namely, each node respectively stores one block, when a block requested by one node comes from a failed node or the block is tampered by a malicious node, the node is broadcasted in the system, other nodes in the system transmit the respectively stored blocks to the node, and because the number of the Bayesian nodes in the system is f, the node can receive the blocks from the other nodes more than or equal to n-2f under the asynchronous network environment, so that the error correction can be correctly decoded by the blocks of the RS, so that the error tolerance can be recovered.
The invention stores the thermal storage block based on the long-chain erasure code combined with the short-chain erasure code storage mechanism to store the thermal storage block on the basis of realizing the Bayesian fault tolerance, and reduces the network bandwidth required by the block recovery to accelerate the block recovery, in particular, the invention divides the nodes in the alliance chain system into a plurality of groups, stores the thermal storage block through the short-chain erasure code, stores the thermal block and the generated corresponding check blocks in the groups, recovers the thermal block when the node fault or the thermal block is tampered with a malicious node, and recovers the thermal block from the group corresponding to the thermal block, if the correct block can be recovered, the recovery process is ended, otherwise, the block is recovered through the long-chain erasure code.
As shown in fig. 2, in the example of the alliance chain storage, the alliance chain system includes 7 nodes, 2 nodes are B-occupied nodes, the number of nodes in the group is 5, the hot blocks are stored based on RS (2, 3) and RS (3, 4), the cold blocks are stored based on RS (3, 4), at this time, the blocks stored based on erasure codes in the alliance chain have three blocks B1, B2 and B3, wherein B1 and B3 are hot blocks, B2 is a cold block, in order to realize the B-occupied fault tolerance, the blocks B1, B2 and B3 are firstly encoded based on RS (3, 4) erasure codes, four check blocks P1, P2, P3 and P4 are generated, then B1, B2, B3, P1, P2, P3 and P4 are stored on 7 nodes in the system, in order to reduce the network overhead recovered by the hot blocks, the groups are formed by nodes N0, N1, N2, N3 and N4, and the groups are stored based on RS (2, 3) erasure codes, so that the five blocks B1 ', P3' and P1', P1' are generated on the five blocks.
While the invention has been described with reference to certain preferred embodiments, it will be understood by those skilled in the art that various changes and substitutions may be made without departing from the spirit and scope of the invention as defined by the appended claims. Therefore, the protection scope of the invention is subject to the protection scope of the claims.
Claims (6)
1. A block chain Bayesian and busy-court fault-tolerant method based on vehicle-road cooperation is characterized by comprising the following steps:
step 1: storing newly generated road data based on the alliance chain, and obtaining a newly generated block;
step 2: acquiring the access frequency of the newly generated block stored based on the full-copy policy;
step 3: evaluating the access frequency of each block when the blocks are stored based on a full copy strategy, and dividing the blocks into a hot block and a cold block;
step 4: different storage mechanisms are respectively adopted for the hot zone block and the cold zone block for storage so as to realize the Bayesian fault tolerance and reduce the network overhead and the time delay during recovery;
in the step 4, the hot zone block is stored based on a long-chain erasure code combined short-chain erasure code storage mechanism, and the cold zone block is stored based on a long-chain erasure code storage mechanism;
the storage cost of the long-chain erasure code combined short-chain erasure code storage mechanism is small relative to that of the short-chain erasure code storage mechanism, and the reading time delay of the short-chain erasure code storage mechanism is small relative to that of the long-chain erasure code combined short-chain erasure code storage mechanism;
the storage and recovery process of the long-chain erasure code storage mechanism specifically comprises the following steps:
step 401: setting the total number of nodes of the alliance chain system as n, the number of Bayesian nodes as f, and encoding an original block based on an RS (n-2 f,2 f) erasure code;
step 402: when n-2f blocks are newly generated, taking the newly generated n-2f blocks as data blocks, and generating 2f check blocks based on RS (n-2 f,2 f) erasure codes;
step 403: storing n-2f blocks and 2f check blocks to n nodes of the system, namely storing one block in each node respectively;
step 404: when a block requested by one node comes from a failed node or the block is tampered by a malicious node, recovering the block through a long-chain erasure code, broadcasting the block in a alliance chain system by the node, and sending the stored block to the node by other nodes of the system;
step 405: recovering the original block of the node through the decoding operation of the RS erasure code, so as to realize the Bayesian fault tolerance;
the storage and recovery process of the short-chain erasure code storage mechanism specifically comprises the following steps:
step 411: dividing all nodes in the alliance chain system into a plurality of groups;
step 412: performing hot area block coding to generate corresponding check blocks, and storing the hot areas stored by short-chain erasure codes and the corresponding check blocks on nodes of each group;
step 413: when the hot area block is from a fault node or tampered by a malicious node, recovering the hot area block from the group where the hot area block is located, ending the recovery process if the correct block can be recovered, otherwise, recovering through long-chain erasure codes.
2. The block chain bayer busy-ting fault-tolerant method based on vehicle-road cooperation according to claim 1, wherein in the step 3, the dividing basis is specifically as follows:
the access frequencies of all the blocks are ordered, the blocks with the access frequency at the first twenty percent are defined as hot blocks, and the rest blocks are defined as cold blocks.
3. The block chain bayer busy fault-tolerant method based on the vehicle-road cooperation according to claim 2, wherein the hot block and the cold block are mutually converted along with the access frequency change, specifically:
the hot zone blocks are converted into cold zone blocks along with the decrease of the access frequency, and the cold zone blocks are converted into hot zone blocks along with the increase of the access frequency.
4. The blockchain bayer and horribute fault-tolerant method based on vehicle-road cooperation according to claim 1, wherein the total number of nodes and the number of the bayer and horribute nodes meet the following conditions:
n≥3f+1。
5. the block chain bayer busy-tolerant method according to claim 4, wherein in step 404, the RS erasure code decoding operation is specifically:
generating m parts of check data based on n parts of original data, and restoring the original data through any n parts of data in n+m parts of data, namely restoring the original data through RS codes based on the rest of data which are not disabled when any m parts of data are disabled.
6. A system for implementing the blockchain bayer busy-court fault-tolerance method according to any one of claims 1 to 5, wherein the system comprises:
the block generation module: the new generation block is used for recording newly generated road data;
an access frequency calculation module: the access frequency used for obtaining each block and storing based on the full copy strategy;
and the cold and hot block dividing module is used for: the method comprises the steps of dividing a block into a hot block and a cold block according to the obtained access frequency, and mutually converting the hot block and the cold block along with the change of the access frequency;
and a storage strategy module: for providing different storage mechanisms for the cold block and the hot block.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111055051.0A CN113886115B (en) | 2021-09-09 | 2021-09-09 | Block chain Bayesian fault tolerance method and system based on vehicle-road cooperation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111055051.0A CN113886115B (en) | 2021-09-09 | 2021-09-09 | Block chain Bayesian fault tolerance method and system based on vehicle-road cooperation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113886115A CN113886115A (en) | 2022-01-04 |
| CN113886115B true CN113886115B (en) | 2024-02-20 |
Family
ID=79008886
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111055051.0A Active CN113886115B (en) | 2021-09-09 | 2021-09-09 | Block chain Bayesian fault tolerance method and system based on vehicle-road cooperation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113886115B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116663068B (en) * | 2023-07-31 | 2023-12-29 | 腾讯科技（深圳）有限公司 | Alliance chain archiving method, related device and medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103118133A (en) * | 2013-02-28 | 2013-05-22 | 浙江大学 | Mixed cloud storage method based on file access frequency |
| CN105956128A (en) * | 2016-05-09 | 2016-09-21 | 南京大学 | Self-adaptive encoding storage fault-tolerant method based on simple regenerating code |
| CN106529951A (en) * | 2016-12-30 | 2017-03-22 | 杭州云象网络技术有限公司 | Node consensus verification method under league chain network through asynchronous mode |
| CN107797884A (en) * | 2016-10-28 | 2018-03-13 | 湖南大学 | A kind of cloud storage fault-tolerance approach adaptively switched based on duplication and correcting and eleting codes |
| CN108512908A (en) * | 2018-03-13 | 2018-09-07 | 山东超越数控电子股份有限公司 | A kind of cloud storage fault tolerant mechanism based on Ceph and the web-based management platform based on Ceph |
| WO2019228550A2 (en) * | 2019-08-20 | 2019-12-05 | Alibaba Group Holding Limited | Blockchain data storage based on shared nodes and error correction code |
| WO2020042792A1 (en) * | 2018-08-31 | 2020-03-05 | 阿里巴巴集团控股有限公司 | Blockchain-based transaction consensus processing method and apparatus, and electronic device |
| CN111008181A (en) * | 2019-10-31 | 2020-04-14 | 苏州浪潮智能科技有限公司 | Method, system, terminal and storage medium for switching storage strategies of distributed file system |
| CN112130772A (en) * | 2020-09-29 | 2020-12-25 | 合肥城市云数据中心股份有限公司 | Block chain safe storage method based on sparse random erasure code technology |
| CN112416941A (en) * | 2020-11-30 | 2021-02-26 | 肖玉连 | Block chain-based rapid data retrieval method and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9595979B2 (en) * | 2015-01-20 | 2017-03-14 | International Business Machines Corporation | Multiple erasure codes for distributed storage |
-
2021
- 2021-09-09 CN CN202111055051.0A patent/CN113886115B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103118133A (en) * | 2013-02-28 | 2013-05-22 | 浙江大学 | Mixed cloud storage method based on file access frequency |
| CN105956128A (en) * | 2016-05-09 | 2016-09-21 | 南京大学 | Self-adaptive encoding storage fault-tolerant method based on simple regenerating code |
| CN107797884A (en) * | 2016-10-28 | 2018-03-13 | 湖南大学 | A kind of cloud storage fault-tolerance approach adaptively switched based on duplication and correcting and eleting codes |
| CN106529951A (en) * | 2016-12-30 | 2017-03-22 | 杭州云象网络技术有限公司 | Node consensus verification method under league chain network through asynchronous mode |
| CN108512908A (en) * | 2018-03-13 | 2018-09-07 | 山东超越数控电子股份有限公司 | A kind of cloud storage fault tolerant mechanism based on Ceph and the web-based management platform based on Ceph |
| WO2020042792A1 (en) * | 2018-08-31 | 2020-03-05 | 阿里巴巴集团控股有限公司 | Blockchain-based transaction consensus processing method and apparatus, and electronic device |
| WO2019228550A2 (en) * | 2019-08-20 | 2019-12-05 | Alibaba Group Holding Limited | Blockchain data storage based on shared nodes and error correction code |
| CN111008181A (en) * | 2019-10-31 | 2020-04-14 | 苏州浪潮智能科技有限公司 | Method, system, terminal and storage medium for switching storage strategies of distributed file system |
| CN112130772A (en) * | 2020-09-29 | 2020-12-25 | 合肥城市云数据中心股份有限公司 | Block chain safe storage method based on sparse random erasure code technology |
| CN112416941A (en) * | 2020-11-30 | 2021-02-26 | 肖玉连 | Block chain-based rapid data retrieval method and system |
Non-Patent Citations (1)
| Title |
|---|
| 分布式块存储系统中高效纠删码重构技术研究;陈付;张淑萍;;软件导刊(第07期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113886115A (en) | 2022-01-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109359223A (en) | The block chain account book distributed storage technology realized based on correcting and eleting codes | |
| US9722637B2 (en) | Construction of MBR (minimum bandwidth regenerating) codes and a method to repair the storage nodes | |
| US9647698B2 (en) | Method for encoding MSR (minimum-storage regenerating) codes and repairing storage nodes | |
| CN111149093B (en) | Data encoding, decoding and repairing method of distributed storage system | |
| CN103944981B (en) | Cloud storage system and implement method based on erasure code technological improvement | |
| US20160006461A1 (en) | Method and device for implementation data redundancy | |
| CN110022216B (en) | Efficient asynchronous Byzantine consensus method with low communication complexity and network communication platform | |
| CN106708653B (en) | Mixed tax big data security protection method based on erasure code and multiple copies | |
| CN109814807B (en) | Data storage method and device | |
| CN105956128B (en) | A kind of adaptive coding storage fault-tolerance approach based on simple regeneration code | |
| CN103916483A (en) | Self-adaptation data storage and reconstruction method for coding redundancy storage system | |
| US20120173925A1 (en) | Method and a storage server for data redundancy | |
| CN113886115B (en) | Block chain Bayesian fault tolerance method and system based on vehicle-road cooperation | |
| CN108762978B (en) | Grouping construction method of local part repeated cyclic code | |
| CN109194444A (en) | A kind of balanced binary tree restorative procedure based on network topology | |
| KR101621752B1 (en) | Distributed Storage Apparatus using Locally Repairable Fractional Repetition Codes and Method thereof | |
| US7770065B2 (en) | File data restoring system and method of computer operating system and software thereof | |
| CN106027638A (en) | Hadoop data distribution method based on hybrid coding | |
| CN114237971A (en) | Erasure code coding layout method and system based on distributed storage system | |
| CN109947587B (en) | Grouping repair code construction method for non-uniform fault protection and fault repair method | |
| CN116955355A (en) | Block data processing method and device and electronic equipment | |
| CN111224747A (en) | Coding method capable of reducing repair bandwidth and disk reading overhead and repair method thereof | |
| CN108628697B (en) | Binary-based node repairing method and system | |
| CN110309012B (en) | Data processing method and device | |
| CN106911793B (en) | I/O optimized distributed storage data repair method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |