Most urgent packet algorithm in precedence based on end-to-end delay guarantees
Wei Ding · Journal of Chongqing University of Posts and Telecommunications · 2004
In this paper, a delay coordination based multihop crossbar scheduling algorithm is presented, which is the most urgent packet. This algorithm can provide end-to-end delay guarantee of packets. This algorithm uses the left delay recorded in the head of packet as the weight for packets scheduling. Through controlling the delay of packet in different hops, this algorithm can provide end-to-end delay guarantee of packets, and adjust the end-to-end delay of packets with different hops. With this algorithm, the router can avoid maintaining per flow state and avoid complicated per flow buffering and scheduling. So the scalability of the router is improved. Simulation shows that the algorithm has many advantages in the better resource utilization, low jitter of the end-to-end delay and low discarded ratio of the packet.