The R(1)W(1) Communication Model for Self-Stabilizing Distributed Algorithms

2025-10-06

AI Summary

Transient faults frequently occur in large-scale distributed systems, while self-stabilizing algorithms suffer from slow convergence and high design complexity. Method: This paper introduces the R(1)W(1) model—a novel communication and execution model wherein each process can read and write its own and its neighbors’ local variables in a single atomic step. This unifies local read/write operations into one primitive, simplifying algorithm design and accelerating convergence. To realize this model, we propose a synchronous message simulator based on randomized distance-2 mutual exclusion and formally prove its simulatability within the synchronous message-passing model. Contribution/Results: Leveraging R(1)W(1), we design the first efficient self-stabilizing algorithms for three fundamental graph problems: maximum matching, minimum k-dominating set, and maximum k-dependent set. Both theoretical analysis and experimental evaluation confirm the model’s effectiveness, generality, and practicality.

Technology Category

• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems
• Search and Optimization: Distributed Search
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization

Application Category

• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs
• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments
• Responsible Web: Human-perceived consequences of algorithmic deployment on the web

Abstract

Self-stabilization is a versatile methodology in the design of fault-tolerant distributed algorithms for transient faults. A self-stabilizing system automatically recovers from any kind and any finite number of transient faults. This property is specifically useful in modern distributed systems with a large number of components. In this paper, we propose a new communication and execution model named the R(1)W(1) model in which each process can read and write its own and neighbors' local variables in a single step. We propose self-stabilizing distributed algorithms in the R(1)W(1) model for the problems of maximal matching, minimal k-dominating set and maximal k-dependent set. Finally, we propose an example transformer, based on randomized distance-two local mutual exclusion, to simulate algorithms designed for the R(1)W(1) model in the synchronous message passing model with synchronized clocks.

Problem

• Proposes R(1)W(1) model for self-stabilizing distributed algorithms
• Solves maximal matching and dominating set problems
• Provides transformer to simulate model in message passing systems

Innovation

• R(1)W(1) model enables reading and writing neighbor variables
• Algorithms solve maximal matching and k-dominating set problems
• Transformer simulates R(1)W(1) in synchronous message passing model