Throughput/Fairness Trade offs for the iSLIP Scheduling Algorithm
BibTeX
@MISC{Mol_throughput/fairnesstrade,
author = {Petros Mol and Todor Ristov and Nikolaos Trogkanis},
title = {Throughput/Fairness Trade offs for the iSLIP Scheduling Algorithm},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
High throughput and fairness consist two desirable properties when scheduling traffic in an Input-Queued crossbar switch. Unfortunately, these two goals are conflicting which makes the job of most scheduling algorithms that want to achieve both hard. Here, we investigate the trade offs between throughput and fairness for iSLIP, one of the most well-studied algorithms introduced in [4]. We study iSLIP’s behavior under several traffic patterns both for persistent and for Bernoulli arrivals and compare its throughput to the throughput achieved by a maximum matching algorithm which is less efficient and completely ignores fairness. We conclude that iSLIP’s superiority in fairness comes with only a minor degradation of throughput. Hence iSLIP seems to achieve a great balance between performance, throughput and fairness. 1.
Keyphrases
islip scheduling algorithm throughput fairness trade offs fairness consist bernoulli arrival great balance islip behavior input-queued crossbar switch several traffic pattern well-studied algorithm hence islip desirable property islip superiority minor degradation maximum matching algorithm trade offs high throughput
