Guaranteeing fairness and protection in ABR by means of fair queueing

We propose a new switch algorithm for the support of the available bit rate service category based on fair queueing cell scheduling. We have developed a mechanism to estimate the fair rate for each connection from the bandwidth allocated by the scheduling algorithm at the switch port. The most important advantage of this solution is that fair scheduling enforces fairness and protection. We present simulation results showing that this algorithm is efficient, fair and stable. Furthermore, it allows the allocation of available bandwidth according to various fairness criteria other than the max-min criterion