Approximate load balancing on dynamic and asynchronous networks
From MaRDI portal
Publication:5248534
DOI10.1145/167088.167250zbMath1310.68233OpenAlexW2033864237MaRDI QIDQ5248534
Bruce M. Maggs, Baruch Awerbuch, Satish B. Rao, William Aiello
Publication date: 7 May 2015
Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/167088.167250
Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Approximation algorithms (68W25)
Related Items (7)
Dynamic graph models and their properties ⋮ Quantized consensus ⋮ Local deal-agreement algorithms for load balancing in dynamic general graphs ⋮ A simple approach for adapting continuous load balancing processes to discrete settings ⋮ On the stability of dynamic diffusion load balancing ⋮ Adaptive packet routing for bursty adversarial traffic ⋮ Rapid convergence of a local load balancing algorithm for asynchronous rings
This page was built for publication: Approximate load balancing on dynamic and asynchronous networks