Now showing items 1-3 of 3
Load balancing in processor sharing systems
We investigate optimal load balancing strategies for a multi-class multi-server processor-sharing system with a Poisson input stream, heterogeneous service rates, and a server-dependent holding cost per unit time. Specifically, ...
Price of anarchy in non-cooperative load balancing games
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service discipline is assumed to be processor-sharing at ...
Competition yields efficiency in load balancing games
We study a nonatomic congestion game with N parallel links, with each link under the control of a profit maximizing provider. Within this 'load balancing game', each provider has the freedom to set a price, or toll, for ...