Performance of the Modified Round Robin Scheduling Algorithm for Input-Queued Switches Under Self-Similar Traffic

The iSLIP algorithm has been proved to be a very efficient, high throughput scheme for scheduling in input-queued switches. In this paper, we discuss a Modified Round Robin (MRR) scheme, which involves less number of arbitration steps in each iteration when compared to iSLIP. We prove through simulation studies, that the MRR algorithm shows a performance equivalent to iSLIP, but requires less number of processing steps. We compare the performance of the two algorithms under different types of traffic, including Bernoulli independent identically distributed (i. i. d) and bursty traffic. We study the load- delay performance for different switch sizes and for traffic of different burst lengths. We also consider several traffic generation models for generating self-similar traffic and study the performance of both the algorithms under this type of traffic.