DocumentCode
2204650
Title
Network reliability evaluation with link dependency failure
Author
Hachem, Nabil ; Bedi, Jatinder
Author_Institution
Lawrence Technol. Univ., Southfield, MI, USA
fYear
1996
fDate
11-14 Apr 1996
Firstpage
591
Lastpage
595
Abstract
A new technique for computing the terminal reliability of a computer communication network involving link dependent failures is proposed. The algorithm utilizes the Boolean algebra approach for computing the source-to-terminal reliability. Introducing the new technique for minimizing the Boolean function and the dependent failures associated with each link, the proposed algorithm yields lower and upper bounds for terminal reliability
Keywords
Boolean algebra; Boolean functions; computer network reliability; failure analysis; telecommunication computing; telecommunication terminals; Boolean algebra; Boolean function; computer communication network; computer program; link dependency failure; lower bound; network reliability evaluation; source to terminal reliability; terminal reliability; upper bound; Boolean algebra; Boolean functions; Communication networks; Communications technology; Computer network reliability; Computer networks; Logic functions; Telecommunication network reliability; Upper bound; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Southeastcon '96. Bringing Together Education, Science and Technology., Proceedings of the IEEE
Conference_Location
Tampa, FL
Print_ISBN
0-7803-3088-9
Type
conf
DOI
10.1109/SECON.1996.510141
Filename
510141
Link To Document