Optimal scheduling for balancing buffer occupancy at an ATM access point

Abstract

The scheduling at an ATM access point is modelled as a stochastic control problem and optimal scheduling policy is obtained for equalizing input buffer contents in the case of two inputs with unequal arrival rates. The optimal policy is work conserving, and it serves the longer queue when the queue lengths are unequal and serves the queue with larger arrival rate when the queue lengths are equal. In the case of 0-1 arrival processes, some sample path wise results are obtained.