Table 4 Summary of scheduling algorithms
From: Discretionary bandwidth granting scheme for homogenous real-time applications
Scheduling algorithm | Required information | For bandwidth request/grant protocol? |
|---|---|---|
None | Yes, classical approach. As a benchmark in this study. | |
RR | None | Yes, but no proposal in bandwidth request/grant protocol yet. It has been developed in this study for benchmarking purpose. |
QoS precedence | Yes, but no difference in homogeneous traffic. As benchmark in this study. | |
Peak packet rate and minimum packet rate | No packet information | |
Sun and Gani [24] | EDF + channel information | Same issues as in EDF |
WDRR | HoQ/HoL of the packet | No packet information |
WFQ | Packet size and channel capacity, finishing time | No packet information |
No finishing time info | ||
SCFQ | Packet size and channel capacity, finishing time | No packet information |
No finishing time info | ||
WF2Q | Time tags of every packet | No packet time info |
EDF [18] | Earliest deadline of the maximum latency | No packet time information |
Najah et al. [20] | EDF +WFQ + FIFO and EDF + WFQ | Same issues as in EDF and WFQ |
Yuan and Duan [21] | Quantum value, maximum packet size and frame size | No information on packet size |
Garroppo et al. [22] | Throughput | For non-real-time applications |