Systems and methods for detecting bit rot in distributed storage devices having failure domains
The disclosed computer-implemented method for detecting bit rot in distributed storage devices having failure domains may include (1) receiving, at a computing device, a combination of data chunks created by adding, for each failure domain storing data chunks, data chunks from different stripes, (2) receiving a combination of parity chunks created by adding, for each failure domain storing parity chunks, parity chunks from the different stripes, (3) creating at least one new parity chunk from the combination of data chunks, and (4) identifying a presence of bit rot in the failure domains when the at least one new parity chunk does not match the combination of parity chunks. Various other methods, systems, and computer-readable media are also disclosed.
1. A computer-implemented method for detecting bit rot in distributed storage devices having failure domains, at least a portion of the method being performed by a computing device comprising at least one processor, the method comprising:
receiving, at the computing device, sums of data chunks, wherein:
each sum of data chunks in the sums of data chunks is created by adding, for each respective failure domain storing data chunks, one data chunk from each different stripe in a plurality of stripes; and
only one sum of data chunks is received for each respective failure domain storing data chunks;
receiving sums of parity chunks, wherein:
each sum of parity chunks in the sums of parity chunks is created by adding, for each respective failure domain storing parity chunks, one parity chunk from each different stripe in the plurality of stripes; and
only one sum of parity chunks is received for each respective failure domain storing parity chunks;
creating at least one new parity chunk from the sums of data chunks; and
identifying a presence of bit rot in the failure domains when the at least one new parity chunk does not match any of the received sums of parity chunks.
2. The computer-implemented method of claim 1 , further comprising:
sending a command to the failure domains storing data chunks to create the sums of data chunks.
3. The computer-implemented method of claim 1 , further comprising:
sending a command to the failure domains storing parity chunks to create the sums of parity chunks.
4. The computer-implemented method of claim 1 , wherein creating at least one new parity chunk further includes multiplying each sum of data chunks by a respective weight and adding the resultant products.
5. The computer-implemented method of claim 1 , further comprising:
rewriting, when bit rot is identified, at least one data chunk to a respective failure domain in which the bit rot is identified in a respective distributed storage device.
6. The computer-implemented method of claim 1 , further comprising:
rewriting, when bit rot is identified, at least one parity chunk to a respective failure domain storing a parity chunk corresponding to at least one data chunk in which the bit rot is identified in a respective distributed storage device.
7. The computer-implemented method of claim 1 , further comprising:
identifying, in response to identifying the bit rot, a potential security risk associated with the distributed storage devices; and
performing, in response to identifying the potential security risk, a security action in an attempt to ameliorate the potential security risk.
8. The computer-implemented method of claim 1 , wherein the receiving the sums of parity chunks further comprises receiving one sum of parity chunks per distributed storage device.
9. A system for detecting bit rot in distributed storage devices having failure domains, the system comprising:
a first receiving module, stored in a memory, that receives sums of data chunks, wherein:
each sum of data chunks in the sums of data chunks is created by adding, for each respective failure domain storing data chunks, one data chunk from each different stripe in a plurality of stripes; and
only one sum of data chunks is received for each respective failure domain storing data chunks;
a second receiving module, stored in the memory, that receives sums of parity chunks, wherein:
each sum of parity chunks in the sums of parity chunks is created by adding, for each respective failure domain storing parity chunks, one parity chunk from each different stripe in the plurality of stripes; and
only one sum of parity chunks is received for each respective failure domain storing parity chunks;
a creating module, stored in the memory, that creates at least one new parity chunk from the sums of data chunks;
an identifying module, stored in the memory, that identifies a presence of bit rot in the failure domains when the at least one new parity chunk does not match any of the received sums of parity chunks; and
at least one physical processor that executes the first receiving module, the second receiving module, the creating module, and the identifying module.
10. The system of claim 9 , further comprising:
a sending module, stored in the memory, that sends a command to the failure domains storing data chunks to create the sums of data chunks.
11. The system of claim 9 , further comprising:
a sending module, stored in the memory, that sends a command to the failure domains storing parity chunks to create the sums of parity chunks.
12. The system of claim 9 , wherein creating at least one new parity chunk further includes multiplying each sum of data chunks by a respective weight and adding the resultant products.
13. The system of claim 9 , further comprising:
a rewriting module, stored in the memory, that rewrites, when bit rot is identified, at least one data chunk to a respective failure domain in which the bit rot is identified in a respective distributed storage device.
14. The system of claim 9 , further comprising:
a rewriting module, stored in the memory, that rewrites, when bit rot is identified, at least one parity chunk to a respective failure domain storing a parity chunk corresponding to at least one data chunk in which the bit rot is identified in a respective distributed storage device.
15. The system of claim 9 , further comprising:
an identifying module, stored in the memory, that identifies, in response to identifying the bit rot, a potential security risk associated with the distributed storage devices; and
a performing module, stored in the memory, that performs, in response to identifying the potential security risk, a security action in an attempt to ameliorate the potential security risk.
16. A non-transitory computer-readable medium comprising one or more computer-executable instructions that, when executed by at least one processor of a computing device, cause the computing device to:
receive, at the computing device, sums of data chunks, wherein:
each sum of data chunks in the sums of data chunks is created by adding, for each respective failure domain storing data chunks, one data chunk from each different stripe in a plurality of stripes; and
only one sum of data chunks is received for each respective failure domain storing data chunks;
receive sums of parity chunks, wherein:
each sum of parity chunks in the sums of parity chunks is created by adding, for each respective failure domain storing parity chunks, one parity chunk from each different stripe in the plurality of stripes; and
only one sum of parity chunks is received for each respective failure domain storing parity chunks;
create at least one new parity chunk from the sums of data chunks; and
identify a presence of bit rot in the failure domains when the at least one new parity chunk does not match any of the received sums of parity chunks.
17. The non-transitory computer-readable medium of claim 16 , wherein the computer-executable instructions comprise computer-executable instructions that cause the computing device to:
send a command to the failure domains storing data chunks to create the sums of data chunks.
18. The non-transitory computer-readable medium of claim 16 , wherein the computer-executable instructions comprise computer-executable instructions that cause the computing device to:
send a command to the failure domains storing parity chunks to create the sums of parity chunks.
19. The non-transitory computer-readable medium of claim 16 , wherein creating at least one new parity chunk further comprises multiplying each sum of data chunks by a respective weight and adding the resultant products.
20. The non-transitory computer-readable medium of claim 16 , wherein the computer-executable instructions comprise computer-executable instructions that cause the computing device to:
rewrite, when bit rot is identified, at least one data chunk to a respective failure domain in which the bit rot is identified in a respective distributed storage device.
21. The non-transitory computer-readable medium of claim 16 , wherein the computer-executable instructions comprise computer-executable instructions that cause the computing device to:
rewrite, when bit rot is identified, at least one parity chunk to a respective failure domain storing a parity chunk corresponding to at least one data chunk in which the bit rot is identified in a respective distributed storage device.