A peer-to-peer consensus algorithm to enable storage reliability for a decentralized distributed database

Towards a Highly Available Model for Processing Service Requests Based on Distributed Hash Tables

“…As detailed in Section 2, the key to a good service decentralization is a good, flexible, balanced and scalable distribution of the data, which most importantly needs to be persistent. This is why a very important part of this improved solution for decentralizing and distributing a service, in order to make it highly available, is to use a very efficient decentralized distributed database [7,16,17]. For the entire improved solution of a highly available service, we are most interested in not introducing too much overhead by adding this solution's extra components, which yield high availability for the service.…”

“…This is why, in Section 2.3, we describe the ways in which the internal components of the newly decentralized service cooperate and interact, in order to truly make the service highly available. We also point out how this work re-used aspects from our team's previous research in the field, namely the advantages of a peer-to-peer DHTbased decentralized distributed database [7,16,17], with self-extending capabilities. We also argue why such a decentralized distributed database is crucial if we want to obtain a highly available decentralized distributed service.…”

“…This allows the distributed ensemble of nodes to behave as a fault tolerant system, thus offering a persistent data storage. This last property is essential to a reliable storage system based on DHTs, such as a decentralized highly available database [7,16,17], which can reliably store the data needed by any request processing service. Moreover, for a more "dispersed" storage of the data in the DHT network, one can successively apply more hash functions [37].…”

“…2.4. The Pre-Existent DHT-Based Distributed Database to Reliably and Persistently Store the Data Belonging to a Highly Available Service's Clients Our team's previously published contribution to the field of distributed databases, which this solution relies on, resides in the fact of having identified a way to solve the problem of data loss, and more importantly of critical data loss, by storing the data on newly added nodes to the underlying DHT infrastructure, which is shared by the service and the database described in [7,16,17]. Even if the obtained infrastructure is not 100% secure, it offers a safety level for the data that is significantly improved from a classical DHT, since it is able to identify and exclude malicious peers from the DHT.…”