Nikolova, D and Blondia, C (2007) Last-Backlogged First-Served Deficit Round Robin (LBFS-DRR) packet scheduling algorithm. In: 2007 15TH IEEE INTERNATIONAL CONFERENCE ON NETWORKS. (pp. 161 - 166). IEEE
Full text not available from this repository.
Abstract
In this article we present a novel packet scheduling algorithm LBFS-DRR, which combines features from the Last-Come First-Served scheduling discipline and the Deficit Round Robin (DRR) algorithm. In comparison with DRR it provides lower average packet delay, while preserving the advantageous feature like O(1) complexity, fairness, bandwidth guarantee. The lower mean delay is realized by giving service in a round first to flows transmitting bellow their (weighted) fair share. The algorithm exploits the high variability in the typical user traffic pattern resulting in lower mean file transfer delay.
| Type: | Proceedings paper |
|---|---|
| Title: | Last-Backlogged First-Served Deficit Round Robin (LBFS-DRR) packet scheduling algorithm |
| Event: | 15th IEEE International Conference on Networks |
| Location: | Adelaide, AUSTRALIA |
| Dates: | 2007-11-19 - 2007-11-21 |
| ISBN-13: | 978-1-4244-1229-7 |
| UCL classification: | UCL > School of BEAMS > Faculty of Maths and Physical Sciences > London Centre for Nanotechnology |
Archive Staff Only: edit this record