Рекурсивный алгоритм формирования структурированных множеств информационных блоков для повышения скорости выполнения процедур определения их источника

Purpose of research. In some classes of information systems, it is impossible to use well-known algorithms for the identification and the authentication the data blocks sources. The reason for this is the duration of the full data processing cycle. The article considers the original algorithm for determining sources for a group of data blocks. It allows you to detect errors faster than the usual iterative algorithm for forming tree structures of blocks by changing the order of base operations. The purpose of the work is to reduce the computational and resource costs for the receiver to perform identification the sources of blocks, each of them has a size not exceeding a few bytes. Methods. The identification method based on the forming a tree structure of incoming information blocks and subsequent analysis of tree branches. It allows selecting a chain of blocks formed by the target source. In the article the formal description of the algorithm is given. The results of the simulation of the procedures for determining the source are presented. In this case, the characteristics of the recursive algorithm were compared with those obtained for the known iterative one. Results. The relationships between the average number of typical hash comparison operations, the average number of tree structure branches, and the number of accepted blocks obtained as a result of simulation modeling. This made it possible to determine the conditions for applying the recursive and iterative algorithms. Conclusion. It is shown that the using of a recursive algorithm for forming a tree structure of frames can reduce the average number of base operations performed by the receiver by 5-10 % and reduce the memory cost for storing tree structure branches by up to 30%.