Алгоритм достижения консенсуса для распределённых систем обработки данных на основе технологии распределённых реестров
Работая с нашим сайтом, вы даете свое согласие на использование файлов cookie. Это необходимо для нормального функционирования сайта, показа целевой рекламы и анализа трафика. Статистика использования сайта отправляется в «Яндекс» и «Google»
Научный журнал Моделирование, оптимизация и информационные технологииThe scientific journal Modeling, Optimization and Information Technology
Online media
issn 2310-6018

Consensus building algorithm for distributed data processing systems based on distributed registry technology

Toroev A.S.   Sizonenko A.B.  

UDC УДК 004.75
DOI: 10.26102/2310-6018/2021.32.1.002

  • Abstract
  • List of references
  • About authors

The paper substantiates the need to use distributed registry technology for its subsequent implementation in distributed data processing systems (hereinafter referred to as DDPS). In order to adapt any type of DDPS to this technology, an algorithm for achieving consensus between its nodes is proposed and described in order to achieve final consistency on writing data to a distributed registry. Such consensus-building algorithms as "BFT-DPoS" and "PoI" used in cryptocurrency systems are proposed as prototypes. These consensus algorithms were chosen because of their high performance and low resource consumption. To obtain a nondeterministic result when determining the "winner Registrar node", the "assignment" mechanism is proposed instead of the "competition" mechanism. In order to implement the "appointment" mechanism, the analysis of known decision-making methods for evaluating the criteria for each candidate was carried out. It is proved that the hierarchy analysis method is the most effective method for DDPS with a dynamically changing network architecture. For numerical evaluation of the "weight coefficients" of Registrar nodes that are candidates for the "winning Registrar nodes" in order to obtain their final rating, a corresponding method for calculating them has been developed based on the above method.

1. Toroev A. S. Analysis of the survivability of a distributed system of certification centers in the conditions of active destructive actions of an attacker. Collection of materials of the XXVI International scientific and technical conference. Nizhny Novgorod state technical University named after R. E. Alekseev. 2020:643-647.

2. Toroev A. S. Analysis of the effectiveness of consensus algorithms in distributed data processing systems based on blockchain technology. Vestnik komp′yuternykh i informatsionnykh tekhnologiy. 2020;11(197)13-22.

3. Delegated Proof-of-Stake Consensus. 2018. Documentation Available from: https://tron.network/static/doc/white_paper_v_2_0.pdf (Accessed 27th September 2020).

4. NEM White Paper. Documentation Available from: https://nem.io/wp-content/themes/nem/files/NEM_techRef.pdf. (Accessed 1th Julie 2020).

5. Rodzin S.I. The theory of decision making: lecture and workshop. Textbook. Taganrog: TTI YUFU, 2010:336.

6. Saati, T. Decision making: a method for analyzing hierarchies. Per. s angl. R.G. Vachnadze. M.: Radio i svyaz′, 1993:315.

7. Toroev A. S. Lifecycle of transactional exchange between nodes of a distributed data processing system based on distributed ledger technology. Vestnik Voronezhskogo instituta vysokikh tekhnologiy.2020. Available from: https://vivt.ru/science/vestnik

Toroev Andrey Sergeevich

eLibrary |

Krasnodar higher military school

Krasnodar, Russian Federation

Sizonenko Alexander Borisovich
doctor of technical sciences Assistant Professor

eLibrary |

Krasnodar higher military school

Krasnodar, Russian Federation

Keywords: consensus algorithm, distributed registry, hierarchy analysis method, solution of the problem "About Byzantine generals", delegated proof of stake, proof of importance

For citation: Toroev A.S. Sizonenko A.B. Consensus building algorithm for distributed data processing systems based on distributed registry technology. Modeling, Optimization and Information Technology. 2021;9(1). Available from: https://moitvivt.ru/ru/journal/pdf?id=908 DOI: 10.26102/2310-6018/2021.32.1.002 (In Russ).


Full text in PDF