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

2026-01-19

AI Summary

This work addresses the limitations of traditional distributed shared memory systems—namely high resource overhead, poor scalability, and lack of Byzantine fault tolerance—in multi-object scenarios. The authors propose a decentralized, reconfigurable atomic read/write shared memory system that innovatively integrates Random Linear Network Coding (RLNC) to enhance storage efficiency, employs a consistent hashing ring for efficient object placement and discovery, and leverages a blockchain oracle to support dynamic node join/leave operations while ensuring Byzantine fault tolerance. Experimental results demonstrate that the proposed scheme significantly outperforms classical protocols such as ABD in global-scale distributed environments, achieving substantial improvements in performance, scalability, and security.

Technology Category

• Search and Optimization: Distributed Search
• Data Mining & Knowledge Management: Scalability, Parallel & Distributed Systems
• Multiagent Systems: Distributed Problem Solving

Application Category

• Security and Privacy: Blockchains and distributed ledgers
• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems

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])

Problem

• distributed shared memory
• multi-object support
• scalability
• consistency
• Byzantine failures

Innovation

• Random Linear Network Coding
• Decentralized Shared Memory
• Consistent Hashing
• Byzantine Fault Tolerance
• Blockchain Oracle