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

In this paper we address the problem of trust in a particular type of distributed system, namely, a fully decentralized distributed database. We consolidate this database's storage reliability, by rapidly identifying if a node has been attacked, and, thus, acts maliciously, in order to exclude it from the system. We propose a new approach for a distributed consensus algorithm, which is fully adapted and optimized for the Chord DHT, that represents the underlying logical peer-to-peer infrastructure of the decentralized database server we have considered. It turns out that the solution for eliminating malicious nodes introduces a low overhead, by exchanging a minimum number of extra messages, and it could be used for any type of decentralized distributed systems based on DHTs.