Starvation Free Scheduler for Buffered Crossbar Switches

Need for high speed internet connectivity has led to a substantial research in switching systems. Buffered crossbar switches have received a lot of attention from both research and industrial communities due to their flexibility and scalability. Designing a scheduling algorithm for buffered crossbar switches without starvation is a major challenge as of now. In this paper, we propose a Delay based prioritized queue with round-robin scheduler (DPQRS) which uses no speedup. Simulation result shows that DPQRS reduces the starvation considerably with maximum throughput and minimum delay comparable to PQRS and LQF-RR.