Title :
Frame occupancy-based dispatching schemes for buffered three-stage Clos-network switches
Author :
Lin, Chuan-Bi ; Rojas-Cessa, Roberto
Author_Institution :
Dept. of Comput. & Electr. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
Abstract :
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.
Keywords :
multistage interconnection networks; packet switching; scheduling; telecommunication traffic; admissible traffic patterns; frame occupancy-based dispatching schemes; matching iterations; nonuniform distributions; packet scheduling; three-stage Clos-network switch buffering; throughput performance; uniform traffic model; Costs; Dispatching; Fabrics; Large-scale systems; Packet switching; Pattern matching; Scalability; Switches; Throughput; Traffic control; Clos-network; Dispatching; admissible traffic; frame; round-robin;
Conference_Titel :
Networks, 2005. Jointly held with the 2005 IEEE 7th Malaysia International Conference on Communication., 2005 13th IEEE International Conference on
Print_ISBN :
1-4244-0000-7
DOI :
10.1109/ICON.2005.1635608