Switching using parallel input-output queued switches with no speedup

Authors:
Saad Mneimneh;Vishal Sharma;Kai-Yeung Siu
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA;Metanoia Inc., Mountain View, CA;Massachusetts Institute of Technology, Cambridge, MA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2002

Citing 3
Cited 8

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
Matching output queueing with a combined input/output-queued switch

IEEE Journal on Selected Areas in Communications
On the speedup required for work-conserving crossbar switches

IEEE Journal on Selected Areas in Communications

Achieving High Performance to Support Multicast Traffic in a Parallel Packet Switch with Space Division Multiplexing Expansion

HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Overall Blocking Behavior Analysis of General Banyan-Based Optical Switching Networks

IEEE Transactions on Parallel and Distributed Systems
Matching from the first iteration: an iterative switching algorithm for an input queued switch

IEEE/ACM Transactions on Networking (TON)
A coordination scheduling mechanism to guarantee packet ordering in parallel packet switch

International Journal of Electronic Security and Digital Forensics
Input-queued switches with logarithmic delay: necessary conditions and a reconfigurable scheduling algorithm

Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Parallel switch system with QoS guarantee for real-time traffic

Journal of Computer Science and Technology
A parallel packet switch architecture with input-output-queued switches and buffering in the demultiplexors

ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
A parallel packet switch with multiplexors containing virtual input queues

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an efficient parallel switching architecture that requires no speedup and guarantees bounded delay. Our architecture consists of k input-output-queued switches with first-in-first-out queues, operating at the line speed in parallel under the control of a single scheduler, with k being independent of the number N of inputs and outputs. Arriving traffic is demultiplexed (spread) over the k identical switches, switched to the correct output, and multiplexed (combined) before departing from the parallel switch.We show that by using an appropriate demultiplexing strategy at the inputs and by applying the same matching at each of the k parallel switches during each cell slot, our scheme guarantees a way for cells of a flow to be read in order from the output queues of the switches, thus, eliminating the need for cell resequencing. Further, by allowing the scheduler to examine the state of only the first of the k parallel switches, our scheme also reduces considerably the amount of state information required by the scheduler. The switching algorithms that we develop are based on existing practical switching algorithms for input-queued switches, and have an additional communication complexity that is optimal up to a constant factor.