Please use this identifier to cite or link to this item:

Static round-robin scheduling algorithms for scalable switches

Authors Pun, Kong Hong
Issue Date 2002
Summary 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.
Note Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2002
Language English
Format Thesis
Access View full-text via DOI
Files in this item:
File Description Size Format
th_redirect.html 339 B HTML
Copyrighted to the author. Reproduction is prohibited without the author’s prior written consent.