Approximate load balancing on dynamic and asynchronous networks

DOI10.1145/167088.167250MaRDI QIDQ5248534zbMATH OpenOpenAlexFDO

Authors Baruch Awerbuch, Bruce M. Maggs, Satish 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

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Deterministic network models in operations research (90B10)

Cited in

(7)

• Rapid convergence of a local load balancing algorithm for asynchronous rings
• Adaptive packet routing for bursty adversarial traffic
• On the stability of dynamic diffusion load balancing
• Quantized consensus
• Dynamic graph models and their properties
• A simple approach for adapting continuous load balancing processes to discrete settings
• Local deal-agreement algorithms for load balancing in dynamic general graphs

This page was built for publication: Approximate load balancing on dynamic and asynchronous networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248534)