Skip to main content

A Buffer-Management Scheme for Bandwidth and Delay Differentiation Using a Virtual Scheduler

  • Conference paper
  • First Online:
Networking — ICN 2001 (ICN 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2093))

Included in the following conference series:

Abstract

This paper presents a new scalable buffer-management scheme for IP Differentiated Services. The scheme consists of a Differentiated Random Drop (DRD) algorithm using feedback from a virtual scheduler. DRD choses a queue to perform an early packet drop to avoid congestion according to a specific probability function. It will be shown that DRD in conjunction with first-come first-served scheduling is able to support relative service differentiation. The virtual scheduler is introduced to enable service differentiation in terms of bandwidth and delay at the same time. A virtual scheduler runs in parallel to the real scheduler and maintains virtual queue lengths that are being used by the congestion avoidance scheme for packet-drop decisions. Scheduling packets for transmission is performed by the real scheduler only.

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. S.J. Golestani. A Self-Clocked Fair Queuing Scheme for Broadband Applications. ACM Computer Commun. Rev., April 1994.

    Google Scholar 

  2. A.K. Parekh and R.G. Gallager. A Generalized Processor Sharing Approach to Flow Control. June 1993.

    Google Scholar 

  3. D. Stiliadis and A. Varma. Design and Analysis of Frame-Based Fair Queueing: A New Traffic Scheduling Algorithm for Packet-Switched Networks. May 1996.

    Google Scholar 

  4. J. C.R. Bennett and H. Zhang. WF2Q: Worst-case Fair Weighted Fair Queueing.1996.

    Google Scholar 

  5. S. Floyd and V. Jacobson. Link-sharing and Resource Management Models for Packet Networks. IEEE/ACM Trans. on Networking, Vol. 3, No. 4, August 1995.

    Google Scholar 

  6. R. Pletka, P. Droz, and R. Haas. A New Buffer Management Scheme for IP Differentiated Services. Technical Report RZ 3216 (# 93262), IBM Research, Zurich Research Laboratory, March 2000.

    Google Scholar 

  7. S. Blake, D. Blake, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An Architecture for Differentiated Services, RFC2475, December 1998.

    Google Scholar 

  8. J. Heinanen, F. Baker, W. Weiss, and J. Wroclawski. Assured Forwarding PHB Group, RFC2597, June 1999.

    Google Scholar 

  9. S. Bajaj, L. Breslau, D. Estrin, K. Fall, S. Floyd, P. Haldar, M. Handley, A. Helmy, J. Heidemann, P. Huang, S. Kumar, S. McCanne, R. Rejaie, P. Sharma, K. Varadhan, Y. Xu, H. Yu, and D. Z appala. Improving Simulation for Network Research. Technical Report 99-702b, University of Southern California, March 1999.

    Google Scholar 

  10. C. Drovolis, D. Stiliadis, and P. Ramanathan. Proportional Differentiated Services: Delay Differentiation and Packet Scheduling. ACM Computer Commun. Rev. (SIGCOMM’ 99), September 1999.

    Google Scholar 

  11. F. Risso. Decoupling Bandwidth and Delay Properties in Class Based Queueing. Dipartimento di Automatica e Informatica, Politechnico di Torino, 2000.

    Google Scholar 

  12. S. Floyd and V. Jacobson. Random Early Detection Gateways for Congestion Avoidance. ACM Trans. on Networking, August 1993.

    Google Scholar 

  13. R. Guérin, S. Kamat, and V. Peris. Scalable QoS Provision Through Buffer Management. October 1998.

    Google Scholar 

  14. D. Clark and W. Fang. Expicit Allocation of Best Effort Packet Delivery Service. ACM Trans. on Networking, Vol. 6, No. 4, August 1998.

    Google Scholar 

  15. V. Jacobson, K. Nichols, and K. P oduri. An Expedited Forwarding PHB, RFC2598, June 1999.

    Google Scholar 

  16. J. Heinanen and R. Guerin. A Single Rate Three Color Marker, RFC2697, September1999.

    Google Scholar 

  17. J. Heinanen and R. Guerin. A Two Rate Three Color Marker, RFC2698, September1999.

    Google Scholar 

  18. A. Demers, S. Keshav, and S. Shenker. Analysis and Simulation of Fair Queuing Algorithm. ACM Computer Commun. Rev., pp. 3–12, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pletka, R., Droz, P., Stiller, B. (2001). A Buffer-Management Scheme for Bandwidth and Delay Differentiation Using a Virtual Scheduler. In: Lorenz, P. (eds) Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47728-4_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-47728-4_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42302-7

  • Online ISBN: 978-3-540-47728-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics