Browse wiki

From Navigators

Jump to: navigation, search
Abstract Consensus algorithms are an important buil Consensus algorithms are an important building block for fault-tolerant distributed systems. This paper investigates approaches to optimize solutions of distributed consensus to the properties of embedded systems. We discuss alternatives that allow constructing better practical solutions in realistic environments. For example, many networked embedded systems are equipped with both ad-hoc communication among collaborating actors and communication with a static infrastructure. Traditional consensus algorithms, however, are usually fully decentralized, and thus are unable to benefit from the additional infrastructure. Other existing approaches fully rely on the infrastructure, and thus fail to work if the infrastructure is not available. This paper sketches hybrid approaches that combine the advantages of both strategies. combine the advantages of both strategies.
Author Hans P. Reiser + , António Casimiro +
Booktitle 4th International Workshop on Dependable Embedded Systems (WDES-07), in conjunction with the 26th Symposium on Reliable Distributed Systems, Beijing, China, October 2007  +
Key Hans-reiser2007optimizing-byzantine-206  +
Month oct  +
NumPubDate 2,007.1  +
Project Project:HIDENETS +
ResearchLine Timeliness and Adaptation in Dependable Systems (TADS) +
Title Optimizing Byzantine Consensus for Fault-Tolerant Embedded Systems with Ad-Hoc and Infrastructure Networks  +
Type inproceedings  +
Url  +
Year 2007  +
Categories Publication  +
Modification dateThis property is a special property in this wiki. 14 January 2013 14:41:16  +
hide properties that link here 
  No properties link to this page.


Enter the name of the page to start browsing from.
Personal tools
Navigators toolbox