Name
Title | ||
|---|---|---|
I-Dwrr - An Insolvency Enabled Scheduling Scheme Extending Deficit Weighted Round Robin |
Abstract | ||
|---|---|---|
The allocation of network resources to flows within a computer network is performed using scheduling algorithms with the aim of enabling every flow to receive the required resources to perform well. One of several algorithms proposed in the last decades is the well-known Deficit (Weighted) Round Robin (D(W)RR) scheduling algorithm proposed by Shreedhar and Varghese [1]. It has a low complexity, but at the same time allows fair and weighted sharing of limited resources. Nevertheless, DWRR does not work deadline compliant and active handling of nearly over-delayed packets is not considered. In this paper, we present a novel insolvency enabled extension of the DWRR scheduling algorithm called I-DWRR. It reduces the number of deadline violations by preventing them using an innovative mechanism called Queue Insolvency (QI). The proposed extension provides a lower packet-loss rate for multi-queue scenarios in comparison to DWRR while keeping the occurring latency equal to DWRR. The algorithm and its benefits have been validated through a broad simulation study. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/GLOCOMW.2011.6162542 | 2011 IEEE GLOBECOM WORKSHOPS (GC WKSHPS) |
Keywords | Field | DocType |
Traffic Shaping, Scheduling Algorithm, Fair Queuing, Deficit Round Robin, QoS | Deficit round robin,Scheduling (computing),Computer science,Network packet,Computer network,Real-time computing,Queueing theory,Resource allocation,Traffic shaping,Weighted round robin,Fair queuing,Distributed computing | Conference |
ISSN | Citations | PageRank |
2166-0069 | 0 | 0.34 |
References | Authors | |
2 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patrick-Benjamin Bök | 1 | 0 | 2.03 |
| Katharina Kohls | 2 | 22 | 3.71 |
| York Tüchelmann | 3 | 2 | 2.41 |
| Kolja Kollorz | 4 | 0 | 0.34 |