Evaluation and Analysis of Different Reliability Measures of Interconnection Network

Abstract

The present thesis aims at developing some techniques for the reliability evaluation newlineanalysis of the interconnection network sunder different operating environments. The newlinethesis is organized as follows: newlineChapter-1: The chapter-1 is the introductory about the interconnection network newlineand different reliability measures. Chapter-2 conducts an exhaustive survey of literature. newlineChapter-3 is devoted towards finding the k-terminal reliability of distributed system. newlineChapter-4 focuses on the reliability evaluation of the distributed system considering the newlinenode and link failure model. The analysis and evaluation of terminal reliability, broadcast newlinereliability and network reliability of the multistage interconnection networks is covered in newlineChapter-5. Chapter-6 proposes a method to find the two-terminal reliability of a mobile newlinead-hoc network. Chapter-7 presents the reliability evaluation technique for a stochastic newlineflow network under budget and timing constraints. Chapter-8 of the thesis discusses the newlinesummary of important findings and concludes the thesis with an indication towards the newlinefuture scope. A detailed description of my work carried out in Chapter-3 to Chapter-7 is newlinepresented below: newlineChapter -3: The chapter-3 of the thesis concentrates on the evaluation of reliability newlineof the interconnection network using binary decision diagram (BDD). In this chapter, an newlineefficient algorithm is proposed which compute recursively the k-terminal reliability of the newlinegraph. The algorithm based on BDD method first converts the interconnection network newlineinto a probabilistic graph G(V,E), where V is vertex set and E is the edge set. Two newlineoperation viz. contraction and deletion are used to make partitions of the initial graph into newlinesub graphs. An efficient algorithm is proposed to make such partitions. A partition string newlinelabels each partition. Each of such partition string is inserted into a hash table in order to newlineavoid duplicity. As the size of Binary Decision Diagram (BDD) is largely dependent on its newlineordering, an efficient variable ordering is proposed.