Design of reliable networks

Design of reliable networks

0.00 Avg rating0 Votes
Article ID: iaor19931661
Country: United Kingdom
Volume: 20
Issue: 1
Start Page Number: 25
End Page Number: 34
Publication Date: Jan 1993
Journal: Computers and Operations Research
Authors:
Keywords: networks
Abstract:

In many applications, the network designer may want to know how to synthesize a reliable network. Assume that a network, denoted as equ1, has the number of nodes n and the number of edges e, and the operational probability of each edge is known. The system reliability of the network is defined to be the probability that every pair of nodes can communicate with each other. A network synthesis problem considered in this paper is to find a network equ2that maximizes system reliability over the class of all networks having n nodes and e edges. The paper finds the optimal networks for the classes of networks equ3, equ4and equ5, respectively. In addition, an upper bound of maximum reliability for the networks with n nodes and e edges equ6is derived in terms of node degrees. Computational experiments for the reliability upper bound are also presented. The results show that the proposed reliability upper bound is effective.

Reviews

Required fields are marked *. Your email address will not be published.