HKUST Institutional Repository >
Computer Science and Engineering >
CSE Master Theses >
Please use this identifier to cite or link to this item:
|Title: ||Static round-robin scheduling algorithms for scalable switches|
|Authors: ||Pun, Kong Hong|
|Issue Date: ||2002 |
|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.|
|Description: ||Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2002|
vii, 48 leaves : ill. ; 30 cm
HKUST Call Number: Thesis COMP 2002 Pun
|Appears in Collections:||CSE Master Theses |
Files in This Item:
All items in this Repository are protected by copyright, with all rights reserved.