A dynamic priority multiplexing scheme for traffic regulation andscheduling in a B-ISDN supporting widely diversified services isproposed. In this scheme, the instantaneous priority of a packet isgiven by the difference between a penalty reflecting the earliness ofthe packet arrival with respect to its targeted arrival time and adynamically attained priority due to waiting in the buffer. The packetwith the highest priority is scheduled for transmission when the link isavailable and the packet with the lowest priority is dropped when thebuffer is full. When the priorities of all waiting packets increaselinearly at rate one, the proposed scheme is shown to be equivalent tothe virtual clock algorithm. For this special case, a simple expressionfor the per connection waiting time is obtained by using a heavy trafficapproximation approach
展开▼
