Scalable QoS provision through buffer management

  • Authors:

  • R. Guérin;S. Kamat;V. Peris;R. Rajan

  • Affiliations:

  • IBM, T.J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY;IBM, T.J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY;IBM, T.J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY;IBM, T.J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY

  • Venue:
  • Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

In recent years, a number of link scheduling algorithms have been proposed that greatly improve upon traditional FIFO scheduling in being able to assure rate and delay bounds for individual sessions. However, they cannot be easily deployed in a backbone environment with thousands of sessions, as their complexity increases with the number of sessions. In this paper, we propose and analyze an approach that uses a simple buffer management scheme to provide rate guarantees to individual flows (or to a set of flows) multiplexed into a common FIFO queue. We establish the buffer allocation requirements to achieve these rate guarantees and study the trade-off between the achievable link utilization and the buffer size required with the proposed scheme. The aspect of fair access to excess bandwidth is also addressed, and its mapping onto a buffer allocation rule is investigated. Numerical examples are provided that illustrate the performance of the proposed schemes. Finally, a scalable architecture for QoS provisioning is presented that integrates the proposed buffer management scheme with WFQ scheduling that uses a small number of queues.