By Topic

Adapting distributed voting algorithms for secure real-time embedded systems

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

3 Author(s)
K. Ravindran ; Dept. of Comput. Sci., City Univ. of New York, NY, USA ; K. A. Kwiat ; A. Sabbir

Information assurance in real-time application settings requires dealing with extreme failure behaviors at the infrastructure level such as data corruptions by malicious processes and message timeliness violations in the network. Functional replication is employed to deal with such failures, with voting among the replica nodes to move correct pieces of data through the application-level subsystems. The goal is to develop a voting machinery that dynamically adjusts its internal mechanisms to deal with various types of failures. We present the design issues, with considerations of protocol correctness and performance engineering. A goal is to reduce the message overhead - and hence the power drain on wireless connected processes. The protocol is highly adaptive to deal with various types of failures occurring at the infrastructure level, in meeting the goal.

Published in:

Distributed Computing Systems Workshops, 2004. Proceedings. 24th International Conference on

Date of Conference:

23-24 March 2004