Controlling mean queuing delay under multi-class bursty and correlated traffic
Journal of Computer and System Sciences
| Hi-index | 0.00 |
One of the main challenges in the internet backbone is to provide an adequate quality of service (QoS) and this can be done by either adopting a suitable buffer management method or by QoS routing. One of the popular buffer management algorithms used is random early detection (RED) which falls into the category of Active Queue Management (AQM) algorithms. There are many variant algorithms based on RED including adaptive RED and in this paper a new AQM algorithm which depends on changing the maximum dropping probability in a way that has been shown by simulation to have a similar throughput and lower delay than either RED or adaptive RED is proposed.