home/Research Interests/Dispatching Problem/Simulator

Dispatching Problem: Simulator

Simulation parameters:
Service rate ν1:
Service rate ν2:
Job sizes:
Simulate a single point:
Arrival rate λ:
Simulation time:
Simulate a graph:
Number of arrivals: (per point, 20 pts)
(The reference policy RND-ρ balances the load equally)
Policy parameters: define the admission cost per server
Server 1 cost: (r=rnd(0,1), x=job size, u=backlog)
Server 2 cost: server w/ smallest cost is chosen

Examples:
PolicyCost 1Cost 2
RND: r r : For 50:50 split
SITA-E: x 1.67835: For Exp
x 1.30964: For BPareto
LWL: u u : Individually the minimum waiting time
Myopic: u+x/ν1 u+x/ν2 : Substitute the numerical values of the νi
Job sizes:
Const: Constant value 1,E[X]=1, σ2=0
Exp: Exponential distribution,E[X]=1, σ2=1
BPareto:Truncated Pareto distribution,E[X]=1, σ2=17.43
0.3395892<X<1000; α=1.5
Here is yet another simulator.