## Harrison-Lopez ‘00:

- CRP iff all servers communicate via basic activities
- proposed discrete review policy (proof of asymptotic optimality – special two server case: Harrison ’98)

## W. ‘00 (see also Squillante, Xia, Yao, Zhang ‘00):

- CRP iff server-buffer graph with edges given by basic activities is a tree
- proposed threshold policy (continuous review)

## Bell-W. ‘01

- Proof that threshold policy of W. ‘00 is asymptotically optimal (two server (AAP) & multiserver (in prep.))

- S. Kumar ‘99: proposed discrete review policy (example)
- Ata, Harrison, Kumar ’01 (in prep.): discrete review policy and proof of asymptotic optimality
- Bramson-W. (in prep.): proposed threshold policy (continuous review)

Previous slide | Next slide | Back to first slide | View graphic version |