The new MSMPS Packet Scheduling Algorithm for VOQ Switches

Abstract

In this article we present the new algorithm Maximal Size Matching with Permanent Selection (MSMPS). This algorithm offers high efficiency with minimal MTD (Mean Time Delay). This algorithm based on permanent connections between inputs and outputs. When at least two connections without packets to send are found (empty connections), algorithm tries to convert them into better matching with the longest VOQ from the available. Simulations confirm that for large load our algorithm provides better efficiency than other algorithms.

Performance Evaluation of the MSMPS Algorithm under Different Distribution Traffic

“…The reason is that our algorithm focused very much on access alignment for all outputs, instead of avoiding of empty connections. Connections where no packets are to be send through the switch [7]. Above 20% load, efficiency of MSMPS algo-rithm increases and reaches mean value about 0.95 with growing tendency.…”

“…Algorithm gives priority to the most filled VOQs. More details about MSMPS algorithm can be found in [7].…”

“…Numerator is the number of packets passed in n-th time slots through the switching fabric. Denominator is the number of packets which have arrived to the switch buffers in n-th time slot [7].…”

“…Instead, most of the new generation switches and routers use much simpler scheduling algorithms to control and configure switching fabric. One of this kind of algorithms is MSMPS [7], which achieve the similar performance results like the rest of algorithms but does not need to perform a lot of complicated calculation. Other important fact, which influence on switches and routers performance, is switching fabric buffers architecture.…”