Work

All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free

Year: 2025

Type: conference-paper

Abstract: Resilient computation in all-to-all-communication models has attracted tremendous attention over the years. Most of these works assume the classical faulty model which restricts the total number of corrupted edges (or vertices) by some integer fault parameter f. A recent work by [Bodwin, Haeupler and Parter, SODA 2024] introduced a stronger notion of fault-tolerance, in the context of graph sparsification, which restricts the degree of the failing edge set F, rather than its cardinality. For a subset of faulty edges F, the faulty-degree deg(F) is the largest number of faults in F incident to any given node.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733536

Authors: Orr Fischer, Merav Parter

Institutions: Bar-Ilan University, Weizmann Institute of Science

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funders: European Commission, Israel Science Foundation, European Research Council

Awards: G434337789, G4756707729, G8187212115, G918616181