Research On Achieving Fairness Based On Congestion Control Mechanism

With the quick development of the Internet, rapid growthof Internet users, as well as the appearance of variedmultimedia applications has brought the rapid growth ofInternet traffic which causes network congestion. Networkcongestion has become a significant problem that prevents thedevelopment and application of Internet. Now, becausedifferent, applications and users share the network bandwidth,the fairness of bandwidth allocation has been becoming more andmore important when network congestion occurs. People have mademany researches on the mechanism of bandwidth allocation, andthis paper has made further research on the mechanism ofbandwidth allocation based on the earlier researches.This paper firstly introduces the network congestionphenomenon, the development researching of congestion controlalgorithms, and emphasizes to elaborate the two algorithms: oneis based on source edges; the other is based on touters. Next,it extensively addresses the fairness problem in network andanalyzes some major Active Queue Management(AQM) algorithmswhich solve the fairness of network.Currently, AQM as the major scheme of congestion controlhas aroused tremendous interest and vase studies. At the timeof carrying out congestion control, fair bandwidth allocationbecomes a very important aspect of measuring AQM schemesperformances. So, the paper focuses on fairness of theCore-Stateless Fair Queuing (CSFQ) algorithm. It proposes animproved CSFQ (MCSFQ) algorithm and verifies its fairness bythe simulation on NS-2. The simulation results indicate that the fairness performance of the MCSFQ algorithm is better than theoriginal one.