Evolution and Optimization of Active Queue Management Algorithms over High Bandwidth Aggregates

Abstract

ABSTRACT Due to enormous growth of the Internet, demands for access from multiple users and request for new services for its applications have also increased significantly. In a result there is a rise in packet loss rates and drop in network efficiency. In addition, the inability to support new services has severely hindered the widespread deployment of bandwidth-sensitive applications. So the success of TCP / IP depends on its ability to deliver services in time of extremely high demand and hence various congestion control mechanisms ensure this ability to prosper. The idea behind TCP congestion control is to control network load by having sources adjust their rates according to the level of congestion in the network. This paper focuses on how congestion control and queue management techniques have evolved in due course of time and being modified to minimize the rate of packet loss. Considering RED being most important of all we have optimized the algorithm by challenging the linearity of marking/dropping probability. We conduct a survey by applying different possible functions in contrary to the linear behavior of dropping probability for evaluating their performance in comparison to RED. We implement the optimized RED by simulating a multicast network for TCP flows.