Abstract
When data are replicated an access protocol must be chosen to ensure the presentation of a consistent view of the data. Protocols based on quorum consensus provide good availability with the added benefit of mutual exclusion. Of the protocols based on quorum consensus, the dynamic voting protocols provide the highest known availability. A dynamic voting protocol that does not need the instantaneous state information required by the original dynamic voting proposal is described. It provides the same performance as the original dynamic voting in the asymptotic case and quickly converges to it for realistic access rates, at a cost in network traffic similar so that of static majority consensus voting. The availability afforded by dynamic voting protocols is analyzed, taking the access frequency into account. The analysis confirms the hypothesis that delaying state information does not appreciably affect availability. Discrete event simulation is used to confirm and to extend the analytical results. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
