By Topic

A measure of fault-tolerance for distributed networks

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
$33 $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

1 Author(s)
C. Stivaros ; Dept. of Comput. Sci., Fairleigh Dickinson Univ., Madison, NJ, USA

The authors consider probabilistic networks having links that are perfectly reliable but nodes that fail randomly and independently with known probabilities. They define a fault-tolerance measure of such network that is directly affected by the choice of its underlying graph and the location of its node-components. A state of the network is tolerant if the currently operating nodes comprise a connected subnetwork. The probability of the network being in a tolerant state is the fault-tolerance (FT) measure of the network. The authors are concerned with the design of globally-best tolerant networks, that maximize FT for any given set of node-operating probabilities. They study this measure of fault-tolerance by developing combinatorial tools and by determining the optimal networks in both `sparse' and `dense' classes

Published in:

Computing and Information, 1992. Proceedings. ICCI '92., Fourth International Conference on

Date of Conference:

28-30 May 1992