An improved fair traffic shaping algorithm for high speed packet switches

Abstract

This paper presents an improved fair traffic shaping algorithm for high speed packet switches. This algorithm introduces a resorting process to resolve the contention of multiple cells which are all eligible for transmission in the traffic shaper. By using the resorting process based on the each connection's rate, we can give better fairness and flexibility in the bandwidth assignment for connections with wide range of rates. Compared with the departure event driven traffic shaping algorithm (DEDTS), we can reduce the shaping delay for high rate connections without increasing the total available bandwidth. From simulation experiments, we show that the proposed algorithm can implement the natural prioritization for connections based on their individual rates, and improve the fairness in the bandwidth assignment. A hardware implementation architecture for this algorithm is also given.