Burst Shaping Queueing
Key: DKS03-1
Author: Vasilios Darlagiannis, Martin Karsten, Ralf Steinmetz
Date: January 2003
Kind: In proceedings
Publisher: SCS
Book title: Computer Networks and Distributed Systems (WMC)
Keywords: burstiness, network queues, shaping, scheduling, load balance
Abstract: In this paper, we present a novel queue management mechanism, called Burst Shaping Queueing (BSQ). The main objective is to minimize the burstiness of the traffic on packet switched routers, by interleaving packets that are going to follow different links on next hops. The complexity of that algorithm is O(1), which makes it deployable in high speed networks. <p>From the simulated experiments we performed, it is proven that BSQ offers a better trade-off between link utilization and end-to-end delay, compared with other queueing mechanisms. Combined with RED, it can improve the link utilization, without any significant increase on the end-to-end delay.</p>
View Full paper (PDF) | Download Full paper (PDF)

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.