Adaptive Voting Algorithms for the Reliable Dissemination of Data in Fault-Prone Distributed Environments
Journal article (postprint)
AIR FORCE RESEARCH LAB ROME NY INFORMATION DIRECTORATE
Pagination or Media Count:
Data collection in a distributed embedded system requires dealing with failures data corruptions by malicious devices and arbitrary message delayloss in the network. Replication of data collection devices deals with such failures by voting among the replica devices to move a correct data to the end-user. Here, a data voted upon can be large-sized andor take a long time to be compiled. The goal of this paper is to engineer the voting protocols for good performance while meeting the reliability requirements of data delivery in a high assurance setting. Two metric quantify the effectiveness of voting protocols Data Transfer Efficiency DTE and Time-to-Complete TTC data delivery. DTE captures the network bandwidth wasted andor the energy drain in wireless-connected devices whereas, TTC captures the degradation in user-level Quality of Service QoS due to delayedmissed data deliveries. Given the distributed nature of voting, the protocol-level optimizations to improve DTE and TTC reduce the movement of user-level data over the network, the number of control messages generated, and the latency in effecting a data delivery. The paper describes these optimizations, and reports experimental results from a prototype voting system.
- Numerical Mathematics
- Computer Systems Management and Standards