Skip Navigation

The Computer Journal 1985 28(4):353-356; doi:10.1093/comjnl/28.4.353
© 1985 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Fung, K. T.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An Entropy Approach to Solving Some Network Reliability Problems

K. T. Fung *

AT&T Information Systems, Lincroft, New Jersey, USA

An approach to solving some network reliability problems is presented. The network in concern is assumed to be expressed in terms of a reliability block diagram having an arbitrary number of source-destination pairs. This approach is based on the formulation and subsequent solution of an entropy maximisation problem. The resulting algorithms are easy to implement and can readily be programmed.


* AT&T Information Systems, Lincroft, New Jersey 07738


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.