Abstract — In this paper, we consider self-randomized scheduling policies for input buffered switches. We provide a general architecture for the design of self-randomized algorithms. The common trend in the design of self-randomized schedulers is to use the number of backlogged cells as the weight function and to use instantaneous cell arrival graph to generate a candidate matching for scheduling. We discuss some of the shortcomings of this approach, and introduce the total arrival graph as an alternative for instantaneous arrival graph to improve the performance. We also introduce the concept of maxmin fair selfrandomized scheduling algorithms. The idea here is to introduce self-randomized algorithms that can provide QoS by sharing the switch bandwidth proportional to some assigned weights. In order to study and compare the performance of the proposed scheduling algorithms, several simulations are carried out and their results are provided and discussed. I
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.