TY - GEN
T1 - Frame occupancy-based dispatching schemes for buffered three-stage clos-network switches
AU - Lin, Chuan Bi
AU - Rojas-Cessa, Roberto
PY - 2005
Y1 - 2005
N2 - The three-stage Clos-network switch architecture has attractive scalability features that makes it appealing as an alternative for scalable switches. However, scheduling packets in a Clos-network switch is complex. This complexity can be simplified by adding buffers to the first and third stages. By adding these buffers, the scheme used for dispatching packets from the first stage of the switch becomes important. Several dispatching schemes for Clos-network, without internal expansion, that deliver high throughput under uniform traffic model have been proposed. However, there is a need of dispatching schemes that provide high throughput under several admissible traffic patterns, including those with nonuniform distributions, with a small number of matching iterations and without internal expansion. In this paper, we propose two frame-occupancy based dispatching schemes to increase throughput performance in Clos-network switches without using internal expansion. We show that frame-occupancy based schemes deliver high throughput under uniform and nonuniform traffic patterns.
AB - The three-stage Clos-network switch architecture has attractive scalability features that makes it appealing as an alternative for scalable switches. However, scheduling packets in a Clos-network switch is complex. This complexity can be simplified by adding buffers to the first and third stages. By adding these buffers, the scheme used for dispatching packets from the first stage of the switch becomes important. Several dispatching schemes for Clos-network, without internal expansion, that deliver high throughput under uniform traffic model have been proposed. However, there is a need of dispatching schemes that provide high throughput under several admissible traffic patterns, including those with nonuniform distributions, with a small number of matching iterations and without internal expansion. In this paper, we propose two frame-occupancy based dispatching schemes to increase throughput performance in Clos-network switches without using internal expansion. We show that frame-occupancy based schemes deliver high throughput under uniform and nonuniform traffic patterns.
KW - Admissible traffic
KW - Clos-network
KW - Dispatching
KW - Frame
KW - Round-robin
UR - http://www.scopus.com/inward/record.url?scp=33847278317&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33847278317&partnerID=8YFLogxK
U2 - 10.1109/ICON.2005.1635608
DO - 10.1109/ICON.2005.1635608
M3 - Conference contribution
AN - SCOPUS:33847278317
SN - 1424400007
SN - 9781424400003
T3 - 2005 13th IEEE International Conference on Networks jointly held with the 2005 7th IEEE Malaysia International Conference on Communications, Proceedings
SP - 771
EP - 775
BT - 2005 13th IEEE International Conference on Networks jointly held with the 2005 7th IEEE Malaysia International Conference on Communications, Proceedings
T2 - 2005 13th IEEE International Conference on Networks jointly held with the 2005 7th IEEE Malaysia International Conference on Communications
Y2 - 16 November 2005 through 18 November 2005
ER -