Contention-Tolerant Crossbar Packet Switches without and with Speedup

• Published in: 2010 IEEE International Conference on Communications pp. 1 - 6
• Main Authors: Guannan Qu, Hyung Jae Chang, Jianping Wang, Zhiyi Fang, Zheng, S Q
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.05.2010
• Subjects: Communications Society; Computer science; Delay; Hardware; Packet switching; Pipeline processing; Quality of service; Scheduling algorithm; Switches; Throughput
• ISBN: 1424464021; 9781424464029
• ISSN: 1550-3607; 1938-1883
• DOI: 10.1109/ICC.2010.5502013

We propose an innovative agile crossbar switch architecture called contention-tolerant crossbar, denoted by CTC(N). Unlike the conventional crossbar and the crossbar with crosspoint buffers, which require complex hardware resolvers to grant one out of multiple output requests, CTC(N) can tolerate output contentions by a pipelining mechanism, with pipeline stages implemented as buffers in input ports. These buffers are used to decouple the scheduling task into N independent parts in such a way that N schedulers are located in N input ports, and they operate independently and in parallel. Without using arbiters and/or crosspoint buffers that require additional chip area, the CTC(N) switch is more scalable than existing crossbars. We analyze the throughput of CTC(N) switch without and with internal speedup by building a queuing model. We show that, under Bernoulli i.i.d. uniform traffic, CTC(N) without internal speedup has worst-case throughput of 63%, and CTC(N) achieves 100% throughput with internal speedup 2. Our simulation results validate our theoretical analysis.