Multi-next-hop Switching fabric and scheduling algorithm

Traditional single next-hop routing has been unable to meet the needs of the increasing network applications. Based on multi-hop routing mechanism, this paper proposes a multi-output Switching fabric and dual pointer maximum-weight-first scheduling algorithm. On the basis of distinguish queuing, the algorithm uses dual pointers to schedule the single output and multi-output packets to achieving distributed scheduling and dynamic matching. Simulation results show that the switching fabric has better delay performance under multi-next-hop routing. The algorithm guarantees throughput and delay performance, meanwhile reducing implementation complexity and improving the processing speed of switching fabric.