The priority token bank: Integrated scheduling and admission control for an integrated-services network
Jon M. Peha · 2002
The author proposes a mechanism called the priority token bank for admission control, scheduling, and policing in integrated-services networks, where arrival processes and performance objectives can vary greatly from one packet stream to another. There are two principal components to the priority token bank: accepting or rejecting requests to admit entire packet streams, where acceptance means guaranteeing that the packet stream's performance objectives will be met, and scheduling the transmission of packets such that performance objectives are met, even under heavy loads. To the extent possible, the performance of traffic is also optimized beyond the requirements. The performance achieved with the priority token bank is compared to that of other typical algorithms. It is shown that, when operating under the constraint that the performance objectives of applications such as packet voice, HDTV (high-definition television) and bulk data transfer must be met in an ATM (asynchronous transfer mode) network, the mean delay experienced by other traffic is much better with the priority token bank. Equivalently, to achieve the same performance with other algorithms, it would be necessary to greatly reduce the network load.>