A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Optimization of static traffic allocation policies
1994
Theoretical Computer Science
17 Combe, M.B., O.J. Boxma, Optimization of static traffic allocation policies, Theoretical Computer Science 125 (1994) 17-43. We consider the traffic allocation problem: arriving customers have to be assigned to one of a group of servers. The aim is to optimize system performance measures, such as mean waiting time of a customer or total number of customers in the system, under a given static allocation policy. Two static policies are considered: probabilistic assignment and allocation
doi:10.1016/0304-3975(94)90215-1
fatcat:4akdz3x6irf2nesgjcvkdfu7oi