Modeling and validating the performance of atomic broadcast algorithms in high-latency networks

The performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the number of messages needed to reach a decision. In this paper, we model the performance of three consensus and atomic broadcast algorithms using failure detectors in the oft-neglected setting of wide area networks and validate this model by experimentally evaluating the algorithms in several different setups.


Published in:
Proc. Euro-Par 2007, Parallel Processing, 574-586
Presented at:
Euro-Par 2007, Rennes, France, August 2007
Year:
2007
Publisher:
Springer
Keywords:
Laboratories:




 Record created 2007-12-12, last modified 2018-11-26

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)