Skip to main content
SpringerLink
Log in

Integrating Priority with Share in the Priority-Based Weighted Fair Queuing Scheduler for Real-Time Networks

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

The Weighted Fair Queuing (WFQ) scheduler has been closely studied due to its desirable properties of bandwidth guarantee and bounded delay. However, the queuing delay bound of a communication session is tightly coupled with the session's allocated service share. To receive a low queuing delay, a session must reserve a high share. In this paper, we study a new fair queuing algorithm called Priority-based Weighted Fair Queuing (PWFQ). PWFQ combines a session's allocated share to achieve the bandwidth guarantee and the session's priority to adjust the delay bound inside a sliding window. The new algorithm decouples the delay from the service share so that a session with a low share but a high priority may still receive a small delay. We analyze the worst-case delay bound of PWFQ and propose a simple algorithm to assign session priorities.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Demers, A., Keshav, S., and Shenker, S. 1990. Analysis and simulation of a fair queuing algorithm. In Journal of Internetworking Research and Experience pp. 3-26. Also in Proceedings of ACM SIGCOMM'89, pp. 3–12.

  2. Parekh, A.K., and Gallager, R.G. 1993. A generalized processor sharing approach to flow control in integrated services networks: the single node case. IEEE/ACM Transactions on Networking 1(3): 344-357.

    Google Scholar 

  3. Parekh, A.K. and Gallager, R.G. 1994. A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Transactions on Networking 2(2): 137-150.

    Google Scholar 

  4. Golestani S. 1994. A self-clocked fair queuing scheme for broadband applications. In Proceedings of IEEE INFOCOMM'94, Toronto, Canada, pp. 636-646.

  5. Goyal, P., Vin, H. and Chen, H. 1996. Start-time fair queuing: a scheduling algorithm for integrated services packet switching networks. In Proceedings of ACM SIGCOMM'96.

  6. Bennett, J.C.R. and Zhang, H. 1996. WF 2 Q: worst-case fair weighted fair queuing. In Proceedings of IEEE INFOCOMM'96, San Francisco, CA, 120-128.

  7. Zhang, L. 1990. Virtual Clock: A new traffic control algorithm for packet switching networks. In Proceedings of ACM SIGCOMM'90, Philadelphia, PA.

  8. Stoica, I., Zhang, H., and Ng, T.S.E. 1997 A hierarchical fair service curve algorithm for link-sharing, real-time and priority services. In Proceedings of ACM SIGCOMM'97, Cannes, France.

  9. Floyd, S., and Jacobson, V. 1995. Link-sharing and resource management models for packet networks. IEEE/ACM Transactions on Networking 3(4): 365-386.

    Google Scholar 

  10. Turner, J. 1986. New directions in communications, or Which way to the information age? IEEE Communication Magazine, 24: 8-15.

    Google Scholar 

  11. Ferrari, D., and Verma, D. 1990. A scheme for real-time channel establishment in wide-area networks. IEEE Journal on Selected Areas in Communications 8(3): 368-379.

    Google Scholar 

  12. Verma, D., Zhang, H., and Ferrari, D. 1991. Guranteeing delay jitter bounds in packet switching networks. In Proceedings of Tricomm'91, Chapel Hill, North Carolina, pp. 35-46.

  13. Zhang, H., and Ferrari, D. 1993. Rate-controlled static-priority queuing. In Proceedings of IEEE INFOCOM'93, San Francisco, CA pp. 227-236.

  14. Zhang, H. 1995. Service disciplines for guranteed performance service in packet-switching networks. In Proceedings of IEEE.

  15. Goyal, P., and Vin, H. 1995. Generalized guaranteed rate scheduling algorithms: a framework. In Technical Report TR-95-30, University of Texas, Austin.

    Google Scholar 

  16. Kurose, J. F., Schwartz, M., and Yemini, T. 1983. Controlling window protocols for time-constrained communication in a multiple access environment. In Proceedings of the 8th IEEE International Data Communication Symposium.

  17. Zhao, W. and Stankovic, J. 1990. A window protocol for transmission of time-constrained messages. In Proceedings. of IEEE Transactions on Computers 39(9): 1186-1203

    Google Scholar 

  18. Zuberi, K., and Shin, K. 1995. Non-preemptive scheduling of messages on controller area network for real-time control applications. In Proceedings of IEEE RTSS'95, pp. 240-249.

  19. Keshav, S. 1998. An Engineering Approach to Computer Networking. Addison-Wesley Publishing Company.

  20. UCB/LBNL/VINT Network Simulator-NS (version 2). URL: http://www-mash.cs.berkeley.edu/ns.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of California, Irvine, CA, 92697-2625

    Song Wang, Yu-Chung Wang & Kwei-Jay Lin

Authors
  1. Song Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu-Chung Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kwei-Jay Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, S., Wang, YC. & Lin, KJ. Integrating Priority with Share in the Priority-Based Weighted Fair Queuing Scheduler for Real-Time Networks. Real-Time Systems 22, 119–149 (2002). https://doi.org/10.1023/A:1013485520989

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1013485520989

Search

Navigation