Class-Based Weighted Fair Queuing Scheduling on Quad-Priority Delta Networks

D. C. Vasiliadis, G. E. Rizos, C. Vassilakis
to appear in International Journal of Parallel, Emergent and Distributed Systems, Taylor & Francis

Abstract:

Contemporary networks support multiple priorities, aiming to differentiate the QoS levels offered to individual traffic classes. Support for multiple priorities necessitates the introduction of a scheduling algorithm, to select each time the next packet to transmit over the data link. Class-based Weighted Fair Queuing (CBWFQ) scheduling and its variations, is widely used as a scheduling technique, since it is easy to implement and prevents the low-priority queues from starvation, i.e. receiving no service during periods of high-priority traffic. CBWFQ effectively thus offers low-priority queues the opportunity to transmit packets even though the high-priority queues are not empty. In this paper, we present the modeling and performance evaluation of a single-buffered, four-priority multistage interconnection network (MIN) operating under the CBWFQ scheduling policy. Performance evaluation is conducted through simulation, and the performance metrics obtained can be used by MIN designers to set the appropriate queue weights according to the expected traffic and the desired QoS levels for each priority class, delivering efficient thus systems.

Note: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.