A threshold-based matching algorithm for photonic clos network switches

Authors:
Ding-Jyh Tsaur;Chi-Feng Tang;Chin-Chi Wu;Woei Lin
Affiliations:
Institute of Computer Science, National Chung-Hsing University;Institute of Computer Science, National Chung-Hsing University;Institute of Computer Science, National Chung-Hsing University;Institute of Computer Science, National Chung-Hsing University
Venue:
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Year:
2005

Citing 4
Cited 0

Broadband Packet Switching Technologies: A Practical Guide to ATM Switches and IP Routers

Broadband Packet Switching Technologies: A Practical Guide to ATM Switches and IP Routers
Concurrent round-robin-based dispatching schemes for Clos-network switches

IEEE/ACM Transactions on Networking (TON)
Matching algorithms for three-stage bufferless Clos network switches

IEEE Communications Magazine
PetaStar: a petabit photonic packet switch

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This study concerns a threshold-based matching algorithm for Clos (t-MAC) network switches. The studied Clos network uses a central photonic switch fabric for transporting high-speed optical signals and electronic controllers at the input and output ports. The proposed matching algorithm is used to solve the scheduling problems associated with the Clos network. The matching algorithm incorporates cut-through transmission, variable-threshold adjustment and preemptive scheduling. The performance is evaluated using the bursty and unbalanced traffic model, and simulation results obtained by t-MAC are presented. The results demonstrate that the proposed algorithm can markedly reduce switching latency by approximately 45 to 36 % below that of Chao’s c-MAC, for frame lengths from 10 to 512 cells.