Literature survey of nonblocking network topologies

Authors:
S. Umarani;S. Pavai Madheswari;N. Nagarajan
Affiliations:
Department of Computer Applications, Sakthi Mariamman Engineering College, Thandalam, Tamilnadu, India;Department of Computer Science and Engineering, R.M.K. Engineering College, Kavaraipettai, Tamilnadu, India;Department of Computer Science and Engineering, Coimbatore Institute of Engineering and Technology, Coimbatore, Tamilnadu, India
Venue:
ICNVS'10 Proceedings of the 12th international conference on Networking, VLSI and signal processing
Year:
2010

Citing 4
Cited 0

Nonblocking Broadcast Switching Networks

IEEE Transactions on Computers
Nonblocking WDM Multicast Switching Networks

IEEE Transactions on Parallel and Distributed Systems
Nonblocking k-Fold Multicast Networks

IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Rearrangeable Permutation Network

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

The performance of a parallel computer greatly depends upon how, the different processors are capable of exchanging data. This, thus require an arbitrary permutation (nonblocking) to be done by the connection networks. A nonblocking network is capable of providing N parallel paths between a pair of nodes forming any arbitrary permutation. In this paper, we present three different simple nonblocking schemes in WDM switching networks such as Crossbar, Clos-network, Benes-network and also select the best scheme among them.