Evaluation of MMRS and MMRRS packet scheduling algorithms for VOQ switches under bursty packet arrivals

In this article we present scheduling algorithms Maximal Matching with Random Selection (MMRS) and Maximal Matching with Round-Robin Selection (MMRRS) for Virtual Output Queuing (VOQ) switches. Evaluation of the proposed algorithms was performed under Bernoulli and bursty packet arrivals with uniform and non-uniform distribution to output ports. MMRS and MMRRS algorithms achieve 100 % throughput for each traffic model. The results obtained show that these algorithms not only allow to achieve low Mean Time Delay (MTD) but also ensure high fairness in choosing packets for transmission. For each traffic pattern MMRS and MMRRS algorithms have smaller Mean Time Delay than other algorithms for load above 70% (for Bernoulli arrivals), 75% (for bursty packet arrivals).