Static round-robin scheduling algorithms for scalable switches
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...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2002
|
| Subjects: | |
| Online Access: | http://repository.ust.hk/ir/Record/1783.1-5759 https://doi.org/10.14711/thesis-b777647 http://repository.ust.hk/ir/bitstream/1783.1-5759/1/th_redirect.html |
| 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. |
|---|