Untitled

Abstract

The system for backing up the data is designed. Client software works on the computer of user, takes all the necessary files for backup, and turns them into Stream of bytes. Then breaks it into blocks (from 32 KB to 64KB) using a Rabin algorithm. It is based on hash ring that is absorbing every incoming byte if the current hash mask or equal to a certain reach 64KB, there is division committed. This approach helps to avoid is coping all data if the content of a file has changed in separately. For each data block client software calculates the http://www.webology.org/2019/v16n2/a188.pdf hash. Then sends parts even 256 times or more of those hashes to the server and checks if they already know the system. The blocks are not known, refers to the server. As part of the de-duplication, data on distribution and cloud distribution occurs on hashes, hashes are SHA-1, so that 20 bytes are given in hexadecimal format. First number or letter and will serve key distribution. So essentially, you can evenly distribute the data among the workers from 2 to 16 pieces. You need to take the second number of hash, and more commit distribution.