Abstract | ||
---|---|---|
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 piece of data through the apllication-level subsystems. The goal of our paper is to develop a voting machinery that dynamically adjusts its internal mechanisms to deal with various types of failures. The paper presents 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 occuring at the infrastructure level, in meeting the goal. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1109/ICDCSW.2004.1284053 | ICDCS Workshops |
Keywords | Field | DocType |
distributed algorithms,voting,embedded systems,communication complexity,formal verification,majority voting,embedded system,real time systems,distributed computing,protocols,performance engineering,data integrity | Replica,Information assurance,Voting,Computer science,Correctness,Computer network,Communication complexity,Distributed algorithm,Data integrity,Embedded system,Formal verification,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-2087-1 | 6 | 0.54 |
References | Authors | |
2 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Kaliappa Nadar Ravindran | 1 | 19 | 6.40 |
Kevin A. Kwiat | 2 | 320 | 44.19 |
Ali Sabbir | 3 | 12 | 4.12 |