Selfish traffic allocation for server farms

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 287-296

  Czumaj, Artur ^a   Krysta, Piotr ^a   Vöcking, Berthold ^a  

^a University Heights   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; GAME THEORY; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS; QUALITY OF SERVICE; RESOURCE ALLOCATION; TELECOMMUNICATION TRAFFIC;

LINEAR COST FUNCTION; TRAFFIC ALLOCATION;

QUEUEING THEORY;

EID: 0036041380     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509952     Document Type: Conference Paper

References (29)

1. Self-similarity in world wide web traffic: Evidence and possible causes
2. Tight bounds for worst-case equilibria
3. Rate of change and other metrics: A live study of the world wide web
4. Dynamics of IP traffic: A study of the role of variability and the impact of control
5. The braess paradox
6. A generic analysis of selfish routing
7. Capacity allocation under noncooperative routing
8. Avoiding the Braess paradox in noncooperative networks
9. Worst-case equilibria
10. Virtual path bandwidth allocation in multiuser networks
11. The price of selfish routing
12. Competitive routing in multi-user communication networks
13. Algorithms, games, and the internet
14. Game theory and mathematical economics: A theoretical computer scientist's introduction (Tutorial)
15. On complexity as bounded rationality
16. On the relationship between file sizes, transport protocols, and self-similar network traffic
17. Wide area traffic: The failure of Poisson modeling
18. How bad is selfish routing?
19. Stackelberg scheduling strategies
20. Designing networks for selfish users is hard
21. How unfair is optimal routing?
22. The prevalence of braess paradox
23. Some theoretical aspects of road traffic research