Selfish traffic allocation for server farms
- 19 May 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 287-296
- https://doi.org/10.1145/509907.509952
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Algorithms, games, and the internetPublished by Association for Computing Machinery (ACM) ,2001
- Stackelberg scheduling strategiesPublished by Association for Computing Machinery (ACM) ,2001
- The price of selfish routingPublished by Association for Computing Machinery (ACM) ,2001
- Avoiding the Braess paradox in non-cooperative networksJournal of Applied Probability, 1999
- Self-similarity in World Wide Web traffic: evidence and possible causesIEEE/ACM Transactions on Networking, 1997
- Capacity allocation under noncooperative routingIEEE Transactions on Automatic Control, 1997
- Virtual path bandwidth allocation in multiuser networksIEEE/ACM Transactions on Networking, 1997
- Wide area traffic: the failure of Poisson modelingIEEE/ACM Transactions on Networking, 1995
- Competitive routing in multiuser communication networksIEEE/ACM Transactions on Networking, 1993
- The Prevalence of Braess' ParadoxTransportation Science, 1983