Skip to Main content Skip to Navigation
Conference papers

A Topological Perspective on Distributed Network Algorithms

Abstract : More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems. In this work, we show that combinatorial topology can also be useful for analyzing distributed algorithms in networks of arbitrary structure. To illustrate this, we analyze consensus, set-agreement, and approximate agreement in networks, and derive lower bounds for these problems under classical computational settings, such as the LOCAL model and dynamic networks.
Complete list of metadata
Contributor : Pierre Fraigniaud Connect in order to contact the contributor
Submitted on : Thursday, January 9, 2020 - 10:54:41 AM
Last modification on : Friday, January 21, 2022 - 3:16:30 AM

Links full text



Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, et al.. A Topological Perspective on Distributed Network Algorithms. 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019), Jul 2019, L'Aquila, Italy. ⟨10.1007/978-3-030-24922-9_1⟩. ⟨hal-02433511⟩



Les métriques sont temporairement indisponibles