Synchronization in Anonymous Networks Under Arbitrary Dynamics
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917048718721024 |
|---|---|
| author | Bazzi, Rida Bickley, Cameron Chaturvedi, Anya Richa, Andréa W. Vargas, Peter |
| author_facet | Bazzi, Rida Bickley, Cameron Chaturvedi, Anya Richa, Andréa W. Vargas, Peter |
| contents | We present the $δ$-Synchronizer, which works in non-synchronous dynamic networks under minimal assumptions. Our model allows for arbitrary topological changes without any guarantee of eventual global or partial stabilization and assumes that nodes are anonymous. This deterministic synchronizer is the first that enables nodes to simulate a dynamic network synchronous algorithm for executions in a semi-synchronous dynamic environment under a weakly-fair node activation scheduler, despite the absence of a global clock, node ids, persistent connectivity or any assumptions about the edge dynamics (in both the synchronous and semi-synchronous environments). We make the following contributions: (1) we extend the definition of synchronizers to networks with arbitrary edge dynamics; (2) we present the first synchronizer from the semi-synchronous to the synchronous model in such networks; and (3) we present non-trivial applications of the proposed synchronizer to existing algorithms. We assume an extension of the Pull communication model by adding a single 1-bit multi-writer atomic register at each edge-port of a node. We show that this extension is needed and that synchronization in our setting is not possible without it. The $δ$-Synchronizer operates with a multiplicative memory overhead at the nodes that is asymptotically logarithmic on the runtime of the underlying synchronous algorithm being simulated-in particular, it is logarithmic for polynomial-time synchronous algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_08661 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Synchronization in Anonymous Networks Under Arbitrary Dynamics Bazzi, Rida Bickley, Cameron Chaturvedi, Anya Richa, Andréa W. Vargas, Peter Distributed, Parallel, and Cluster Computing We present the $δ$-Synchronizer, which works in non-synchronous dynamic networks under minimal assumptions. Our model allows for arbitrary topological changes without any guarantee of eventual global or partial stabilization and assumes that nodes are anonymous. This deterministic synchronizer is the first that enables nodes to simulate a dynamic network synchronous algorithm for executions in a semi-synchronous dynamic environment under a weakly-fair node activation scheduler, despite the absence of a global clock, node ids, persistent connectivity or any assumptions about the edge dynamics (in both the synchronous and semi-synchronous environments). We make the following contributions: (1) we extend the definition of synchronizers to networks with arbitrary edge dynamics; (2) we present the first synchronizer from the semi-synchronous to the synchronous model in such networks; and (3) we present non-trivial applications of the proposed synchronizer to existing algorithms. We assume an extension of the Pull communication model by adding a single 1-bit multi-writer atomic register at each edge-port of a node. We show that this extension is needed and that synchronization in our setting is not possible without it. The $δ$-Synchronizer operates with a multiplicative memory overhead at the nodes that is asymptotically logarithmic on the runtime of the underlying synchronous algorithm being simulated-in particular, it is logarithmic for polynomial-time synchronous algorithms. |
| title | Synchronization in Anonymous Networks Under Arbitrary Dynamics |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2506.08661 |