Red with reconfigurable maximum dropping probability

Abstract

The continued demand for improved quality of service for the Internet network is an incentive to find new methods and means to reduce the impact of congestion on the network. The Random Early Detection (RED) algorithm is one of the commonly used algorithms in Internet routers to reduce the problem of congestion. However, network performance and QoS cannot be improved based on fixed and predefined parameters in RED algorithms. Therefore, many researchers have looked to use the adjustment approach (adaptation methods) which does not depend on determining the level of congestion on predefined assumptions. In this paper, an improved RED algorithm for multimedia traffic is proposed by using reconfigurable approach to redefining one of the RED parameters, maximum dropping probability (max p ), with changing the traffic over the network. The proposed algorithm, named as “RED with Reconfigurable Maximum Dropping Probability (RRMDP)”, aims to reduce the average queue size and then queuing delay time without sacrificing in the packet dropping rate and link utilization. OPNET simulation is offered to support the idea. The result of the simulation shows a significant improvement in the average queue size and queuing delay comparing to the RED and ARED algorithms.