Selfish traffic allocation for server farms
Authors:
Open Access
- 19 May 2002
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 287-296
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Algorithms, games, and the internet2001
- Stackelberg scheduling strategies2001
- The price of selfish routing2001
- 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