Performance of unbuffered shuffle-exchange networks
IEEE Transactions on Computers - The MIT Press scientific computation series
Permutation capability of optical multistage interconnection networks: 72
Journal of Parallel and Distributed Computing
IEEE/ACM Transactions on Networking (TON)
Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice
Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice
Optical Switching and Networking Handbook
Optical Switching and Networking Handbook
Recent developments in optical multistage networks
Optical networks
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Optical multistage interconnection networks: new challenges and approaches
IEEE Communications Magazine
On path dependent loss and switch crosstalk reduction in optical networks
Information Sciences: an International Journal
Hi-index | 0.01 |
Analytical modeling techniques can be used to study the performance of optical multistage interconnection network (OMIN) effectively. MINs have assumed importance in recent times, because of their cost-effectiveness. An N脳N MIN consists of a mapping from N processors to N memories, with log驴驴2 N stages of 2脳2 switches with N/2 switches per stage. The interest is on the study of the performance of unbuffered optical multistage interconnection network using the banyan network. The uniform reference model approach is assumed for the purpose of analysis. In this paper the analytical modeling approach is applied to an N脳N OMIN with limited crosstalk (conflicts between messages) up to (log驴驴2 N驴1). Messages with switch conflicts satisfying the constraint of (log驴驴2 N驴1) are allowed to pass in the same group, but in case of a link conflict, the message is routed in a different group. The analysis is performed by calculating the bandwidth and throughput of the network operating under a load l and allowing random traffic and using a greedy routing strategy. A number of equations are derived using the theory of probability and the performance curves are plotted. The results obtained show that the performance of the network improves by allowing limited crosstalk in the network.