Queue Management Algorithm Based On The Of Qos Fair Bandwidth Allocation Strategy

With the development of Internet and emergence of new multimedia applications such as IP telephony. VOD and e-commerce, Internet has evolved into an integrated transport network with text, audio and video etc.the existing best-effort service provided by current Internet would be no longer sufficient. QoS control of the multimedia traffic as one of the key techniques in the next generation network is the hotspot of the current computer network research.Recently, the fair allocation of bandwidth come to front due to the wide use of P2P application such as BT, EDonkey and so on, this paper is just about this issue. To achieve this, this paper do a lot of research and analysis.Firstly, this paper does deeply research about some fair queuing algorithms. Analysis the contribution of these algorithms for the fair allocation of bandwidth. In total the faults and the advantages of these algorithms.This paper is focus on CSFQ(Core Stateless Fair Queue) , CSFQ can achieve as well fairness in bandwidth allocation as that implemented by state networks. But there are still several possibilities for improving CSFQ. Its dropping algorithm is derived from non-responsive flows such as UDP flows, and does not suit TCP flows.Lastly, an improved CSFQ algorithm was proposed in consideration of the characters of TCP. There a main improvements in the algorithm, a dropping policy different from that of UDP is employed to TCP. Hence, the fairness of bandwidth allocation between TCP and UDP is well achieved. The experiments results show that the improved algorithm outperforms the conventional CSFQ algorithm by a significant margin in bandwidth allocation fairness when TCP flows share the congestion link with UDP flows.