A Scheduling Algorithm Based on Credit in Variable-length Packet Parallel Switching Network
一种基于Credit的变长分组并行交换网络调度算法

A new scheduling algorithm in Parallel Packet Switch(PPS) is proposed in this paper . This algorithm eliminates out-of sequence of the cells belonging to a packet by dispatching the traffic with variable-length packet at de-multiplexer. It balances the traffic distribution to each parallel switch by a credit based mechanism. The combined input and output queued(CIOQ) mechanism is adopted with each parallel switch in this algorithm, which not only degrades the speed-up requirement of the buffer and switch, but also takes full advantage of the available research achievements of scheduling algorithm in Crossbar switches. Theoretical analysis is made on the fairness of traffic distributions, the amount of the required high-speed buffer (run in line-speed) and the stability of the network. The simulation analysis shows the good performance of this algorithm further.