|
|
An Urgency Based Self-clock Start-Time Fair Queuing Packet Scheduling |
Liu Wen-bo; Guo Yun-fei; Ma Hai-long |
National Digital Switching System Engineering & Technological R&D Center, Zhengzhou 450002, China |
|
|
Abstract In order to get over the limitation of the GPS(Generalized Processor Sharing) like queuing algorithms which the bound of the queuing delay is so long and unstable that is undesirable for the packets of real-time applications, a new packet queuing and scheduling algorithm is proposed. In this algorithm the competitions of the arrival packets are fine-tuned by means of adding a function of flow urgency degree on the computation of their service tags, so the transmitting priorities of the arrival packets can be tuned according to their real-time applications’ needs, therefore the queuing delay and the bounds of oscillation are cut down significantly. According as the analysis and the simulation, this packet queuing and scheduling algorithm can resolve the long and unstable packet latencies problem for real-time applications, and shares both the bounded-delay and fairness properties of the GPS like algorithms, and the computation of its system virtual time is simple and efficient.
|
Received: 22 May 2009
|
|
Corresponding Authors:
Liu Wen-bo
|
|
|
|
|
|
|