Cart (Loading....) | Create Account
Close category search window
 

Fault-tolerant distributed algorithm for election in complete 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
$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

1 Author(s)
Abu-Amara, H.H. ; Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA

Electron in asynchronous complete networks is considered for the case in which the links may fail intermittently and undetectably. Undetectable link failure is consistent with the standard model of distributed algorithms in which link delays can be arbitrary but finite. An algorithm is given that correctly solves the problem when the links fail before or during the execution of the algorithm. If n is the number of nodes in the network, f the maximum number of fault links, and r a design parameter, the algorithm uses no more than O(nrf+(nr/(r-1) log(n/(r-1)f))) messages, runs in time O(n/(r-1)) f, and uses at most O(log|T |) bits per message, where |T| is the cardinality of the set of node identifiers

Published in:

Computers, IEEE Transactions on  (Volume:37 ,  Issue: 4 )

Date of Publication:

Apr 1988

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.