Dynamic Scheduling Algorithm for input-queued crossbar switches

Abstract — Crossbars are main components of communication switches used to construct interconnection networks. Scheduling algorithm controls contention in switch architecture. Several scheduling algorithms were proposed for input-queued crossbar switch architectures. This paper suggests a Dynamic Scheduling Algorithm (DSA). This algorithm changes the priority rotation dynamically based on two parameters: queue occupancy and quality of service of input and output. DSA efficiently utilizes the buffers and at the same time gives good service to the selected inputs and outputs. The simulation results show that DSA saves loss of the cells due to buffer overflow and thus increases the throughput by 2 % to 4 % compared to its counter part. DSA reduces the latency for prescribed Quality of Service class inpu