Skip to main content

Enhanced WFQ Algorithm with (m,k)-Firm Guarantee

  • Conference paper
Embedded Software and Systems (ICESS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3605))

Included in the following conference series:

Abstract

Weighted Fair Queuing (WFQ) is a good approximation of Generalized Processor Sharing (GPS) service principle, and can provide the delay guarantee when the bandwidth and the burst size are assured. Thus, WFQ can not satisfy the stringent delay requirement of some real-time networked applications with large burst size, such as video transmission. In order to better serve these applications, (m,k)-firm guarantee is integrated in QoS architecture. A fluid scheduling algorithm, (m,k)-GPS, and its packet approximating scheduling algorithm, (m,k)-WF2Q ,are proposed. Dropping some optional packets, they guarantee low delay to flows with large burst size. Moreover, the fairness and computing complexity of (m,k)-WF2Q are the same as WF2Q.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Parekh, A., Gallager, R.: A generalized processor sharing approach to flow control-The single node case. ACM/IEEE Transactions on Networking 6, 344–357 (1993)

    Article  Google Scholar 

  2. Chronopoulos, A.T., Yaprak, C., Tang, E.: An Efficient ATM Network Switch Scheduling. IEEE Transactions on Broadcasting 9, 110–117 (2003)

    Google Scholar 

  3. Koubaa, A., Song, Y.Q.: Loss-Tolerant QoS using Firm Constraints in Guaranteed Rate Networks. In: IEEE RTAS 2004, pp. 526–535 (2004)

    Google Scholar 

  4. Bennett, J.C.R., Zhang, H.: WF2Q: Worst-case fair weighted fair queuing. In: IEEE INFOCOM 1996, pp. 120–128 (1996)

    Google Scholar 

  5. Hamdaoui, M., Ramanathan, P.: A Dynamic Priority Assignment Technique for Streams with (m,k)-Firm Deadlines. IEEE Transactions on Computers 12, 1443–1451 (1995)

    Article  Google Scholar 

  6. Lindsay, W., Ramanathan, P.: DBP-M: A technique for meeting the end-toend (m,k)-firm guarantee requirements in point-to-point networks. In: Proceedings of Conference on Local Computer Networks, pp. 294–303 (1997)

    Google Scholar 

  7. Yin, H.X., Wang, Z., Sun, Y.X.: A weighted Fair Queuing Scheduling Algorithm with (m,k)-Firm Guarantee. In: IEEE IECON 2004 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yin, H., Wang, Z., Sun, Y. (2005). Enhanced WFQ Algorithm with (m,k)-Firm Guarantee. In: Wu, Z., Chen, C., Guo, M., Bu, J. (eds) Embedded Software and Systems. ICESS 2004. Lecture Notes in Computer Science, vol 3605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535409_48

Download citation

  • DOI: https://doi.org/10.1007/11535409_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28128-3

  • Online ISBN: 978-3-540-31823-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics