By Topic

Exact graph-reduction algorithms for network reliability analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shooman, A.M. ; IBM Thomas J. Watson Res. Center, Hawthorne, NY, USA ; Kershenbaum, A.

Consideration is given to the problem of analyzing the reliability of a network, specifically, the probability that a given set of critical nodes within the network can communicate, given the failure probabilities for component nodes and links. An exact graph-reduction algorithm is presented for solving the k-terminal reliability problem with node failures on an arbitrary network. k-terminal reliability means that a specific set of k target nodes must be able to communicate with one another. The authors model the network by an undirected probabilistic graph whose vertices represent the nodes and whose edges represent the links

Published in:

Global Telecommunications Conference, 1991. GLOBECOM '91. 'Countdown to the New Millennium. Featuring a Mini-Theme on: Personal Communications Services

Date of Conference:

2-5 Dec 1991