Class-based weighted fair queuing scheduling on quad-priority Delta Networks
- 13 August 2012
- journal article
- research article
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 27 (5) , 435-457
Abstract
Contemporary networks support multiple priorities, aiming to differentiate the quality of service (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 are widely used as a scheduling technique since it is easy to implement and prevent 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 modelling 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.Keywords
This publication has 22 references indexed in Scilit:
- SRR: An$O(1)$Time-Complexity Packet Scheduler for Flows in Multiservice Packet NetworksIEEE/ACM Transactions on Networking, 2004
- Switch fabric architecture analysis for a scalable bi-directionally reconfigurable IP routerJournal of Systems Architecture, 2004
- The performance of the Cedar multistage switching networkIEEE Transactions on Parallel and Distributed Systems, 1997
- Efficient fair queuing using deficit round-robinIEEE/ACM Transactions on Networking, 1996
- Survey of ATM switch architecturesComputer Networks and ISDN Systems, 1995
- Performance analysis of finite buffered multistage interconnection networksIEEE Transactions on Computers, 1994
- Switching modules for ATM switching systems and their interconnection networksComputer Networks and ISDN Systems, 1993
- VirtualClockACM Transactions on Computer Systems, 1991
- Performance analysis of buffered Banyan networksIEEE Transactions on Communications, 1991
- Performance Analysis of a Packet Switch Based on Single-Buffered Banyan NetworkIEEE Journal on Selected Areas in Communications, 1983