Evaluation of per-server fair bandwidth allocation using CS-RED

摘要

A new fair bandwidth allocation among content providers is evaluated. Because of network resources are shared between competitive content providers, providing fairness of allocated bandwidth is essential for content providers. Because of content server distributes data to many users, the aggregate data transmission rate of server will be made equal to the rate of another server. A router mechanism is thus needed that can allocate bandwidth fairly among servers. In this paper, the characteristics of fair bandwidth allocation among servers are evaluated using core-stateless random-early-detection (CS-RED). This algorithm can improve the fairness characteristics. It can be used in a distributed architecture, as can the core-stateless fair-queuing (CSFQ) algorithm CS-RED can allocate bandwidth fairly between flows cooperating with TCP protocol. Evaluation of the CS-RED algorithm by computer simulation and evaluation of the fairness characteristics in networks using either the CS-RED showed that a higher level of fairness is achieved without degrading link utilization.