DYNAMIC SCHEDULING FOR STOCHASTIC NETWORKS IN HEAVY TRAFFIC

1/21/02


Click here to start


Table of Contents

DYNAMIC SCHEDULING FOR STOCHASTIC NETWORKS IN HEAVY TRAFFIC

HEAVY TRAFFIC APPROACH TO DYNAMIC SCHEDULING

REFERENCES

Stochastic network with control of activities

Model Primitives

Heavy traffic (Harrison, 98)

Diffusion approximation

(Formal) Brownian Control Problem (Harrison, 98)

Equivalent Workload Formulation and Dual Program (Harrison-VanMiegem 97, Harrison 98)

Special case -- multiclass network

Workload properties in general (Bramson-W, 00)

Complete Resource Pooling (CRP)

PARALLEL SERVER SYSTEM

Two-server example: Harrison 98

Parallel server example (threshold policy)

Author: Williams