A dynamic priority queueing approach to traffic regulation and scheduling in B-ISDN

A dynamic priority multiplexing scheme for traffic regulation and scheduling in a B-ISDN supporting widely diversified services is proposed. In this scheme, the instantaneous priority of a packet is given by the difference between a penalty reflecting the earliness of the packet arrival with respect to its targeted arrival time and a dynamically attained priority due to waiting in the buffer. The packet with the highest priority is scheduled for transmission when the link is available and the packet with the lowest priority is dropped when the buffer is full. When the priorities of all waiting packets increase linearly at rate one, the proposed scheme is shown to be equivalent to the virtual clock algorithm. For this special case, a simple expression for the per connection waiting time is obtained by using a heavy traffic approximation approach