Stability of load balancing algorithms in dynamic adversarial systems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 399-406

  Anshelevich, Elliot ^a   Kempe, David ^a   Kleinberg, Jon ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION THEORY; MATHEMATICAL MODELS; PACKET NETWORKS;

LOAD BALANCING ALGORITHMS; ROUTING PACKETS;

COMPUTATION THEORY;

EID: 0036040062     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509968     Document Type: Conference Paper

References (21)

1. Approximate load balancing on dynamic and asynchronous networks
2. Adaptive packet routing for bursty adversarial traffic
3. Universal stability results for greedy contention-resolution protocols
4. Simple routing strategies for adversarial systems
5. A simple local-control approximation algorithm for multicommodity flow
6. Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks
7. Adversarial queueing theory
8. Task assignment in a distributed system: Improving performance by unbalancing load
9. Adaptive load sharing in homogeneous distributed systems
10. Maximal flow through a network
11. Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks
12. Tight analyses of two local load balancing algorithms
13. Multi-commodity network flows
14. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
15. The geometry of graphs and some of its algorithmic applications
16. Strongly adaptive token distribution
17. On the analysis of randomized load balancing schemes
18. An adversarial model for distributed dynamic load balancing
19. The token distribution problem
20. A short proof of the two-commodity flow theorem