Comparative Performance Analysis of Information Dispersal Methods
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...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
FRUCT
2019-04-01
|
| Series: | Proceedings of the XXth Conference of Open Innovations Association FRUCT |
| Subjects: | |
| Online Access: | https://fruct.org/publications/fruct24/files/Der.pdf
|
| _version_ | 1818470300390522880 |
|---|---|
| author | Maxim Deryabin Nikolai Chervyakov Andrei Tchernykh Viktor Berezhnoy Anvar Djurabaev Anton Nazarov Mikhail Babenko |
| author_facet | Maxim Deryabin Nikolai Chervyakov Andrei Tchernykh Viktor Berezhnoy Anvar Djurabaev Anton Nazarov Mikhail Babenko |
| author_sort | Maxim Deryabin |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-13T21:35:35Z |
| format | Article |
| id | doaj.art-ba5346d5de45481c9d075a3bc11662cd |
| institution | Directory Open Access Journal |
| issn | 2305-7254 2343-0737 |
| language | English |
| last_indexed | 2024-04-13T21:35:35Z |
| publishDate | 2019-04-01 |
| publisher | FRUCT |
| record_format | Article |
| series | Proceedings of the XXth Conference of Open Innovations Association FRUCT |
| spelling | doaj.art-ba5346d5de45481c9d075a3bc11662cd2022-12-22T02:28:59ZengFRUCTProceedings of the XXth Conference of Open Innovations Association FRUCT2305-72542343-07372019-04-01854246774Comparative Performance Analysis of Information Dispersal MethodsMaxim Deryabin0Nikolai Chervyakov1Andrei Tchernykh2Viktor Berezhnoy3Anvar Djurabaev4Anton Nazarov5Mikhail Babenko6North Caucasus Federal University, Stavropol, Russian FederationNorth Caucasus Federal University, Stavropol, Russian FederationCICESE Research Center, Ensenada, MexicoNorth Caucasus Federal University, Stavropol, Russian FederationNorth Caucasus Federal University, Stavropol, Russian FederationNorth Caucasus Federal University, Stavropol, Russian FederationNorth Caucasus Federal University, Stavropol, Russian FederationIn 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.https://fruct.org/publications/fruct24/files/Der.pdf Information DispersalDistributed SystemsRedundant Residue Number SystemPerformanceErasure CodesReliable Storage |
| spellingShingle | Maxim Deryabin Nikolai Chervyakov Andrei Tchernykh Viktor Berezhnoy Anvar Djurabaev Anton Nazarov Mikhail Babenko Comparative Performance Analysis of Information Dispersal Methods Proceedings of the XXth Conference of Open Innovations Association FRUCT Information Dispersal Distributed Systems Redundant Residue Number System Performance Erasure Codes Reliable Storage |
| title | Comparative Performance Analysis of Information Dispersal Methods |
| title_full | Comparative Performance Analysis of Information Dispersal Methods |
| title_fullStr | Comparative Performance Analysis of Information Dispersal Methods |
| title_full_unstemmed | Comparative Performance Analysis of Information Dispersal Methods |
| title_short | Comparative Performance Analysis of Information Dispersal Methods |
| title_sort | comparative performance analysis of information dispersal methods |
| topic | Information Dispersal Distributed Systems Redundant Residue Number System Performance Erasure Codes Reliable Storage |
| url | https://fruct.org/publications/fruct24/files/Der.pdf
|
| work_keys_str_mv | AT maximderyabin comparativeperformanceanalysisofinformationdispersalmethods AT nikolaichervyakov comparativeperformanceanalysisofinformationdispersalmethods AT andreitchernykh comparativeperformanceanalysisofinformationdispersalmethods AT viktorberezhnoy comparativeperformanceanalysisofinformationdispersalmethods AT anvardjurabaev comparativeperformanceanalysisofinformationdispersalmethods AT antonnazarov comparativeperformanceanalysisofinformationdispersalmethods AT mikhailbabenko comparativeperformanceanalysisofinformationdispersalmethods |