Congestion management of self similar IP traffic - weighted probability normal and exponential RED

Schemes described in the literature on network congestion management are in general based on queue management. Also it is widely accepted that Poisson model is not sufficient to characterize the traffic in current Internet. In this paper, we first discuss the details of alternate RED (Random Early Detection) algorithm for traffic congestion management in IP networks having self similar input. We proceed by considering the basic scheme of Normal RED as proposed by Floyd et.al. (1993), and Weighted RED for the Poisson input model, and then explain a new AQM (Active Queue Management) proposed by us (Suresh and Gol, 2005). We then discuss a new AQM called Weighted Probability RED proposed for self similar traffic. Our modification to the RED algorithm takes into consideration probability values corresponding to the average queue lengths for computing the marking/dropping probability Verification of the algorithms proposed vis-a-vis Weighted RED as well as the ones proposed by us, has been done by simulating self-similar traffic. Results of the verification have been discussed in the paper