High-performance switching based on buffered crossbar fabrics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Localized asynchronous packet scheduling for buffered crossbar switches
Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
Throughput Region of Finite-Buffered Networks
IEEE Transactions on Parallel and Distributed Systems
Efficient queuing architecture for a buffered crossbar switch
ICCOM'07 Proceedings of the 11th Conference on 11th WSEAS International Conference on Communications - Volume 11
On guaranteed smooth switching for buffered crossbar switches
IEEE/ACM Transactions on Networking (TON)
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
GMDS: hardware implementation of novel real output queuing architecture
Proceedings of the conference on Design, automation and test in Europe
Strong performance guarantees for asynchronous buffered crossbar scheduler
IEEE/ACM Transactions on Networking (TON)
On tracking the behavior of an output-queued switch using an input-queued switch
IEEE/ACM Transactions on Networking (TON)
A combined fair scheduling algorithm for combined-input-crosspoint-queued switch
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Flow-based packet-mode load-balancing for parallel packet switches
Journal of High Speed Networks
| Hi-index | 0.07 |
The output-queued (OQ) switch is often considered an ideal packet switching architecture for providing quality-of-service guarantees. Unfortunately, the high-speed memory requirements of the OQ switch prevent its use for large-scale devices. A previous result indicates that a crossbar switch fabric combined with lower speed input and output memory and two times speedup can exactly emulate an OQ switch; however, the complexity of the proposed centralized scheduling algorithms prevents scalability. This paper examines switch fabrics with limited memory and their ability to exactly emulate an OQ switch. The switch architecture of interest contains input queueing, fabric queueing, flow-control between the limited fabric buffers and the inputs, and output queueing. We present sufficient conditions that enable this combined input/fabric/output-queued switch with two times speedup to emulate a broad class of scheduling algorithms operating an OQ switch. Novel scheduling algorithms are then presented for the scalable buffered crossbar fabric. It is demonstrated that the addition of a small amount of memory at the crosspoints allows for distributed scheduling and significantly reduces scheduling complexity when compared with the memoryless crossbar fabric. We argue that a buffered crossbar system performing OQ switch emulation is feasible for OQ switch schedulers such as first-in-first-out, strict priority and earliest deadline first, and provides an attractive alternative to both crossbar switch fabrics and to the OQ switch architecture.