A model of a distributed registry system with the approximation of applications by the Erlang flow

In this paper, we propose a method for mathematically describing a distributed registry as a queuing system. A conceptual model is presented that defines the main structural elements of the topological structure of a distributed registry, such as network nodes, registry nodes, and distributed registry services for conducting transaction verification operations. The distribution functions of a random variable characteristic of these processes are determined and presented. The application distribution is approximated by Erlang flows to obtain the most accurate value. The conditions for constructing an infinitesimal matrix are determined, taking into account the features of information processes in a distributed registry. Formed the conditions for the normalization. The main integral characteristic indicators required for the analysis of the distributed registry as a queuing system are presented. In order to determine the main integral characteristic indicators of the distributed registry system, a simulation model was developed on the AnyLogic platform.