1. Submitters: Erez Rokah Erez Goldshide Supervisor: Yossi Kanizo Networked Software Systems Laboratory Department of Electrical Engineering Technion - Israel Institute of Technology

2. Motivation A switch is a computer networking device that connects network segments Switches form the Internet infrastructure It is critical for switches to be fast, with high throughput, reliable, modular, cost and power effective We will evaluate switches with the following measure in mind: Throughput.

3. Project Goals Studying the current high-speed switch architectures Evaluation of current switching architectures Simulate the basic switching architectures mentioned above Compare to the theorem and mathematical analysis Object Oriented Design (using C#) Modular Design

4. Simulation Flow Input Generator generates cells for current cycle Input cells are inserted into the switch queues Logger logs current cycle results The switch scheduler decides which queues are processed and outputs the corresponding cells

5. Simulation Result Example 32x32 CQ switch under trace-based traffic

6. Conclusions All switches, provided that the queues’ capacity is high enough, can reach near 100% throughput. Exhaustive scheduling algorithms are best when using small sized queues with burst income traffic. The “Longest Queue First” algorithm gives the overall best results for a Crosspoint Queued Switch.