Identical and Incremental Routes Availability in Proposed MIN MALN and comparison with Alpha Network

Amardeep Gupta*
Head, PG Department of Computer Science and Information Technology, DAV College, Amritsar, Punjab, India.
Periodicity:March - May'2017
DOI : https://doi.org/10.26634/jit.6.2.13570

Abstract

If the network is able to work, of course with degraded efficiency, in the presence of faults in critical components then the network is called as Fault-Tolerant. A network is single Fault-Tolerant, if it can work with full access in the presence of fault in single SE. If the network is able to provide connections from all sources to all destinations in the presence of k faults in the network, then this network is called as k Fault-Tolerant network. In this paper, routes available in the proposed MIN Modified Alpha Network (MALN) have been evaluated and compared with the existing Alpha (ALN) MIN.

Keywords

Irregular Fault Tolerant MIN, Identical Routes, Incremental Routes, Permutations Passable.

How to Cite this Article?

Gupta, A. (2017). Identical and Incremental Routes Availability in Proposed MIN MALN and comparison with Alpha Network. i-manager’s Journal on Information Technology, 6(2), 8-10. https://doi.org/10.26634/jit.6.2.13570

References

[1]. Koppelman, D. M. & Onic, A. Y. (1990). A Self-routing Permutation Network. Journal of Parallel and Distributed Computing, 10(10), 140-151.
[2]. Lai, W. K. (2000). Performing Permutations on Interconnection Networks by Regularly Changing Switch States. IEEE Transactions on Parallel and Distributed Systems, 11(8), 829-837.
[3]. Nassimi, D., & Sahni, S. (1981). A Self-Routing Benes Network and Parallel Permutation Algorithms. IEEE Transactions on Computers, C-30(5), 332-340.
[4]. Naveenathan, P., Sarkar, A., Bharthi, B., & Jenkins, J. (1995). Reconfiguration of Baseline Network for the availability of a pair of Permutations. Symposium on Advanced Computing, Banglore, India, 161-167.
[5]. Sengupta, J., Bansal, P. K., & Gupta, A. (2000). Permutation and Reliability Measures of Regular and Irregular MINS. Proceedings of IEEE Conference (TENCON), 531-536.
[6]. Siegel H. J., (1980). The Theory underlying the Partitioning of Permutation Networks. IEEE Transactions on Computers, C-29, 791-801.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.