An Urgency Based Self-clock Start-Time Fair Queuing Packet Scheduling

Liu Wen-bo; Guo Yun-fei; Ma Hai-long

doi:10.3724/SP.J.1146.2009.00781

Volume 32 Issue 6

Jun. 2010

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2010 > 32(6): 1452-1456

Liu Wen-bo, Guo Yun-fei, Ma Hai-long. An Urgency Based Self-clock Start-Time Fair Queuing Packet Scheduling[J]. Journal of Electronics & Information Technology, 2010, 32(6): 1452-1456. doi: 10.3724/SP.J.1146.2009.00781

Citation:

Liu Wen-bo, Guo Yun-fei, Ma Hai-long. An Urgency Based Self-clock Start-Time Fair Queuing Packet Scheduling[J]. Journal of Electronics & Information Technology, 2010, 32(6): 1452-1456. doi: 10.3724/SP.J.1146.2009.00781

Citation:

PDF( 205 KB)

An Urgency Based Self-clock Start-Time Fair Queuing Packet Scheduling

doi: 10.3724/SP.J.1146.2009.00781

Received Date: 2009-05-22
Rev Recd Date: 2009-10-08
Publish Date: 2010-06-19

Abstract

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.

FullText(HTML)

References(1)

References

Parekh A K. A generalized processor sharing approach to flow control in integrated services networks. [Ph.D. dissertation], Dept. Elec. Eng. Comput. Sci., MIT, 1992.[2]Bennett J C and Zhang H. WF2Q: Worst-case fair weighted fair queueing[J].Proceedings of IEEE INFOCOM96, San Francisco, Mar.1996, Vol. 1:120-128[3]Golestani S J. A self-clocked fair queueing scheme for broadband applications. Proceedings of IEEE INFOCOM94, Toronto, CA, April 1994: 636-646.[4]Goyal P, Vin H M, and Chen H. Start-time fair queuing: A scheduling algorithm for integrated services. Proceedings of the ACM-SIGCOMM96, Palo Alto, CA, August 1996: 157-168.[5]Shreedhar M and Varghese G. Efficient fair queuing using deficit round robin[J].IEEE/ACM Transactions on Networking.1996, 4(3):375-385[6]Kanhere S S and Sethu H. Fair, efficient and low latency packet scheduling using nested deficit round robin. Proceedings of the IEEE Workshop on High Performance Switching and Routing, Dallas, TX, May 2001: 6-10.[7]Zhao Q and Xu J. On the computational complexity of maintaining GPS clock in packet scheduling[J].Proceedings of IEEE INFOCOM04, Hong Kong, Mar.2004, Vol. 4:2383-2392[8]Gebali F. Analysis of Computer and Communication Networks. 1st edition, Berlin: Springer, 2008: 449-467.[9]Akesson B, Steffens L,and Strooisma E,et al.. Real-time scheduling using credit- controlled static-priority arbitration. Proceedings of IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, Kaohsiung, Taiwan, Aug. 2008: 3-14.[10]Bredel M and Fidler M. Understanding fairness and its impact on quality of service in IEEE 802.11. Proceedings of IEEE INFOCOM09, Rio de Janeiro, Brazil, April. 2009: 1669-1677.

Relative Articles

Supplements(0)

Cited By

Proportional views