A robust switch architecture for bursty traffic

Abstract

A novel way of building switch system architectures, based on the combination of an output-buffered switch with input queues that sort arriving packets on a per-output-port basis, is proposed that has a scheduling complexity of O(N). Simulation results to demonstrate the high and robust performance achieved with the proposed system architecture are presented, and a practical implementation is outlined.