On the synthesis of optimally reliable networks having unreliable nodes but reliable edges

The author considers a network reliability model which is pertinent to many computer networks. Nodes are assumed to fail with equal and independent probabilities, while edges are assumed to be perfectly reliable. Several problems regrading the synthesis of optimally reliable networks are introduced. A few results are given, and a collection of open questions and conjectures are stated.<<ETX>>