Adaptive Control of Two Competing Queues

We consider the problem of optimally all locating the time of a server to two parallel queues. “First we consider the problem when the queue sizes are observed, although the arrival and departure rates are not available, but have to be estimated. We next consider the problem when the arrival process is observed, but its rate is unknown, while the departure process is not observed and its rate known within certain bounds. In both cases adaptive control schemes are developed. The performance criterion used is aggregate delay .