Design of Customer-based AQM Routers to Achieve Fair Inter-server Bandwidth Allocation

There were more than 50 new AQM algorithms which have been proposed since 1999. All of these approaches are designed on per-flow basis. Ideally, long-lived responsive flows will get their fair shares of bandwidth under the congestion control of a well designed AQM. However, responsive flows may sent by a unresponsive server. This will introduce so-called inter-server fairness problem, and will also make ISP price-based services policy enforcement difficult. We study the inter-server fairness problem, and propose a simple and deployable server-based AQM approach, in which grouping techniques is used to reduce the states needed to keep. This approach can provide fair services to different servers without affecting congestion control performance in terms of packet loss rate and queue stability. We prove the effectiveness of our approach with extensive simulations using ns-2 simulator