An efficient IQ scheduling algorithm with deterministic deadline in packet switch network
Fei Hong, Yu Bai · China-Ireland International Conference on Information and Communications Technologies (CIICT 2008) · 2008
In this paper, input-queued switches with deterministic deadline have been considered, where each packet has an associated deadline. Efficient schedule is needed to transfer every packet to its destined output port before its deadline. Recently, this scheduling problem has been proved to be NP- complete if three or more classes (distinct deadlines) are present in the set. In this paper, we propose an efficient algorithm for this scheduling problem. Achieving differential QoS provision in IQ switches. Through algorithm analysis and simulations, performance evaluation has been carried out with other well-known existing heuristic algorithms including EDF, MLF. The results show that this new algorithm solves the deadline guaranteed packet scheduling problem with much higher success rate and much lower packet drop rate.