Browse wiki

From Navigators

Jump to: navigation, search
Abstract The popularity of wide-area computer servi … The popularity of wide-area computer services has generated a compelling need for efficient algorithms that provide high reliability. Byzantine fault-tolerant (BFT) algorithms can be used with this purpose because they allow replicated systems to continue to provide a correct service even when some of their replicas fail arbitrarily, either accidentally or due to malicious faults. Current BFT algorithms perform well on LANs but when the replicas are distributed geographically their performance is affected by the lower bandwidth and the higher and more heterogeneous network latencies. This paper proposes and evaluates a novel BFT algorithm for WANs that requires fewer communication steps, fewer replicas and has better throughput and latency than others in the literature. The paper presents an extensive evaluation of the algorithm's performance in several settings and conditions: in a LAN; in real and emulated WANs; with clients close to servers and dispersed geographically; with similar and different communication latencies between clients and servers. ion latencies between clients and servers.
Author Giuliana Santos Veronese + , Miguel Correia + , Alysson Bessani + , Lau Cheuk Lung +
Booktitle Proceedings of the 12th IEEE International High Assurance Systems Engineering Symposium - HASE'10. San Jose, CA, USA. November 2010.  +
Key Veronese10ebawa  +
Month oct  +
NumPubDate 2,010.1  +
Project Project:TCLOUDS + , Project:REGENESYS + , Project:ReD +
ResearchLine Fault And Intrusion Tolerance in Open Distributed Systems (FIT) +
Title EBAWA: Efficient Byzantine Agreement for Wide-Area Networks  +
Type inproceedings  +
Url  +
Year 2010  +
Categories Publication  +
Modification¬†dateThis property is a special property in this wiki. 14 January 2013 14:40:55  +
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