Recursive Energy Efficient Agreement

2026-02-03

AI Summary

This work addresses the challenge of minimizing per-party active communication rounds to reduce energy consumption in distributed systems while tolerating up to $f$ crash failures. The paper proposes a novel consensus algorithm based on a recursive structure, incorporating a carefully designed fault-tolerant mechanism and round-scheduling strategy. In a system of $n$ nodes, the protocol reduces the number of active rounds per node to $O(\log f)$, achieving logarithmic complexity per participant. To the best of our knowledge, this is the first energy-efficient consensus protocol to attain logarithmic active rounds per party, significantly improving upon prior solutions that required linearly many rounds and thereby substantially lowering overall system energy consumption.

Technology Category

• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Search and Optimization: Distributed Search
• Machine Learning: Active Learning

Application Category

• Systems and Infrastructure for Web, Mobile and WoT: Energy management for devices in mobile Web and WoT environments
• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs
• Responsible Web: Human-perceived consequences of algorithmic deployment on the web

Abstract

Agreement is a foundational problem in distributed computing that have been studied extensively for over four decades. Recently, Meir, Mirault, Peleg and Robinson introduced the notion of \emph{Energy Efficient Agreement}, where the goal is to solve Agreement while minimizing the number of round a party participates in, thereby reducing the energy cost per participant. We show a recursive Agreement algorithm that has $O(\log f)$ active rounds per participant, where $f<n$ represents the maximum number of crash faults in the system.

Problem

• Energy Efficient Agreement
• Distributed Computing
• Consensus
• Crash Faults
• Active Rounds

Innovation

• Energy Efficient Agreement
• Recursive Algorithm
• Distributed Computing
• Crash Faults
• Active Rounds