Output-Oriented Queued Switch Architecture with Input Conflict-Free Algorithm
Gao Zhi · Chinese Journal of Computers · 2010
This paper proposes a new packet switching architecture,called output-oriented queued (OOQ) switch.Unlike any existing switching architectures,OOQ stores cells at input units,while the requests for scheduling is queued at output units.With a novel input conflict-free (ICF) algorithm proposed by the authors,the bandwidth requirement of memories in the switch remains the same as in traditional input-queued switches.To support ICF algorithm,a hardware-based scheduling matrix is also proposed to make the complexity of the algorithm linear as the switch size.And each step of the scheduling consists of only one parallel bitwise and operation.This paper also prove that the sufficient condition for OOQ/ICF to be stable under any admissible traffic is to use the transfer speedup of 2.Finally,the simulation results show that under uniform traffic,delays of OOQ/ICF without speedup are comparable to the mainstream switches but with much better delay jitters.Furthermore,with the speedup of 2,the delay performance of OOQ/ICF is exactly the same as the output-queued switch.While under non-uniform traffic,the throughput of OOQ/ICF is better than current mainstream switches,and achieves 100% when using the speedup of 1.14.