A Dynamically Reconfigurable Queue Scheduler

In this paper we present the design and implementation of a dynamically reconfigurable system for packet queue scheduling. Two widely accepted queue schedulers have been implemented in reconfigurable logic in a way that can be interchanged based on the number of active queues and the Quality of Service (QoS) requirements. The first algorithm is the Deficit Weighted Round Robin (DWRR) that is used to support up to 2K queues. The second algorithm is the Worst-case Fair Weighted Fair Queuing (WF2Q+) algorithm that is more accurate and closer to the ideal scheduling but the computation and memory requirements are higher. This scheme is used when the number of active queues is up to 341 queues or classes of services (CoS). The performance evaluation shows that we can exchange these algorithms, thus obtaining higher accuracy, depending on the variant and the characteristics of the network traffic with negligible performance degradation due to the dynamic reconfiguration overhead.

• Type: Conference
• Year: 2006
• Where: FPL
• Authors: Christoforos Kachris, Stamatis Vassiliadis
• Keywords: Active Queues, Deficit Weighted Round Robin, FPL 2006, Hardware, Packet Queue Scheduling