Optimistic Voting for Managing Replicated Data

An epidemic model gives an efficient approach fortransaction processing of replication systems in weakly connectedenvironments. The approach has the advantages of high adaptation,support for low-bandwidth network, and committing updates in anentirely decentralized control fashion. But the previous implementingprotocols, like ROWA protocol, quorum protocol, and voting protocol,have a common shortcoming that they are pessimistic in conflictreconciliation, therefore bring high transaction abort rate and reducesystem performance dramatically when the workload scales up. In thispaper, an optimistic voting protocol, which introducescondition vote and order vote in the voting process oftransactions, is proposed. The condition vote and ordervote postpone the final decision on conflicting transactions and avoidtransaction aborts that are incurred by read-write and write-writeconflicts. Experimental results indicate that the optimistic votingprotocol decreases abort rate and improves average response time oftransactions markedly when compared to other protocols.