Favqchoke: To Allocate Fair Buffer to A Dynamically Varying Traffic In An IP Network

Abstract

Listen

Translate article

In IP networks, AQM attempts to provide high network utilization with low loss and low delay by regulating queues at bottleneck links. Many AQM algorithms have been proposed, most suffer from instability of queue, bursty packet drop, require careful configuration of control parameters, or slow response to dynamic traffic changes and unfairness. The deployment of active queue management techniques such as RED based is used that results in increased bursty packet loss and unfairness caused by an exponential increase in network traffic. The inherent problem with these queue management algorithms is that they all use queue lengths as the indicator of the severity of congestion. In order to solve this problem, a new active queue management algorithm called FAVQCHOKe is proposed. In this paper, arrival rate at the network link is maintained as a principal measure of congestion to improve the transient performances of the system and ensures the entire utilization of link capacity. In addition this proposed algorithm uses queue length and flow information that enhances fairness. This characteristic is particularly beneficial to real-time multimedia applications. Further, FAVQCHOKe achieves the above while maintaining high link utilization and low packet loss. This paper discusses about the inherent weaknesses of current techniques and how the proposed algorithm overcomes the weaknesses and ensures high degree of effectiveness in the performance of the system.