Max-min fair self-randomized scheduler for input-buffered switches

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.

[1]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[2]  Leandros Tassiulas,et al.  QoS provisioning and tracking fluid policies in input queueing switches , 2001, TNET.

[3]  Cheng-Shang Chang,et al.  Birkhoff-von Neumann input buffered crossbar switches , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  E. L. Hahne,et al.  Round-Robin Scheduling for Max-Min Fairness in Data Networks , 1991, IEEE J. Sel. Areas Commun..

[5]  Leandros Tassiulas,et al.  Maxmin fair scheduling in wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Vahid Tabatabaee.  Scheduling and rate Provisioning for input-Bufered cell based Switch Fabrics , 2003 .

[7]  Samuel P. Morgan,et al.  Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..

[8]  Leandros Tassiulas,et al.  Linear complexity algorithms for maximum throughput in radio networks and input queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[9]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

[10]  Balaji Prabhakar,et al.  The throughput of data switches with and without speedup , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Nick McKeown,et al.  ATM input-buffered switches with the guaranteed-rate property , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[12]  Thomas E. Anderson,et al.  High speed switch scheduling for local area networks , 1992, ASPLOS V.

[13]  Paolo Giaccone,et al.  Towards simple, high-performance schedulers for high-aggregate bandwidth switches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.