Title :
Reliability comparison of computer networks
Author :
Camarda, P. ; Gerla, M.
Author_Institution :
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
Abstract :
The authors consider networks modeled as directed graphs with a uniform link failure probability (q) and develop an algorithm which permits not only a symbolic reliability evaluation, but also a comparison of different topologies to verify if a particular one is uniformly maximally reliable, i.e. it has the best reliability for any value of q. In the case when the previous property cannot be verified, it is possible to evaluate exactly the range of values of q for which one network is better than the other. The method can be extended also to compare networks with different topological characteristics, namely different number of links and/or nodes.<>
Keywords :
computer networks; directed graphs; reliability; directed graphs; symbolic reliability evaluation; uniform link failure probability; Communication networks; Computational complexity; Computer network reliability; Computer science; Ear; Joining processes; Network synthesis; Network topology; Neural networks; Telecommunication network reliability;
Conference_Titel :
INFOCOM '88. Networks: Evolution or Revolution, Proceedings. Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies, IEEE
Conference_Location :
New Orleans, LA, USA
Print_ISBN :
0-8186-0833-1
DOI :
10.1109/INFCOM.1988.12998
