logos-storage/logos-storage-research
1
0
Fork 0
mirror of https://github.com/logos-storage/logos-storage-research.git synced 2026-01-09 00:43:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

Typo fix on papers/Peer-to-Peer_Storage_System_a_Practical_Guideline_to_be_lazy/README.md

Browse Source 
Co-authored-by: Dmitriy Ryajov <dryajov@gmail.com>
This commit is contained in:
Leo 2022-05-26 18:30:44 +02:00 committed by GitHub
parent bd62e46c46
commit 8b2b82533d
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
papers/Peer-to-Peer_Storage_System_a_Practical_Guideline_to_be_lazy/README.md
View File

@ -18,7 +18,7 @@ The paper presents the different trade-offs for implementing erasure code recons
* Every reconstruction implies data traffic over the network
* If we reconstruct after every single block loss (eager repair), we consume too much bandwidth
* If we wait for several blocks to be lost (Lazy repair), we can reconstruct the missing block just one time and safe bandwidth
* If we wait for several blocks to be lost (Lazy repair), we can reconstruct the missing block just one time and save bandwidth
* If we wait too long before reconstruction, data might be lost if multiple erasures occur simultaneously
* A model can help us understand the impact of the parameters s, r and r0 on bandwidth and loss rate
* The distribution of blocks redundancy is a bit counter-intuitive