%0 Book Section %1 Cavendish2001829 %A Cavendish, D. %A Goudreau, M. %A Ishii, A. %B Teletraffic Engineering in the Internet EraProceedings of the International Teletraffic Congress - ITC-I7 %D 2001 %E Jorge Moreira de Souza, Nelson L.S. da Fonseca %E de Souza e Silva, Edmundo A. %I Elsevier %K itc itc17 %P 829 - 841 %R http://dx.doi.org/10.1016/S1388-3437(01)80173-6 %T On the fairness of scheduling algorithms for input-queued switches %V 4 %X Many schedulers for Virtual Output Queue (VOQ) architectures have been designed to provide reasonable bandwidth at high speed while preventing the starvation of any queue. However, it is not clear to what extent these schedulers incorporate both fair sharing of resources and high utilization. In this paper, we undertake the first comprehensive experimental evaluation of the fairness of several \VOQ\ schedulers. Formalizing the problem by applying a max-min fairness criterion, we discover that the schedulers are frequently unfair. To improve the fairness of \VOQ\ schedulers, we propose a simple and inexpensive throttling mechanism that can be used in conjunction with any scheduler. We demonstrate that under many circumstances the throttling mechanism can substantially improve system fairness.

@incollection{Cavendish2001829, abstract = {Many schedulers for Virtual Output Queue (VOQ) architectures have been designed to provide reasonable bandwidth at high speed while preventing the starvation of any queue. However, it is not clear to what extent these schedulers incorporate both fair sharing of resources and high utilization. In this paper, we undertake the first comprehensive experimental evaluation of the fairness of several \VOQ\ schedulers. Formalizing the problem by applying a max-min fairness criterion, we discover that the schedulers are frequently unfair. To improve the fairness of \VOQ\ schedulers, we propose a simple and inexpensive throttling mechanism that can be used in conjunction with any scheduler. We demonstrate that under many circumstances the throttling mechanism can substantially improve system fairness. }, added-at = {2016-07-12T14:53:52.000+0200}, author = {Cavendish, D. and Goudreau, M. and Ishii, A.}, biburl = {https://www.bibsonomy.org/bibtex/2984a03e765c5a499b8c586284fabd50a/itc}, booktitle = {Teletraffic Engineering in the Internet EraProceedings of the International Teletraffic Congress - ITC-I7}, doi = {http://dx.doi.org/10.1016/S1388-3437(01)80173-6}, editor = {Jorge Moreira de Souza, Nelson L.S. da Fonseca and de Souza e Silva, Edmundo A.}, interhash = {e66cab2f87863ab27471307f195aa393}, intrahash = {984a03e765c5a499b8c586284fabd50a}, issn = {1388-3437}, keywords = {itc itc17}, pages = {829 - 841}, publisher = {Elsevier}, series = {Teletraffic Science and Engineering }, timestamp = {2020-04-30T18:17:29.000+0200}, title = {On the fairness of scheduling algorithms for input-queued switches }, volume = 4, year = 2001 }