Buffer management for self-similar network traffic

Traffic self-similar has been discovered to be a ubiquitous phenomenon in communication networks and multimedia systems and it is well known that self-similar traffic can lead to larger queuing delays and higher packet loss rates. Buffer management of queuing systems plays a crucial role in addressing the tradeoff within efficiency measured in terms of overall packet loss and fairness measured in terms of individual source packet loss. Ease of implementation is the key issue while determining the practicality of a dynamic buffer management technique. In this paper, we propose a new Queue Management based on self-similarity of network traffic. We use ns2 to simulate network configurations and we generated traffics with Pareto distribution on ns2 simulator, the numerical results demonstrate performance of proposed algorithm in compared to the other currently implemented buffer management algorithms in ns2.