Dynamic Weighted Round Robin in Crosspoint Queued Switch

Achievement of desired performance levels (quality of service - QoS) in switches and routers is one of the most important tasks in switching systems. This implies providing guaranteed throughput, cell loss probability, average and maximal latency within the required bounds. To achieve this task in crosspoint queued switch, we implemented the weighted round robin (WRR) algorithm. We showed that WRR algorithm can achieve very good performance levels regarding the throughput and latency, but had major drawback because it require knowledge of arrival traffic. To overcome this problem, we implemented and presented in this paper the dynamic weighted round robin (DWRR) algorithm that can work with unknown arrival traffic. We showed that DWRR can achieve same performance as WRR, without the need for incoming traffic information, which makes it suitable for practical implementation.