TA-iSLIP: A Traffic Adaptive iSLIP Scheduling Algorithm

Today, iSLIP scheduling algorithm is widely employed in high performance switches and routers, but its performance decreases dramatically under the burst traffic. A traffic adaptive algorithm based on iSLIP, TA-iSLIP, which iterates the scheduling decision between slots, is proposed in this paper. To make good use of the matched resources and decrease the system matching overhead, this algorithm intelligently estimates the traffic type using queue length, and then adopts different processing methods accordingly. Simulation results show that TA-iSLIP can achieve high performance under both the uniform and non-uniform traffics.