GRED was proposed as an AQM method that controls congestion at router buffers preliminary .
Whereas if the aql value is between the positions of min threshold and double max threshold, a congestion situation is existed at the GRED router buffer, and the GRED router buffer controls congestion by dropping packets probabilistically, i.
L] results than other AQM methods such as RED (see ), GRED and Adaptive GRED (see the below Figure 9).
In order to enhance GRED's performance in existence of congestion, the adaptive GRED method was presented , i.
Figure 7: The pseudocode of the Adaptive GRED method in detail.
5 SIMULATION INFORMATION OF GRED, REDD1 AND ADAPTIVE GRED
Simulations are conducted on the methods of GRED, REDD1 and the Adaptive GRED utilising discrete-time queues mechanism [5, 26], which it uses a slot as a time unit.
A comparison is conducted between GRED, REDD1 and the Adaptive GRED with respect to several performance measures (mql, T, D, [P.
Table 1 shows mql, T and D results of the GRED, REDD1 and the Adaptive GRED versus [alpha].
It is clarified in Table 1 that GRED, REDD1 and the Adaptive GRED offer similar performance measure results with reference to mql and D when [alpha] is either 0.
The REDD1 loses fewer amounts of packets due to overflow at its router buffer than those of GRED and the Adaptive GRED, and therefore the REDD1 router buffer is dropped larger amounts of packets than those of GRED and the Adaptive GRED before their router buffers have overflowed.