A model of decentralized data storage system is presented to ensure the integrity and availability of information based on decentralized management algorithm. The proposed decentralized management algorithm solves the problem of a rapidly growing IP address table due to the increasing number of system users. We propose an approach focused on optimizing the direct links between the hosts of the storage network and dynamically calculating their ratings. Host ratings are calculated based on network latency, uptime, and processor performance. The rating calculation is a two-stage process, the second stage takes CPU performance into account. This model offers a tiered structure of masterhosts, where first-level masterhosts accumulate host IP addresses and provide access to their database, maintaining the current state of the decentralized storage network, second-level masterhosts aggregate the IP addresses of first-level masterhosts into groups, thus creating a hierarchical network structure. The paper evaluates the proposed approach by calculating the consumed service traffic required to maintain each host, and compares the decentralized storage scheme and the centralized scheme. The results show that the decentralized system is superior to the centralized one in terms of data availability and has a higher efficiency of disk space utilization due to savings on data duplication, which proves the possibility of effective existence of such a system, and thus its application to ensure the integrity and availability of stored data.
No takes yet. Share an insight, caveat, or question.
Povyshev et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: