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
Reliability Comparison of Computer Networks / Camarda, P.; Gerla, M.. - STAMPA. - (1988), pp. 835-841. (Intervento presentato al convegno 7th Annual Joint Conference of the IEEE Computer and Communcations Societies, INFOCOM '88 tenutosi a New Orleans, LA nel March 27-31, 1988) [10.1109/INFCOM.1988.12998].
Reliability Comparison of Computer Networks
P. Camarda;
1988-01-01
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 nodesI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
