SF-RED - A Novel Server-based AQM to Provide Inter-server Fairness Service

  • Authors:
  • Hsien-Ming Wu;Chin-Chi Wu;Woei Lin

  • Affiliations:
  • National Chung-Hsing University, Taiwan;National Chung-Hsing University, Taiwan;National Chung-Hsing University, Taiwan

  • Venue:
  • ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We design an efficient active queue management (AQM) algorithm, SF-RED, that aims to provide inter-server fairness service in a simple and scalable manner. In the TCP/IP network, it happens that one may intentionally, but in a legal way, generates many "flows" for the same job in order to grab more bandwidth. This will lead to servers' bandwidth allocation unfair, and will thus make ISP pricebased services policy enforcement difficult. We define this as an inter-server fairness problem. There were more than 50 new AQM algorithms which have been proposed since 1999. However, none of them consider the inter-server fairness problem. We study the inter-server fairness problem in traditional AQM, and propose a novel serverbased AQM algorithm for providing fair services to different servers without affecting congestion control performance. We prove the effectiveness of our approach with extensive simulations using ns-2 simulator.