Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic scheduling in packet-switched networks: analysis, design, and implementation
Traffic scheduling in packet-switched networks: analysis, design, and implementation
Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers
IEEE/ACM Transactions on Networking (TON)
Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving Schedulers
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.00 |
Many of scheduling algorithms that provide a predefined bandwidth to a traffic flow fall into a category of Latency-rate ($\mathcal{LR}$) server. A series of $\mathcal{LR}$ servers can be viewed as a virtual node with an $\mathcal{LR}$ server of the latency which is simply the summation of individual latencies of actual $\mathcal{LR}$ servers. Deficit Round Robin (DRR) is such an $\mathcal{LR}$ server and the simplest one to implement, so that it is adopted in many real systems. In this research we suggest a novel policy of Instant Service, which is applicable to any round-robin schedulers. We then apply this policy to DRR, make a variation called DRR with Instant Service (DRR-IS), and analyze it. We prove that the DRR-IS is still an $\mathcal{LR}$ server. We calculate its latency and investigate its fairness characteristics. We demonstrate the DRR-IS, compared with DRR, provides about 30% better latency while have the same complexity and the same fairness.