Abstract
Two novel dynamic voting algorithms are proposed. One, called optimistic dynamic voting, operates on possibly out-of-date information, which greatly increases the efficiency of the algorithm and simplifies its implementation. The other, called topological dynamic voting, explicitly takes into account the topology of the network on which the copies reside to increase the availability of the replicated data. The authors compare availabilities of replicated data managed by both algorithms with those of data managed by existing voting protocols using a simulation model with realistic parameters. Optimistic dynamic voting is found to perform as well as the best existing voting algorithms while topological dynamic voting performs much better than all other voting algorithms when two or more copies reside in the same nonpartitionable group. >
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.
