HEAVY TRAFFIC APPROACH TO DYNAMIC SCHEDULING
1. Formulate stochastic network model
2. Define heavy traffic (flexible servers)
3. Formal diffusion approximation: BCP
(Brownian control problem)
4. Reduce to EWF (equivalent workload
5. Solve the BCP (or EWF)
6. Interpret the solution of the BCP
7. Analyze the performance of this policy
OVERALL APPROACH: Harrison (‘88), Laws (‘92), Kelly-Laws (‘93), Harrison-Van Mieghem (‘97), Harrison (‘98)
STOCHASTIC NETWORK MODEL CONSIDERED HERE IS A MODIFICATION OF THAT IN HARRISON (‘98)