AN EFFICIENT IQ SCHEDULING ALGORITHM WITH DETERMINISTIC DEADLINE IN PACKET SWITCH NETWORK
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 NPcomplete 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.
Input-queued switch quality of service deadline guarantee EDF MLF
Fei Hong Yu Bai
School of Computer Science and Engineering, BeiHang University, Beijing 100083, China School of Science, Beijing University of Civil Engineering and Architecture, Beijing, China
国际会议
北京
英文
1-5
2008-09-26（万方平台首次上网日期，不代表论文的发表时间）