Buffer architectures and routing algorithms in the performance of Shufflenet

Shufflenet achieves high throughput by allowing different users in the network to transmit information concurrently through different channels. Because optical memory can be expensive, a shufflenet with deflection routing has been proposed. The authors investigate four control strategies (CS) using different routing algorithms and buffer architectures. The performance of the control strategies is studied by simulating in 64-node (2,4) shufflenet with deflection routing. Trade-offs between throughput, buffer cost and routing complexity in the network are observed and discussed. It is concluded that CFDL (`Care´ packet First, `Don´t Care, packet Last) is a very effective routing algorithm. The shufflenet performs very well with deflection routing, even when only a few buffers are provided at each node in the network