Performance analysis of the ATM shuffleout switching architecture under non-uniform traffic patterns
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
The Asynchronous Transfer Mode: a tutorial
Computer Networks and ISDN Systems - Special issue on the ATM—asynchronous transfer mode
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
On a Class of Multistage Interconnection Networks
IEEE Transactions on Computers
Performance of Processor-Memory Interconnections for Multiprocessors
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
A Survey of Interconnection Networks
Computer
Broadband ISDN and asynchronous transfer mode (ATM)
IEEE Communications Magazine
ATM technology for corporate networks
IEEE Communications Magazine
A survey of modern high-performance switching techniques
IEEE Journal on Selected Areas in Communications
The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet Switching
IEEE Journal on Selected Areas in Communications
A Broadband Packet Switch for Integrated Transport
IEEE Journal on Selected Areas in Communications
Distributed Input and Deflection Routing Based Packet Switch Using Shuffle Pattern Network
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
A high-performance ATM switch based on modified shuffle-exchange network
Computer Communications
Hi-index | 0.24 |
While pure output-buffered ATM switches achieve the best possible throughput-delay performance, most of them suffer from high complexity. In this paper, we describe a low-complexity output buffering deflection-routing based ATM switch, called the Multi Single-Stage-Shuffling Switch (MS4). Our work is motivated by the observation that cells which lose contention in any of the Tandem-Banyan switch networks do not contribute to the throughput of the switch until they reach the inputs of the following network. The MS4 is based on multi-layering of unbuffered single-stage interconnection networks. It preserves cell-sequencing while providing cells with multiple concurrent paths for each input-output pair. The switch is analysed under uniform traffic assuming arbitrary switch parameters. It is shown that a complexity of only O(N log"2N) is required to achieve arbitrary small cell loss probabilities in the interconnection network, for a switch of size N. Simulation is used to assess the accuracy of the analysis and to examine the MS4 under a variety of traffic models. The MS4 is shown to be robust under non-uniform traffic. It is also shown to compare well to other known ATM switch architectures. Finally, a variation of the switch is described, analysed and compared to the original design.