Research On Active Queue Management Algorithms Based On Fairness

With the development of network technology the network scope extended rapidly, especially in 1990s', the Internet based on IP presented a tremendous increase and Internet has grown up to be the essential global information facility. With the network of new-pattern avalanched and the network user increased rapidly, the Internet data flow is increasing sharply. Internet is no longer a network only for transmitting data; it has turned to be the most important method of information communication and the most compositive network which carry all kinds of multimedia information, such as data, sound, video etc.The rapid development of network and the implement of all kinds of network business make the Internet a huge and intricate network. As a result the problem of network congestion has come forth inevitably, and it causes a decreasing business index and a inefficient network. So people are paying more attention to the congestion control which is going to be a important rule to guarantee the robustness and network working smoothly.Currently, AMQ as the major scheme of congestion control has aroused tremendous interest and vase studies. At the time of carrying out congestion control, fair bandwidth allocation becomes a very important aspect of measuring AQM schemes performances. So, the paper focuses on fairness of the CHOKe(CHOose and Keep for responsive flows CHOose and Keep for unresponsive flows) algorithm based on research on RED(Random Early Detection) algrithm. It proposes an improved CHOKe(WFCHOKe) a1gorithm and verifies its fairness by the simulation on NS2. The simu1ation resu1ts indicate that the fairness performance of the WFCHOKe algorithm is better than the original one.