Deterministic Fault-Tolerant Local Load Balancing and its Applications against Adaptive Adversaries
Dariusz R. Kowalski, Jan Olkowski

TL;DR
This paper introduces a deterministic fault-tolerant local load balancing algorithm that ensures fast convergence despite node failures and demonstrates its applications in improving consensus algorithms under crash and omission failures.
Contribution
The paper presents a novel deterministic fault-tolerant local load balancing protocol and applies it to develop improved consensus algorithms resilient to crash and omission failures.
Findings
Design of a lightweight fault-tolerant local load balancing algorithm
Improved randomized consensus algorithm with lower communication complexity
Near-optimal consensus solution for omission failures with polylogarithmic overhead
Abstract
Load balancing is among the basic primitives in distributed computing. In this paper, we consider this problem when executed locally on a network with nodes prone to failures. We show that there exist lightweight network topologies that are immune to message delivery failures incurred by (at most) a constant fraction of all nodes. More precisely, we design a novel deterministic fault-tolerant local load balancing (LLB) algorithm, which, similarly to their classical counterparts working in fault-free networks, has a relatively simple structure and guarantees exponentially fast convergence to the average value despite crash and omission failures. As the second part of our contribution, we show three applications of the newly developed fault-tolerant local load balancing protocol. We give a randomized consensus algorithm, working against crash failures, that improves over the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Complexity and Algorithms in Graphs · Peer-to-Peer Network Technologies
