Title :
On a class of reliable networks
Author_Institution :
Alabama Univ., Huntsville, AL, USA
Abstract :
A communication network N in which links are subject to failures is typically modeled by a probabilistic graph G in which each edge exists independently with a fixed probability p, 0
>
Keywords :
fault tolerant computing; telecommunication networks; communication network; connected pairs; edge connectivity; pair-connected reliability; probabilistic graph; reliable networks; Availability; Communication networks; Telecommunication network reliability; Telephony;
Conference_Titel :
Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on
Conference_Location :
Scottsdale, AZ, USA
Print_ISBN :
0-7803-0605-8
DOI :
10.1109/PCCC.1992.200587
