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 |
id |
ftunivsthongkong:oai:repository.ust.hk:1783.1-5759 |
---|---|
record_format |
openpolar |
spelling |
ftunivsthongkong:oai:repository.ust.hk:1783.1-5759 2023-05-15T18:32:41+02:00 Static round-robin scheduling algorithms for scalable switches Pun, Kong Hong 2002 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 English eng 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 Packet switching (Data transmission) Telecommunication -- Switching systems Thesis 2002 ftunivsthongkong https://doi.org/10.14711/thesis-b777647 2019-09-03T17:43:15Z 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. Thesis The Pointers The Hong Kong University of Science and Technology: HKUST Institutional Repository |
institution |
Open Polar |
collection |
The Hong Kong University of Science and Technology: HKUST Institutional Repository |
op_collection_id |
ftunivsthongkong |
language |
English |
topic |
Packet switching (Data transmission) Telecommunication -- Switching systems |
spellingShingle |
Packet switching (Data transmission) Telecommunication -- Switching systems Pun, Kong Hong Static round-robin scheduling algorithms for scalable switches |
topic_facet |
Packet switching (Data transmission) Telecommunication -- Switching systems |
description |
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. |
format |
Thesis |
author |
Pun, Kong Hong |
author_facet |
Pun, Kong Hong |
author_sort |
Pun, Kong Hong |
title |
Static round-robin scheduling algorithms for scalable switches |
title_short |
Static round-robin scheduling algorithms for scalable switches |
title_full |
Static round-robin scheduling algorithms for scalable switches |
title_fullStr |
Static round-robin scheduling algorithms for scalable switches |
title_full_unstemmed |
Static round-robin scheduling algorithms for scalable switches |
title_sort |
static round-robin scheduling algorithms for scalable switches |
publishDate |
2002 |
url |
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 |
genre |
The Pointers |
genre_facet |
The Pointers |
op_relation |
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 |
op_doi |
https://doi.org/10.14711/thesis-b777647 |
_version_ |
1766216876821577728 |