DocumentCode :
3051767
Title :
Max-min fair self-randomized scheduler for input-buffered switches
Author :
Tabatabaee, Vahid ; Tassiulas, Leandros
Author_Institution :
Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD, USA
fYear :
2004
fDate :
2004
Firstpage :
299
Lastpage :
303
Abstract :
We consider self-randomized scheduling policies for input buffered switches. We provide a general architecture for the design of self-randomized algorithms. The common trend in the design of self-randomized schedulers is to use the number of backlogged cells as the weight function and to use an instantaneous cell arrival graph to generate a candidate matching for scheduling. We discuss some of the shortcomings of this approach, and introduce the total arrival graph as an alternative to the instantaneous arrival graph to improve performance. We also introduce the concept of max-min fair self-randomized scheduling algorithms. The idea here is to introduce self-randomized algorithms that can provide QoS by sharing the switch bandwidth proportional to some assigned weights. In order to study and compare the performance of the proposed scheduling algorithms, several simulations are carried out. Their results are provided and discussed.
Keywords :
bandwidth allocation; buffer storage; graph theory; minimax techniques; quality of service; scheduling; telecommunication switching; QoS; bandwidth sharing; input-buffered switches; instantaneous cell arrival graph; max-min fair scheduling algorithms; max-min fair self-randomized scheduling algorithms; self-randomized algorithms; total arrival graph; Bandwidth; Delay; Educational institutions; Fabrics; Memory architecture; Processor scheduling; Scheduling algorithm; Switches; Throughput; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
High Performance Switching and Routing, 2004. HPSR. 2004 Workshop on
Print_ISBN :
0-7803-8375-3
Type :
conf
DOI :
10.1109/HPSR.2004.1303495
Filename :
1303495
Link To Document :
بازگشت