Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input

DOI10.1137/S0097539703437831zbMath1075.68005WikidataQ116754422 ScholiaQ116754422MaRDI QIDQ5317166

Adam Kirsch, Aris Anagnostopoulos, Eli Upfal

Publication date: 16 September 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

stabilityefficiencydynamic load balancingsteady state analysisstochastic adversary

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of renewal theory (reliability, demand theory, etc.) (60K10) Randomized algorithms (68W20) Network protocols (68M12) Renewal theory (60K05)

Related Items (1)

Self-stabilizing repeated balls-into-bins

This page was built for publication: Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input