OPTIMUM-DERAM: Highly Consistent, Scalable, and Secure Multi-Object Memory using RLNC

TL;DR

OPTIMUM-DERAM presents a decentralized, scalable, and secure multi-object shared memory system leveraging RLNC, consistent hashing, and blockchain-based registry, demonstrating significant performance improvements over traditional solutions.

Contribution

It introduces a novel decentralized shared memory architecture that scales with objects and participants, using RLNC, consistent hashing, and blockchain for security and reconfiguration.

Findings

Achieves improved performance and storage scalability.

Supports dynamic joins and departures securely.

Outperforms previous distributed shared memory solutions like ABD.

Abstract

This paper introduces OPTIMUM-DERAM, a highly consistent, scalable, secure, and decentralized shared memory solution. Traditional distributed shared memory implementations offer multi-object support by multi-threading a single object memory instance over the same set of data hosts. While theoretically sound, the amount of resources required made such solutions prohibitively expensive in practical systems. OPTIMUM-DERAM proposes a decentralized, reconfigurable, atomic read/write shared memory (DeRAM) that: (i) achieves improved performance and storage scalability by leveraging Random Linear Network Codes (RLNC); (ii) scales in the number of supported atomic objects by introducing a new object placement and discovery approach based on a consistent hashing ring; (iii) scales in the number of participants by allowing dynamic joins and departures leveraging a blockchain oracle to serve as a registry service; and (iv) is secure against malicious behavior by tolerating Byzantine failures. Experimental results over a globally distributed set of nodes, help us realize the performance and scalability gains of OPTIMUM-DERAM over previous distributed shared memory solutions (i.e., the ABD algorithm [3])