Performance analysis of packet schedulers in high-speed serial switches

O Gusak, N Oliver, K Sohraby - … and Information Sciences-ISCIS 2003: 18th …, 2003 - Springer
O Gusak, N Oliver, K Sohraby
Computer and Information Sciences-ISCIS 2003: 18th International Symposium …, 2003Springer
In this work we examine the performance of arbitration algorithms for core high-speed serial
switches (HSSS). Taking Infiniband as an example, experimental results show that, for a
homogeneous network load, the average queuing delay for the switch output ports under the
weighted round-robin (WRR) algorithm defined for InfiniBand is similar to the average
queuing delay resulting from the largest delay-first (LDF) or first-in-first-out (FIFO) algorithms.
For a 4-port switch, when the average load is high (close to 95% of the network capacity) …
Abstract
In this work we examine the performance of arbitration algorithms for core high-speed serial switches (HSSS). Taking Infiniband as an example, experimental results show that, for a homogeneous network load, the average queuing delay for the switch output ports under the weighted round-robin (WRR) algorithm defined for InfiniBand is similar to the average queuing delay resulting from the largest delay-first (LDF) or first-in-first-out (FIFO) algorithms. For a 4-port switch, when the average load is high (close to 95% of the network capacity) and unbalanced with respect to the WRR weights, the difference in average delay between WRR and LDF or FIFO is large. However, for a 20-port switch and the same high unbalanced average network load, this difference is less than half of that of the 4-port switch. Further, the average queuing delay difference between WRR and LDF or FIFO diminishes quickly as the average load decreases. Hence, even for a fairly high average load, LDF or FIFO can be suggested for arbitration in core HSSS.
Springer
Showing the best result for this search. See all results