|
|
|
|
|
Designed by |
|
 |
|
|
|
 |
Scalable QoS
Provision Through Buffer Management
R. Guérin, S. Kamat, V. Peris, and R. Rajan(IBM)
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
environ ment 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 re quirements
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 band width is
also addressed, and its mapping onto a buffer allocation rule is
investigated. Numerical examples are provided that illus trate 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.
|
|
Ghostview