Dispatching Problem: Optimal Policy for 3 Servers
The animation below illustrates the actions of the optimal size-aware dispatching policy in a three server system with the Poisson arrival process with rate λ and exponentially distributed job sizes with μ=1. The arrival rate is varied so that the offered load ρ=λ/(3μ) is 0.6, 0.8 and 0.9 from left to right. The x-axes corresponds to the backlog in Server 1, and y-axes to backlog in Server 2. Backlog in Server 3 is fixed to some value that can be chosen from the drop-down menu (indicated with the black lines in the graphs).
| 20 |  |
20 |  |
20 |  |
|
||||||||||||||
| 0 | 20 | 0 | 20 | 0 | 20 | |||||||||||||||
| ρ=0.6 | ρ=0.8 | ρ=0.9 | ||||||||||||||||||
