Please use this identifier to cite or link to this item:
Title: Comparative performance analysis of information dispersal methods
Authors: Deryabin, M. A.
Дерябин, М. А.
Chervyakov, N. I.
Червяков, Н. И.
Berezhnoy, V. V.
Бережной, В. В.
Djurabaev, A.
Джурабаев, А.
Nazarov, A. S.
Назаров, А. С.
Babenko, M. G.
Бабенко, М. Г.
Keywords: Data handling;Data transfer;Digital storage;Information analysis;Multiprocessing systems;Numbering systems;Data communication systems
Issue Date: 2019
Publisher: IEEE Computer Society
Citation: Deryabin, M., Chervyakov, N., Tchernykh, A., Berezhnoy, V., Djurabaev, A., Nazarov, A., Babenko, M. Comparative performance analysis of information dispersal methods // Conference of Open Innovation Association, FRUCT. - 2019. - Volume 2019-April. - Номер статьи 8711955. - Pages 67-74
Series/Report no.: Conference of Open Innovation Association, FRUCT
Abstract: In this paper, we present an analysis of information dispersal methods for using in distributed storage systems, processing, and transmission of data. We provide a comparative study of the methods most widely used in practice considering performance, reliability and cryptographic security. There are three main approaches to the information dispersal: Information Dispersal Algorithm by Rabin, Residue Number System (RNS) and Polynomial Residue Number System. We propose an efficient data recovery algorithm based on data representation in the RNS. Comprehensive experimental analysis shows that the most productive approach for bit length up to 256 bits is the use of the RNS with our developed algorithm. We show that the use of the RNS for the design of distributed storage systems, data transmission, and data processing, can significantly reduce the time of information processing
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File Description SizeFormat 
scopusresults 951 .pdf
  Restricted Access
428.5 kBAdobe PDFView/Open
WoS 603 .pdf
  Restricted Access
181.14 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.