Improved Analysis of Deterministic Load-Balancing Schemes

DOI10.1145/2767386.2767413zbMath1333.68135arXiv1404.4344OpenAlexW2050588875MaRDI QIDQ2796265

Frederik Mallmann-Trenn, Ralf Klasing, Adrian Kosowski, Przemysław Uznański, Petra Berenbrink

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.4344

zbMATH Keywords

mixing timerotor-routerdeterministic load-balancing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items

The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks, Robustness of the rotor-router mechanism, Total variation discrepancy of deterministic random walks for ergodic Markov chains, Deterministic Random Walks for Rapidly Mixing Chains, A survey of size counting in population protocols, The cover time of deterministic random walks for general transition probabilities

Cites Work

• Unnamed Item
• Memorization and Association on a Realistic Neural Model