Class-based weighted fair queuing scheduling on quad-priority Delta Networks

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.

Asymptotics of waiting time distributions in the accumulating priority queue

“…Such a priority scheduling is, in particular, effective if the fraction of high-priority customers is low, since the waiting times of these customer can be reduced vastly without significantly increasing the waiting times of the other customers. However, in case of numerous high-priority customers (even occasionally), queues with a priority scheduling suffer from starvation of the low-priority customers [11,19].…”

Impact of Raising Switching Stages on the Reliability of Interconnection Networks

“…Performance and cost are two key parameters in selecting an appropriate IN. In addition, MINs are one of the cost-effective options to meet these needs [5][6][7][8][9][10][11][12][13][14][15][16][17]. On the other hand, reliability is an essential requirement for improving the efficiency of these networks [18][19][20][21][22][23][24][25][26].…”

“…(10) through(12), the numerical results of time-dependent terminal reliability analysis for network sizes (N) of 8, 128, and 512, as a function of time are summarized in table 1. First, consider the network size of 8.…”