Introduction to algorithms
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
A Fast Parallel Algorithm for Routing Unicast Assignments in Benes Networks
IEEE Transactions on Parallel and Distributed Systems
Scheduling algorithms for input-queued cell switches
Scheduling algorithms for input-queued cell switches
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Tiny Tera: A Packet Switch Core
IEEE Micro
Design of a Gigabit ATM Switch
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Parallel routing algorithms in Benes-Clos networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Low-cost scalable switching solutions for broadband networking: the ATLANTA architecture and chipset
IEEE Communications Magazine
Design and implementation of Abacus switch: a scalable multicast ATM switch
IEEE Journal on Selected Areas in Communications
Dispatching schemes for Clos-network switches
Computer Networks: The International Journal of Computer and Telecommunications Networking
Captured-frame matching schemes for scalable input-queued packet switches
Computer Communications
Rate and delay guarantees provided by Clos packet switches with load balancing
IEEE/ACM Transactions on Networking (TON)
A distributed scheduling algorithm in central-stage buffered multi-stage switching fabrics
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Hedera: dynamic flow scheduling for data center networks
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Improving datacenter performance and robustness with multipath TCP
Proceedings of the ACM SIGCOMM 2011 conference
A threshold-based matching algorithm for photonic clos network switches
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Hi-index | 0.00 |
A Clos-network switch architecture is attractive because of its scalability. Previously proposed implementable dispatching schemes from the first stage to the second stage, such as random dispatching (RD), are not able to achieve high throughput unless the internal bandwidth is expanded. This paper presents two round-robin-based dispatching schemes to overcome the throughput limitation of the RD scheme. First, we introduce a concurrent round-robin dispatching (CRRD) scheme for the Clos-network switch. The CRRD scheme provides high switch throughput without expanding internal bandwidth. CRRD implementation is very simple because only simple round-robin arbiters are adopted. We show via simulation that CRRD achieves 100% throughput under uniform traffic. When the offered load reaches 1.0, the pointers of round-robin arbiters at the first- and second-stage modules are completely desynchronized and contention is avoided. Second, we introduce a concurrent master-slave round-robin dispatching (CMSD) scheme as an improved version of CRRD to make it more scalable. CMSD uses hierarchical round-robin arbitration. We show that CMSD preserves the advantages of CRRD, reduces the scheduling time by 30% or more when arbitration time is significant and has a dramatically reduced number of crosspoints of the interconnection wires between round-robin arbiters in the dispatching scheduler with a ratio of 1/√N, where N is the switch size. This makes CMSD easier to implement than CRRD when the switch size becomes large.