MPhil Thesis Defence


"Static Round-Robin Scheduling Algorithms for Scalable Switches"

By

Mr. Kong Hong Pun


Abstract

The Clos-network is widely recognized as a scalable architecture for
high-performance switches and routers. One of the key challenges in
designing a Clos-network switch for a high-speed environment is the design
of the dispatching/scheduling so as to be efficient for a wide range of
traffic patterns, yet practical to be implemented in hardware.

Based on the Static Round-Robin (SRR) scheduling technique, we propose
several dispatching algorithm and its variants for Buffered and Bufferless
Clos-network switches in this thesis. Our algorithms are based on the
request-grant-accept (RGA) handshaking scheme, which can be implemented
using simple distributed arbiters at the input and output of the
Clos-network. The intuition behind our SRR is to desynchronize the
pointers of the arbiters in a static way and by to use a rotating-search
technique to improve the performance under non-uniform traffic. Our
simulation results will demonstrate that our algorithms achieve the lowest
delay and highest throughput among all other related schemes.


Date:			Thursday, 8 August 2002

Time:			2:00p.m.-4:00p.m.

Venue:			Room 2303
			Lifts 17-18

Committee Members:		Dr. Mounir Hamdi (Supervisor)
			Dr. Brahim Bensaou (Chairman)
			Dr. Gary Chan


**** ALL are Welcome ****