๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing optimal assignments for residual network reliability

โœ Scribed by C. Stivaros; K. Sutner

Book ID
104294909
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
701 KB
Volume
75
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

โœฆ Synopsis

We study the problem of assigning given failure probabilities to the nodes of a network so as to optimize its reliability. The measure used is the residual node connectedness reliability of the network, which is defined as the probability that the operating nodes are connected. In this paper. we show how optimal assignments can be found in polynomial time for paths, cycles, threshold graphs, and complete graphs minus a matching.

On the other hand, the problem is shown to be NP-hard even for complete bipartite graphs.

๐Ÿ“œ SIMILAR VOLUMES

Topological optimization of computer net
Topological optimization of computer network expansion with reliability constraint
โœ Fang-Ming Shao; Lian-Chang Zhao ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 447 KB

This paper considers an optimization of a computer network expansion with a reliability constraint. Computer network expansion is achieved by adding a new node and communication links to a computer network such that reliability of the computer network is not less than a given level. In order to spee