Author_Institution :
Sch. of Inf. Sci. & Technol., Baotou Normal Univ., Baotou, China
Abstract :
In this paper, we give out some new concepts of 0-column transformation, 1-column transformation and addition of two columns. Using these transformations and network topology , combing with DFS and OBDD technology, we start from last column of the connection matrix, build a OBDD branching tree, which make use of logical expand branching condition, and last, end nodes of branching tree with 1 or some variable logical expression. With branching tree nodes, we can write out factored expression of s-t reliability of network G. This method, combining with technique, can make the obtained OBDD branching tree compacted, and execution by computers may use little memory and avoid sub-graph redundancy.
Keywords :
computer networks; matrix algebra; multicast protocols; network topology; wireless sensor networks; DFS; OBDD branching tree; OBDD technology; computing network reliability; matrix column transformation; network topology; s-t reliability; subgraph redundancy; wireless sensor network; Algebra; Computer network reliability; Computer networks; Information science; NP-hard problem; Network topology; Redundancy; Reliability theory; Telecommunication network reliability; Wireless sensor networks; OBDD; algorithm; column- transformation; network topology; reliability;
