Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.

Published in: WG (2002)

Keyphrases

load balancing
asymptotically optimal
dynamic load balancing
fault tolerance
distributed systems
tree structure
arrival rate
peer to peer
round robin
heavy traffic
mobile agents
grid computing
load balance
optimal policy
load balancing strategy
index structure
metric space
quality of service