Prioritized Queue with Round Robin Scheduler for Buffered Crossbar Switches

N. Narayanan Prasanth; Kannan Balasubramanian; R. Chithra Devi

Prioritized Queue with Round Robin Scheduler for Buffered Crossbar Switches

N. Narayanan Prasanth ¹, Kannan Balasubramanian ², R. Chithra Devi ³

Affiliations
1 Department of Information Technology, National College of Engineering, India
2 Department of Computer Science and Engineering, Mepco Schlenk Engineering College, India
3 Department of Information Technology, Dr. Sivanthi Aditanar College of Engineering, India

Research in high speed switching systems is in greater demand as the internet traffic gets rapid increase. Designing an efficient scheduling algorithm with high throughput and low delay is an open challenge. Most of the algorithms achieve 100% throughput in uniform traffics but failed to attain the same performance under non-uniform traffics. Moreover these algorithms are also suffers from starvation leads to extended waiting time of VOQ. In this paper, Prioritized Queue with Round Robin Scheduler (PQRS) is proposed for Buffered Crossbar Switches. We proved that our proposed scheduler can achieve 85% throughput under any non-uniform traffic without starvation.