Efficient routing in heavy traffic under partial sampling of service times
| dc.creator | Atar, Rami | |
| dc.creator | Shwartz, Adam | |
| dc.date | 2007-11-14 | |
| dc.date.accessioned | 2026-07-07T08:42:55Z | |
| dc.date.available | 2026-07-07T08:42:55Z | |
| dc.description | We consider a queue with renewal arrivals and n exponential servers in the Halfin-Whitt heavy traffic regime, where n and the arrival rate increase without bound, so that a critical loading condition holds. Server k serves at rate $μ_k $, and the empirical distribution of the $μ_k $ is assumed to converge weakly. We show that very little information on the service rates is required for a routing mechanism to perform well. More precisely, we construct a routing mechanism that has access to a single sample from the service time distribution of each of $n$ to the power of $1/2 + ε$ randomly selected servers, but not to the actual values of the service rates, the performance of which is asymptotically as good as the best among mechanisms that have the complete information on $ μ_k $. | |
| dc.identifier | https://arxiv.org/abs/0711.2188 | |
| dc.identifier | http://arxiv.org/abs/0711.2188 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/142137 | |
| dc.subject | Probability | |
| dc.subject | Optimization and Control | |
| dc.subject | 68M20, 90B15, 90B22, 60K30, 60K25 | |
| dc.title | Efficient routing in heavy traffic under partial sampling of service times | |
| dc.type | text |