Affiliation:
1. Guru Nanak Dev University, Amritsar, India
Abstract
In this paper reliability and path length analysis of irregular Multistage Interconnection Networks have been presented. We have examined FT(Four Tree)[8],MFT(Modified Four Tree)[2],NFT(New Four Tree)[4],IFT(improved Four Tree)[5],IASN(Irregular Augmented Shuffle)[14] and IIASN(Improved Irregular Augmented Shuffle)[3] networks in which the number of switches in each stage are different in numbers and also have express links[11]. Using upper and lower bounds[7][13][15] for larger networks, the reliability[9] in terms of mean time to failure of all these networks are evaluated and compared with each other. Each source is connected to destination with one or multiple paths with varying path lengths in a network. The path length analysis of all these networks is also analyzed in this paper. A path length[8] algorithm for IIASN network is also propose
Publisher
Association for Computing Machinery (ACM)
Reference16 articles.
1. Toward systematic design of fault-tolerant systems
2. A new fault tolerant multistage interconnection network
3. Improved Irregular Augmented Shuffle Multistage Interconnection Network;Sharma Sandeep;International Journal of Computer Science and Security,2008
4. On a class of Multistage Interconnection Network in parallel processing;Sharma Sandeep;International Journal of Computer Science and Network Security,2008
5. Irregular Class of Multistage Interconnection Network in Parallel Processing
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献