A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Last-Backlogged First-Served Deficit Round Robin (LBFS-DRR) Packet Scheduling Algorithm
2007
IEEE International Conference on Networks : Proceedings
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
doi:10.1109/icon.2007.4444108
dblp:conf/icon/NikolovaB07
fatcat:twxyaa3hwzhzhai6f7eqaeawym